WorldWideScience

Sample records for vm showed networks

  1. Exploiting VM/XA

    International Nuclear Information System (INIS)

    Boeheim, C.

    1990-03-01

    The Stanford Linear Accelerator Center has recently completed a conversion to IBM's VM/XA SP Release 2 operating system. The primary physics application had been constrained by the previous 16 megabyte memory limit. Work is underway to enable this application to exploit the new features of VM/XA. This paper presents a brief tutorial on how to convert an application to exploit VM/XA and discusses some of the SLAC experiences in doing so. 13 figs

  2. Status and Roadmap of CernVM

    Science.gov (United States)

    Berzano, D.; Blomer, J.; Buncic, P.; Charalampidis, I.; Ganis, G.; Meusel, R.

    2015-12-01

    Cloud resources nowadays contribute an essential share of resources for computing in high-energy physics. Such resources can be either provided by private or public IaaS clouds (e.g. OpenStack, Amazon EC2, Google Compute Engine) or by volunteers computers (e.g. LHC@Home 2.0). In any case, experiments need to prepare a virtual machine image that provides the execution environment for the physics application at hand. The CernVM virtual machine since version 3 is a minimal and versatile virtual machine image capable of booting different operating systems. The virtual machine image is less than 20 megabyte in size. The actual operating system is delivered on demand by the CernVM File System. CernVM 3 has matured from a prototype to a production environment. It is used, for instance, to run LHC applications in the cloud, to tune event generators using a network of volunteer computers, and as a container for the historic Scientific Linux 5 and Scientific Linux 4 based software environments in the course of long-term data preservation efforts of the ALICE, CMS, and ALEPH experiments. We present experience and lessons learned from the use of CernVM at scale. We also provide an outlook on the upcoming developments. These developments include adding support for Scientific Linux 7, the use of container virtualization, such as provided by Docker, and the streamlining of virtual machine contextualization towards the cloud-init industry standard.

  3. Enabling μCernVM for the Interactive Use Case

    CERN Document Server

    Nicolaou, Vasilis

    2013-01-01

    The $\\mu$CernVM will be the successor of the CernVM as a new appliance to help with accessing LHC for data analysis and development. CernVM has a web appliance agent that facilitates user interaction with the virtual machine and reduces the need for executing shell commands or installing graphical applications for displaying basic information such as memory usage or performing simple tasks such as updating the operating system. The updates are done differently in the $\\mu$CernVM than mainstream Linux distributions. Its filesystem is a composition of a read-only layer that exists in the network and a read/write layer that is initilised on first boot and keeps the user changes afterwards. Thus, means are provided to avoid loss of user data and system instabilities when the operating system is updated by fetching a new read-only layer.

  4. CernVM - a virtual software appliance for LHC applications

    International Nuclear Information System (INIS)

    Buncic, P; Sanchez, C Aguado; Blomer, J; Franco, L; Mato, P; Harutyunian, A; Yao, Y

    2010-01-01

    CernVM is a Virtual Software Appliance capable of running physics applications from the LHC experiments at CERN. It aims to provide a complete and portable environment for developing and running LHC data analysis on any end-user computer (laptop, desktop) as well as on the Grid, independently of Operating System platforms (Linux, Windows, MacOS). The experiment application software and its specific dependencies are built independently from CernVM and delivered to the appliance just in time by means of a CernVM File System (CVMFS) specifically designed for efficient software distribution. The procedures for building, installing and validating software releases remains under the control and responsibility of each user community. We provide a mechanism to publish pre-built and configured experiment software releases to a central distribution point from where it finds its way to the running CernVM instances via the hierarchy of proxy servers or content delivery networks. In this paper, we present current state of CernVM project and compare performance of CVMFS to performance of traditional network file system like AFS and discuss possible scenarios that could further improve its performance and scalability.

  5. Can recurrence networks show small-world property?

    International Nuclear Information System (INIS)

    Jacob, Rinku; Harikrishnan, K.P.; Misra, R.; Ambika, G.

    2016-01-01

    Recurrence networks are complex networks, constructed from time series data, having several practical applications. Though their properties when constructed with the threshold value ϵ chosen at or just above the percolation threshold of the network are quite well understood, what happens as the threshold increases beyond the usual operational window is still not clear from a complex network perspective. The present Letter is focused mainly on the network properties at intermediate-to-large values of the recurrence threshold, for which no systematic study has been performed so far. We argue, with numerical support, that recurrence networks constructed from chaotic attractors with ϵ equal to the usual recurrence threshold or slightly above cannot, in general, show small-world property. However, if the threshold is further increased, the recurrence network topology initially changes to a small-world structure and finally to that of a classical random graph as the threshold approaches the size of the strange attractor. - Highlights: • Properties of recurrence networks at intermediate-to-large values of recurrence threshold are analyzed from a complex network perspective. • Using a combined plot of characteristic path length and clustering coefficient, it is shown that the recurrence network constructed with recurrence threshold equal to or just above the percolation threshold cannot, in general, display small-world property. • As the recurrence threshold is increased from its usual operational window, the resulting network makes a smooth transition initially to a small-world network for an intermediate range of thresholds and finally to the classical random graph as the threshold becomes comparable to the size of the attractor.

  6. Can recurrence networks show small-world property?

    Energy Technology Data Exchange (ETDEWEB)

    Jacob, Rinku, E-mail: rinku.jacob.vallanat@gmail.com [Department of Physics, The Cochin College, Cochin, 682002 (India); Harikrishnan, K.P., E-mail: kp_hk2002@yahoo.co.in [Department of Physics, The Cochin College, Cochin, 682002 (India); Misra, R., E-mail: rmisra@iucaa.in [Inter University Centre for Astronomy and Astrophysics, Pune, 411007 (India); Ambika, G., E-mail: g.ambika@iiserpune.ac.in [Indian Institute of Science Education and Research, Pune, 411008 (India)

    2016-08-12

    Recurrence networks are complex networks, constructed from time series data, having several practical applications. Though their properties when constructed with the threshold value ϵ chosen at or just above the percolation threshold of the network are quite well understood, what happens as the threshold increases beyond the usual operational window is still not clear from a complex network perspective. The present Letter is focused mainly on the network properties at intermediate-to-large values of the recurrence threshold, for which no systematic study has been performed so far. We argue, with numerical support, that recurrence networks constructed from chaotic attractors with ϵ equal to the usual recurrence threshold or slightly above cannot, in general, show small-world property. However, if the threshold is further increased, the recurrence network topology initially changes to a small-world structure and finally to that of a classical random graph as the threshold approaches the size of the strange attractor. - Highlights: • Properties of recurrence networks at intermediate-to-large values of recurrence threshold are analyzed from a complex network perspective. • Using a combined plot of characteristic path length and clustering coefficient, it is shown that the recurrence network constructed with recurrence threshold equal to or just above the percolation threshold cannot, in general, display small-world property. • As the recurrence threshold is increased from its usual operational window, the resulting network makes a smooth transition initially to a small-world network for an intermediate range of thresholds and finally to the classical random graph as the threshold becomes comparable to the size of the attractor.

  7. Micro-CernVM: slashing the cost of building and deploying virtual machines

    International Nuclear Information System (INIS)

    Blomer, J; Berzano, D; Buncic, P; Charalampidis, I; Ganis, G; Lestaris, G; Meusel, R; Nicolaou, V

    2014-01-01

    The traditional virtual machine (VM) building and and deployment process is centered around the virtual machine hard disk image. The packages comprising the VM operating system are carefully selected, hard disk images are built for a variety of different hypervisors, and images have to be distributed and decompressed in order to instantiate a virtual machine. Within the HEP community, the CernVM File System (CernVM-FS) has been established in order to decouple the distribution from the experiment software from the building and distribution of the VM hard disk images. We show how to get rid of such pre-built hard disk images altogether. Due to the high requirements on POSIX compliance imposed by HEP application software, CernVM-FS can also be used to host and boot a Linux operating system. This allows the use of a tiny bootable CD image that comprises only a Linux kernel while the rest of the operating system is provided on demand by CernVM-FS. This approach speeds up the initial instantiation time and reduces virtual machine image sizes by an order of magnitude. Furthermore, security updates can be distributed instantaneously through CernVM-FS. By leveraging the fact that CernVM-FS is a versioning file system, a historic analysis environment can be easily re-spawned by selecting the corresponding CernVM-FS file system snapshot.

  8. Droplet networks with incorporated protein diodes show collective properties

    Science.gov (United States)

    Maglia, Giovanni; Heron, Andrew J.; Hwang, William L.; Holden, Matthew A.; Mikhailova, Ellina; Li, Qiuhong; Cheley, Stephen; Bayley, Hagan

    2009-07-01

    Recently, we demonstrated that submicrolitre aqueous droplets submerged in an apolar liquid containing lipid can be tightly connected by means of lipid bilayers to form networks. Droplet interface bilayers have been used for rapid screening of membrane proteins and to form asymmetric bilayers with which to examine the fundamental properties of channels and pores. Networks, meanwhile, have been used to form microscale batteries and to detect light. Here, we develop an engineered protein pore with diode-like properties that can be incorporated into droplet interface bilayers in droplet networks to form devices with electrical properties including those of a current limiter, a half-wave rectifier and a full-wave rectifier. The droplet approach, which uses unsophisticated components (oil, lipid, salt water and a simple pore), can therefore be used to create multidroplet networks with collective properties that cannot be produced by droplet pairs.

  9. CernVM Online and Cloud Gateway: a uniform interface for CernVM contextualization and deployment

    International Nuclear Information System (INIS)

    Lestaris, G; Charalampidis, I; Berzano, D; Blomer, J; Buncic, P; Ganis, G; Meusel, R

    2014-01-01

    In a virtualized environment, contextualization is the process of configuring a VM instance for the needs of various deployment use cases. Contextualization in CernVM can be done by passing a handwritten context to the user data field of cloud APIs, when running CernVM on the cloud, or by using CernVM web interface when running the VM locally. CernVM Online is a publicly accessible web interface that unifies these two procedures. A user is able to define, store and share CernVM contexts using CernVM Online and then apply them either in a cloud by using CernVM Cloud Gateway or on a local VM with the single-step pairing mechanism. CernVM Cloud Gateway is a distributed system that provides a single interface to use multiple and different clouds (by location or type, private or public). Cloud gateway has been so far integrated with OpenNebula, CloudStack and EC2 tools interfaces. A user, with access to a number of clouds, can run CernVM cloud agents that will communicate with these clouds using their interfaces, and then use one single interface to deploy and scale CernVM clusters. CernVM clusters are defined in CernVM Online and consist of a set of CernVM instances that are contextualized and can communicate with each other.

  10. Developing the Value Management Maturity Model (VM

    Directory of Open Access Journals (Sweden)

    Saipol Bari Abd Karim

    2013-06-01

    Full Text Available Value management (VM practices have been expanded and became a well-received technique globally. Organisations are now progressing towards a better implementation of VM and should be assessing their strengths and weaknesses in order to move forward competitively. There is a need to benchmark the existing VM practices to reflect their maturing levels which is currently not available. This paper outlines the concept of Value Management Maturity Model (VM3' as a structured plan of maturity and performance growth for businesses. It proposes five levels of maturity and each level has its own criteria or attributes to be achieved before progressing to a higher level. The framework for VM3' has been developed based on the review of literatures related to VM and maturity models (MM. Data is collected through questionnaire surveys to organisations that have implemented VM methodology. Additionally, semi-structured interviews were conducted to select individuals involved in implementing VM. The questions were developed to achieve the research objectives; investigating the current implementation of VM and, exploring the organisation's MM knowledge and practices. However, this research was limited to VM implementation in the Malaysian government's projects and programmes. VM3' introduces a new paradigm in VM as it provides a rating method for capabilities or performance. It is advocated that this VM3' framework is still being refined in the advance stage in order to provide a comprehensive and well accepted method to provide ratings for organisations' maturity.

  11. Security model for VM in cloud

    Science.gov (United States)

    Kanaparti, Venkataramana; Naveen K., R.; Rajani, S.; Padmvathamma, M.; Anitha, C.

    2013-03-01

    Cloud computing is a new approach emerged to meet ever-increasing demand for computing resources and to reduce operational costs and Capital Expenditure for IT services. As this new way of computation allows data and applications to be stored away from own corporate server, it brings more issues in security such as virtualization security, distributed computing, application security, identity management, access control and authentication. Even though Virtualization forms the basis for cloud computing it poses many threats in securing cloud. As most of Security threats lies at Virtualization layer in cloud we proposed this new Security Model for Virtual Machine in Cloud (SMVC) in which every process is authenticated by Trusted-Agent (TA) in Hypervisor as well as in VM. Our proposed model is designed to with-stand attacks by unauthorized process that pose threat to applications related to Data Mining, OLAP systems, Image processing which requires huge resources in cloud deployed on one or more VM's.

  12. Diffusion bonding of IN 718 to VM 350 grade maraging steel

    Science.gov (United States)

    Crosby, S. R.; Biederman, R. R.; Reynolds, C. C.

    1972-01-01

    Diffusion bonding studies have been conducted on IN 718, VM 350 and the dissimilar alloy couple, IN 718 to maraging steel. The experimental processing parameters critical to obtaining consistently good diffusion bonds between IN 718 and VM 350 were determined. Interrelationships between temperature, pressure and surface preparation were explored for short bending intervals under vacuum conditions. Successful joining was achieved for a range of bonding cycle temperatures, pressures and surface preparations. The strength of the weaker parent material was used as a criterion for a successful tensile test of the heat treated bond. Studies of VM-350/VM-350 couples in the as-bonded condition showed a greater yielding and failure outside the bond region.

  13. Biological effects of 60Co γ-irradiation on Laiwu ginger VM1 growth

    International Nuclear Information System (INIS)

    Zhou Ming; Huang Jinli; Wei Yuxia; Guan Qiuzhu; Zhang Zhenxian

    2008-01-01

    Rhizome of Laiwu ginger were treated with γ-irradiation at the doses of 0, 20, 40 and 60 Gy. The results showed that 60 Co γ-irradiation inhibited the rhizome burgeoning, and decreased the survival rate of the seedlings, rate of leaf- expansion and the growth of plants (VM 1 ). The inhibition effects became stronger with the increase of the irradiation dose. Different bands were found through the analysis of POD, EST isozymes and RAPD of VM 1 plants, which showed that variation on molecular level occurred in VM 1 plants. LD 30-40 was appropriate for the irradiation of rhizomes of Laiwu ginger and the optimal irradiation dose was about 20- 30 Gy. (authors)

  14. A VM-shared desktop virtualization system based on OpenStack

    Science.gov (United States)

    Liu, Xi; Zhu, Mingfa; Xiao, Limin; Jiang, Yuanjie

    2018-04-01

    With the increasing popularity of cloud computing, desktop virtualization is rising in recent years as a branch of virtualization technology. However, existing desktop virtualization systems are mostly designed as a one-to-one mode, which one VM can only be accessed by one user. Meanwhile, previous desktop virtualization systems perform weakly in terms of response time and cost saving. This paper proposes a novel VM-Shared desktop virtualization system based on OpenStack platform. The paper modified the connecting process and the display data transmission process of the remote display protocol SPICE to support VM-Shared function. On the other hand, we propose a server-push display mode to improve user interactive experience. The experimental results show that our system performs well in response time and achieves a low CPU consumption.

  15. Optimizing VM allocation and data placement for data-intensive applications in cloud using ACO metaheuristic algorithm

    Directory of Open Access Journals (Sweden)

    T.P. Shabeera

    2017-04-01

    Full Text Available Nowadays data-intensive applications for processing big data are being hosted in the cloud. Since the cloud environment provides virtualized resources for computation, and data-intensive applications require communication between the computing nodes, the placement of Virtual Machines (VMs and location of data affect the overall computation time. Majority of the research work reported in the current literature consider the selection of physical nodes for placing data and VMs as independent problems. This paper proposes an approach which considers VM placement and data placement hand in hand. The primary objective is to reduce cross network traffic and bandwidth usage, by placing required number of VMs and data in Physical Machines (PMs which are physically closer. The VM and data placement problem (referred as MinDistVMDataPlacement problem is defined in this paper and has been proved to be NP- Hard. This paper presents and evaluates a metaheuristic algorithm based on Ant Colony Optimization (ACO, which selects a set of adjacent PMs for placing data and VMs. Data is distributed in the physical storage devices of the selected PMs. According to the processing capacity of each PM, a set of VMs are placed on these PMs to process data stored in them. We use simulation to evaluate our algorithm. The results show that the proposed algorithm selects PMs in close proximity and the jobs executed in the VMs allocated by the proposed scheme outperforms other allocation schemes.

  16. Moving to a total VM environment

    International Nuclear Information System (INIS)

    Johnston, T.Y.

    1981-01-01

    The Stanford Linear Accelerator Center is a single purpose laboratory operated by Stanford University for the Department of Energy. Its mission is to do research in High Energy (particle) physics. This research involves the use of large and complex electronic detectors. Each of these detectors is a multi-million dollar device. A part of each detector is a computer for process control and data logging. Most detectors at SLAC now use VAX 11/780s for this purpose. Most detectors record digital data via this process control computer. Consequently, physics today is not bounded by the cost of analog to digital conversion as it was in the past, and the physicist is able to run larger experiments than were feasible a decade ago. Today a medium sized experiment will produce several hundred full reels of 6250 BPI tape whereas a large experiment is a couple of thousand reels. The raw data must first be transformed into physics events using data transformation programs. The physicists then use subsets of the data to understand what went on. The subset may be anywhere from a few megabytes to 5 or 6 gigabytes of data (30 or 40 full reels of tape). This searching would be best solved interactively (if computers and I/0 devices were fast enough). Instead what we find are very dynamic batch programs that are generally changed every run. The result is that on any day there are probably around 50 to 100 physicists interacting with a half dozen different experiments who are causing us to mount around 750 to 1000 tapes a day. This has been the style of computing for the last decade. Our going to VM is part of our effort to change this style of computing and to make physics computing more effective

  17. A human protein interaction network shows conservation of aging processes between human and invertebrate species.

    Directory of Open Access Journals (Sweden)

    Russell Bell

    2009-03-01

    Full Text Available We have mapped a protein interaction network of human homologs of proteins that modify longevity in invertebrate species. This network is derived from a proteome-scale human protein interaction Core Network generated through unbiased high-throughput yeast two-hybrid searches. The longevity network is composed of 175 human homologs of proteins known to confer increased longevity through loss of function in yeast, nematode, or fly, and 2,163 additional human proteins that interact with these homologs. Overall, the network consists of 3,271 binary interactions among 2,338 unique proteins. A comparison of the average node degree of the human longevity homologs with random sets of proteins in the Core Network indicates that human homologs of longevity proteins are highly connected hubs with a mean node degree of 18.8 partners. Shortest path length analysis shows that proteins in this network are significantly more connected than would be expected by chance. To examine the relationship of this network to human aging phenotypes, we compared the genes encoding longevity network proteins to genes known to be changed transcriptionally during aging in human muscle. In the case of both the longevity protein homologs and their interactors, we observed enrichments for differentially expressed genes in the network. To determine whether homologs of human longevity interacting proteins can modulate life span in invertebrates, homologs of 18 human FRAP1 interacting proteins showing significant changes in human aging muscle were tested for effects on nematode life span using RNAi. Of 18 genes tested, 33% extended life span when knocked-down in Caenorhabditis elegans. These observations indicate that a broad class of longevity genes identified in invertebrate models of aging have relevance to human aging. They also indicate that the longevity protein interaction network presented here is enriched for novel conserved longevity proteins.

  18. Overhead-Aware-Best-Fit (OABF) Resource Allocation Algorithm for Minimizing VM Launching Overhead

    Energy Technology Data Exchange (ETDEWEB)

    Wu, Hao [IIT; Garzoglio, Gabriele [Fermilab; Ren, Shangping [IIT, Chicago; Timm, Steven [Fermilab; Noh, Seo Young [KISTI, Daejeon

    2014-11-11

    FermiCloud is a private cloud developed in Fermi National Accelerator Laboratory to provide elastic and on-demand resources for different scientific research experiments. The design goal of the FermiCloud is to automatically allocate resources for different scientific applications so that the QoS required by these applications is met and the operational cost of the FermiCloud is minimized. Our earlier research shows that VM launching overhead has large variations. If such variations are not taken into consideration when making resource allocation decisions, it may lead to poor performance and resource waste. In this paper, we show how we may use an VM launching overhead reference model to minimize VM launching overhead. In particular, we first present a training algorithm that automatically tunes a given refer- ence model to accurately reflect FermiCloud environment. Based on the tuned reference model for virtual machine launching overhead, we develop an overhead-aware-best-fit resource allocation algorithm that decides where and when to allocate resources so that the average virtual machine launching overhead is minimized. The experimental results indicate that the developed overhead-aware-best-fit resource allocation algorithm can significantly improved the VM launching time when large number of VMs are simultaneously launched.

  19. Calorie restriction as an anti-invasive therapy for malignant brain cancer in the VM mouse.

    Science.gov (United States)

    Shelton, Laura M; Huysentruyt, Leanne C; Mukherjee, Purna; Seyfried, Thomas N

    2010-07-23

    GBM (glioblastoma multiforme) is the most aggressive and invasive form of primary human brain cancer. We recently developed a novel brain cancer model in the inbred VM mouse strain that shares several characteristics with human GBM. Using bioluminescence imaging, we tested the efficacy of CR (calorie restriction) for its ability to reduce tumour size and invasion. CR targets glycolysis and rapid tumour cell growth in part by lowering circulating glucose levels. The VM-M3 tumour cells were implanted intracerebrally in the syngeneic VM mouse host. Approx. 12-15 days post-implantation, brains were removed and both ipsilateral and contralateral hemispheres were imaged to measure bioluminescence of invading tumour cells. CR significantly reduced the invasion of tumour cells from the implanted ipsilateral hemisphere into the contralateral hemisphere. The total percentage of Ki-67-stained cells within the primary tumour and the total number of blood vessels was also significantly lower in the CR-treated mice than in the mice fed ad libitum, suggesting that CR is anti-proliferative and anti-angiogenic. Our findings indicate that the VM-M3 GBM model is a valuable tool for studying brain tumour cell invasion and for evaluating potential therapeutic approaches for managing invasive brain cancer. In addition, we show that CR can be effective in reducing malignant brain tumour growth and invasion.

  20. Calorie Restriction as an Anti-Invasive Therapy for Malignant Brain Cancer in the VM Mouse

    Directory of Open Access Journals (Sweden)

    Laura M Shelton

    2010-07-01

    Full Text Available GBM (glioblastoma multiforme is the most aggressive and invasive form of primary human brain cancer. We recently developed a novel brain cancer model in the inbred VM mouse strain that shares several characteristics with human GBM. Using bioluminescence imaging, we tested the efficacy of CR (calorie restriction for its ability to reduce tumour size and invasion. CR targets glycolysis and rapid tumour cell growth in part by lowering circulating glucose levels. The VM-M3 tumour cells were implanted intracerebrally in the syngeneic VM mouse host. Approx. 12-15 days post-implantation, brains were removed and both ipsilateral and contralateral hemispheres were imaged to measure bioluminescence of invading tumour cells. CR significantly reduced the invasion of tumour cells from the implanted ipsilateral hemisphere into the contralateral hemisphere. The total percentage of Ki-67-stained cells within the primary tumour and the total number of blood vessels was also significantly lower in the CR-treated mice than in the mice fed ad libitum, suggesting that CR is anti-proliferative and anti-angiogenic. Our findings indicate that the VM-M3 GBM model is a valuable tool for studying brain tumour cell invasion and for evaluating potential therapeutic approaches for managing invasive brain cancer. In addition, we show that CR can be effective in reducing malignant brain tumour growth and invasion.

  1. The Conserved Spore Coat Protein SpoVM Is Largely Dispensable in Clostridium difficile Spore Formation.

    Science.gov (United States)

    Ribis, John W; Ravichandran, Priyanka; Putnam, Emily E; Pishdadian, Keyan; Shen, Aimee

    2017-01-01

    The spore-forming bacterial pathogen Clostridium difficile is a leading cause of health care-associated infections in the United States. In order for this obligate anaerobe to transmit infection, it must form metabolically dormant spores prior to exiting the host. A key step during this process is the assembly of a protective, multilayered proteinaceous coat around the spore. Coat assembly depends on coat morphogenetic proteins recruiting distinct subsets of coat proteins to the developing spore. While 10 coat morphogenetic proteins have been identified in Bacillus subtilis , only two of these morphogenetic proteins have homologs in the Clostridia : SpoIVA and SpoVM. C. difficile SpoIVA is critical for proper coat assembly and functional spore formation, but the requirement for SpoVM during this process was unknown. Here, we show that SpoVM is largely dispensable for C. difficile spore formation, in contrast with B. subtilis . Loss of C. difficile SpoVM resulted in modest decreases (~3-fold) in heat- and chloroform-resistant spore formation, while morphological defects such as coat detachment from the forespore and abnormal cortex thickness were observed in ~30% of spoVM mutant cells. Biochemical analyses revealed that C. difficile SpoIVA and SpoVM directly interact, similarly to their B. subtilis counterparts. However, in contrast with B. subtilis , C. difficile SpoVM was not essential for SpoIVA to encase the forespore. Since C. difficile coat morphogenesis requires SpoIVA-interacting protein L (SipL), which is conserved exclusively in the Clostridia , but not the more broadly conserved SpoVM, our results reveal another key difference between C. difficile and B. subtilis spore assembly pathways. IMPORTANCE The spore-forming obligate anaerobe Clostridium difficile is the leading cause of antibiotic-associated diarrheal disease in the United States. When C. difficile spores are ingested by susceptible individuals, they germinate within the gut and

  2. Porting of $\\mu$CernVM to AArch64

    CERN Document Server

    Scheffler, Felix

    2016-01-01

    $\\mu$CernVM is a virtual appliance that contains a stripped-down Linux OS connecting to a CernVM-Filesystem (CVMFS) repository that resides on a dedicated web server. In contrast to “usual” VMs, anything that is needed from this repository is only downloaded on demand, aggressively cached and eventually released again. Currently, $\\mu$CernVM is only distributed for x86-64. Recently, ARM (market leader in mobile computing) has started to enter the server market, which is still dominated by x86-64 infrastructure. However, in terms of performance/watt, AArch64 (latest ARM 64bit architecture) is a promising alternative. Facing millions of jobs to compute every day, it is thus desirable to have an HEP virtualisation solution for AArch64. In this project, $\\mu$CernVM was successfully ported to AArch64. Native and virtualised runtime performance was evaluated using ROOT6 and CMS benchmarks. It was found that VM performance is inferior to host performance across all tests. Respective numbers greatly vary between...

  3. Optimization of CernVM early boot process

    CERN Document Server

    Mazdin, Petra

    2015-01-01

    CernVM virtual machine is a Linux based virtual appliance optimized for High Energy Physics experiments. It is used for cloud computing, volunteer computing, and software development by the four large LHC experiments. The goal of this project is proling and optimizing the boot process of the CernVM. A key part was the development of a performance profiler for shell scripts as an extension to the popular BusyBox open source UNIX tool suite. Based on the measurements, costly shell code was replaced by more efficient, custom C programs. The results are compared to the original ones and successful optimization is proven.

  4. Constraining models of postglacial rebound using space geodesy: a detailed assessment of model ICE-5G (VM2) and its relatives

    Science.gov (United States)

    Argus, Donald F.; Peltier, W. Richard

    2010-05-01

    Using global positioning system, very long baseline interferometry, satellite laser ranging and Doppler Orbitography and Radiopositioning Integrated by Satellite observations, including the Canadian Base Network and Fennoscandian BIFROST array, we constrain, in models of postglacial rebound, the thickness of the ice sheets as a function of position and time and the viscosity of the mantle as a function of depth. We test model ICE-5G VM2 T90 Rot, which well fits many hundred Holocene relative sea level histories in North America, Europe and worldwide. ICE-5G is the deglaciation history having more ice in western Canada than ICE-4G; VM2 is the mantle viscosity profile having a mean upper mantle viscosity of 0.5 × 1021Pas and a mean uppermost-lower mantle viscosity of 1.6 × 1021Pas T90 is an elastic lithosphere thickness of 90 km; and Rot designates that the model includes (rotational feedback) Earth's response to the wander of the North Pole of Earth's spin axis towards Canada at a speed of ~1° Myr-1. The vertical observations in North America show that, relative to ICE-5G, the Laurentide ice sheet at last glacial maximum (LGM) at ~26 ka was (1) much thinner in southern Manitoba, (2) thinner near Yellowknife (Northwest Territories), (3) thicker in eastern and southern Quebec and (4) thicker along the northern British Columbia-Alberta border, or that ice was unloaded from these areas later (thicker) or earlier (thinner) than in ICE-5G. The data indicate that the western Laurentide ice sheet was intermediate in mass between ICE-5G and ICE-4G. The vertical observations and GRACE gravity data together suggest that the western Laurentide ice sheet was nearly as massive as that in ICE-5G but distributed more broadly across northwestern Canada. VM2 poorly fits the horizontal observations in North America, predicting places along the margins of the Laurentide ice sheet to be moving laterally away from the ice centre at 2 mm yr-1 in ICE-4G and 3 mm yr-1 in ICE-5G, in

  5. Research and Implementation of Software Used for the Remote Control for VM700T Video Measuring Instrument

    Directory of Open Access Journals (Sweden)

    Song Wenjie

    2015-01-01

    Full Text Available In this paper, the measurement software which can be used to realize remote control of the VM700T video measuring instrument is introduced. The authors can operate VM700T by a virtual panel on the client computer, select the results that the measuring equipment displayed to transmit it, and then display the image on the VM700T virtual panel in real time. The system does have some practical values and play an important role in distance learning. The functions that the system realized mainly includes four aspects: the real-time transmission of message based on the socket technology, the serial connection between server PC and VM700T measuring equipment, the image acquisition based on VFW technology and JPEG compression and decompression, and the network transmission of image files. The actual network transmission test is shown that the data acquisition method of this thesis is flexible and convenient, and the system is of extraordinary stability. It can display the measurement results in real time and basically realize the requirements of remote control. In the content, this paper includes a summary of principle, the detailed introduction of the system realization process and some related technology.

  6. PEMILIHAN DAN MIGRASI VM MENGGUNAKAN MCDM UNTUK PENINGKATAN KINERJA LAYANAN PADA CLOUD COMPUTING

    Directory of Open Access Journals (Sweden)

    Abdullah Fadil

    2016-08-01

    Full Text Available Komputasi awan atau cloud computing merupakan lingkungan yang heterogen dan terdistribusi, tersusun atas gugusan jaringan server dengan berbagai kapasitas sumber daya komputasi yang berbeda-beda guna menopang model layanan yang ada di atasnya. Virtual machine (VM dijadikan sebagai representasi dari ketersediaan sumber daya komputasi dinamis yang dapat dialokasikan dan direalokasikan sesuai dengan permintaan. Mekanisme live migration VM di antara server fisik yang terdapat di dalam data center cloud digunakan untuk mencapai konsolidasi dan memaksimalkan utilisasi VM. Pada prosedur konsoidasi vm, pemilihan dan penempatan VM sering kali menggunakan kriteria tunggal dan statis. Dalam penelitian ini diusulkan pemilihan dan penempatan VM menggunakan multi-criteria decision making (MCDM pada prosedur konsolidasi VM dinamis di lingkungan cloud data center guna meningkatkan layanan cloud computing. Pendekatan praktis digunakan dalam mengembangkan lingkungan cloud computing berbasis OpenStack Cloud dengan mengintegrasikan VM selection dan VM Placement pada prosedur konsolidasi VM menggunakan OpenStack-Neat. Hasil penelitian menunjukkan bahwa metode pemilihan dan penempatan VM melalui live migration mampu menggantikan kerugian yang disebabkan oleh down-times sebesar 11,994 detik dari waktu responnya. Peningkatan response times terjadi sebesar 6 ms ketika terjadi proses live migration VM dari host asal ke host tujuan. Response times rata-rata setiap vm yang tersebar pada compute node setelah terjadi proses live migration sebesar 67 ms yang menunjukkan keseimbangan beban pada sistem cloud computing.

  7. Construction and comparison of gene co-expression networks shows complex plant immune responses

    Directory of Open Access Journals (Sweden)

    Luis Guillermo Leal

    2014-10-01

    Full Text Available Gene co-expression networks (GCNs are graphic representations that depict the coordinated transcription of genes in response to certain stimuli. GCNs provide functional annotations of genes whose function is unknown and are further used in studies of translational functional genomics among species. In this work, a methodology for the reconstruction and comparison of GCNs is presented. This approach was applied using gene expression data that were obtained from immunity experiments in Arabidopsis thaliana, rice, soybean, tomato and cassava. After the evaluation of diverse similarity metrics for the GCN reconstruction, we recommended the mutual information coefficient measurement and a clustering coefficient-based method for similarity threshold selection. To compare GCNs, we proposed a multivariate approach based on the Principal Component Analysis (PCA. Branches of plant immunity that were exemplified by each experiment were analyzed in conjunction with the PCA results, suggesting both the robustness and the dynamic nature of the cellular responses. The dynamic of molecular plant responses produced networks with different characteristics that are differentiable using our methodology. The comparison of GCNs from plant pathosystems, showed that in response to similar pathogens plants could activate conserved signaling pathways. The results confirmed that the closeness of GCNs projected on the principal component space is an indicative of similarity among GCNs. This also can be used to understand global patterns of events triggered during plant immune responses.

  8. SIMPLE HEURISTIC ALGORITHM FOR DYNAMIC VM REALLOCATION IN IAAS CLOUDS

    Directory of Open Access Journals (Sweden)

    Nikita A. Balashov

    2018-03-01

    Full Text Available The rapid development of cloud technologies and its high prevalence in both commercial and academic areas have stimulated active research in the domain of optimal cloud resource management. One of the most active research directions is dynamic virtual machine (VM placement optimization in clouds build on Infrastructure-as-a-Service model. This kind of research may pursue different goals with energy-aware optimization being the most common goal as it aims at a urgent problem of green cloud computing - reducing energy consumption by data centers. In this paper we present a new heuristic algorithm of dynamic reallocation of VMs based on an approach presented in one of our previous works. In the algorithm we apply a 2-rank strategy to classify VMs and servers corresponding to the highly and lowly active VMs and solve four tasks: VM classification, host classification, forming a VM migration map and VMs migration. Dividing all of the VMs and servers into two classes we attempt to implement the possibility of risk reduction in case of hardware overloads under overcommitment conditions and to reduce the influence of the occurring overloads on the performance of the cloud VMs. Presented algorithm was developed based on the workload profile of the JINR cloud (a scientific private cloud with the goal of maximizing its usage, but it can also be applied in both public and private commercial clouds to organize the simultaneous use of different SLA and QoS levels in the same cloud environment by giving each VM rank its own level of overcommitment.

  9. 3D-e-Chem-VM: Structural Cheminformatics Research Infrastructure in a Freely Available Virtual Machine

    NARCIS (Netherlands)

    McGuire, R.; Verhoeven, S.; Vass, M.; Vriend, G.; Esch, I.J. de; Lusher, S.J.; Leurs, R.; Ridder, L.; Kooistra, A.J.; Ritschel, T.; Graaf, C. de

    2017-01-01

    3D-e-Chem-VM is an open source, freely available Virtual Machine ( http://3d-e-chem.github.io/3D-e-Chem-VM/ ) that integrates cheminformatics and bioinformatics tools for the analysis of protein-ligand interaction data. 3D-e-Chem-VM consists of software libraries, and database and workflow tools

  10. 3D-e-Chem-VM : Structural Cheminformatics Research Infrastructure in a Freely Available Virtual Machine

    NARCIS (Netherlands)

    McGuire, Ross; Verhoeven, Stefan; Vass, Márton; Vriend, Gerrit; De Esch, Iwan J P; Lusher, Scott J.; Leurs, Rob; Ridder, Lars; Kooistra, Albert J.; Ritschel, Tina; de Graaf, C.

    2017-01-01

    3D-e-Chem-VM is an open source, freely available Virtual Machine ( http://3d-e-chem.github.io/3D-e-Chem-VM/ ) that integrates cheminformatics and bioinformatics tools for the analysis of protein-ligand interaction data. 3D-e-Chem-VM consists of software libraries, and database and workflow tools

  11. Resting-state networks associated with cognitive processing show more age-related decline than those associated with emotional processing.

    Science.gov (United States)

    Nashiro, Kaoru; Sakaki, Michiko; Braskie, Meredith N; Mather, Mara

    2017-06-01

    Correlations in activity across disparate brain regions during rest reveal functional networks in the brain. Although previous studies largely agree that there is an age-related decline in the "default mode network," how age affects other resting-state networks, such as emotion-related networks, is still controversial. Here we used a dual-regression approach to investigate age-related alterations in resting-state networks. The results revealed age-related disruptions in functional connectivity in all 5 identified cognitive networks, namely the default mode network, cognitive-auditory, cognitive-speech (or speech-related somatosensory), and right and left frontoparietal networks, whereas such age effects were not observed in the 3 identified emotion networks. In addition, we observed age-related decline in functional connectivity in 3 visual and 3 motor/visuospatial networks. Older adults showed greater functional connectivity in regions outside 4 out of the 5 identified cognitive networks, consistent with the dedifferentiation effect previously observed in task-based functional magnetic resonance imaging studies. Both reduced within-network connectivity and increased out-of-network connectivity were correlated with poor cognitive performance, providing potential biomarkers for cognitive aging. Copyright © 2017 Elsevier Inc. All rights reserved.

  12. The effect of future time perspective on delay discounting is mediated by the gray matter volume of vmPFC.

    Science.gov (United States)

    Guo, Yiqun; Chen, Zhiyi; Feng, Tingyong

    2017-07-28

    Although several previous studies have shown that individuals' attitude towards time could affect their intertemporal preference, little is known about the neural basis of the relation between time perspective (TP) and delay discounting. In the present study, we quantified the gray matter (GM) cortical volume using voxel-based morphometry (VBM) methods to investigate the effect of TP on delay discounting (DD) across two independent samples. For group 1 (102 healthy college students; 46 male; 20.40 ± 1.87 years), behavioral results showed that only Future TP was a significant predictor of DD, and higher scores on Future TP were related to lower discounting rates. Whole-brain analysis revealed that steeper discounting correlated with greater GM volume in the ventromedial prefrontal cortex (vmPFC) and ventral part of posterior cingulate cortex (vPCC). Also, GM volume of a cluster in the vmPFC was correlated with Future TP. Interestingly, there was an overlapping region in vmPFC that was correlated with both DD and Future TP. Region-of-interest analysis further indicated that the overlapping region of vmPFC played a partially mediating role in the relation between Future TP and DD in the other independent dataset (Group 2, 36 healthy college students; 14 male; 20.18±1.80 years). Taken together, our results provide a new perspective from neural basis for explaining the relation between DD and future TP. Copyright © 2017 Elsevier Ltd. All rights reserved.

  13. Algebraic connectivity of brain networks shows patterns of segregation leading to reduced network robustness in Alzheimer's disease

    Science.gov (United States)

    Daianu, Madelaine; Jahanshad, Neda; Nir, Talia M.; Leonardo, Cassandra D.; Jack, Clifford R.; Weiner, Michael W.; Bernstein, Matthew A.; Thompson, Paul M.

    2015-01-01

    Measures of network topology and connectivity aid the understanding of network breakdown as the brain degenerates in Alzheimer's disease (AD). We analyzed 3-Tesla diffusion-weighted images from 202 patients scanned by the Alzheimer's Disease Neuroimaging Initiative – 50 healthy controls, 72 with early- and 38 with late-stage mild cognitive impairment (eMCI/lMCI) and 42 with AD. Using whole-brain tractography, we reconstructed structural connectivity networks representing connections between pairs of cortical regions. We examined, for the first time in this context, the network's Laplacian matrix and its Fiedler value, describing the network's algebraic connectivity, and the Fiedler vector, used to partition a graph. We assessed algebraic connectivity and four additional supporting metrics, revealing a decrease in network robustness and increasing disarray among nodes as dementia progressed. Network components became more disconnected and segregated, and their modularity increased. These measures are sensitive to diagnostic group differences, and may help understand the complex changes in AD. PMID:26640830

  14. 77 FR 29637 - Game Show Network, LLC v. Cablevision Systems Corp.

    Science.gov (United States)

    2012-05-18

    ... Affairs Bureau at (202) 418-0530 (voice), (202) 418-0432 (TTY). Synopsis of the Order I. Introduction 1... its affiliated cable networks (American Movie Classics (AMC), Fuse, Independent Film Channel, WE tv...

  15. Social network analysis shows direct evidence for social transmission of tool use in wild chimpanzees.

    Directory of Open Access Journals (Sweden)

    Catherine Hobaiter

    2014-09-01

    Full Text Available Social network analysis methods have made it possible to test whether novel behaviors in animals spread through individual or social learning. To date, however, social network analysis of wild populations has been limited to static models that cannot precisely reflect the dynamics of learning, for instance, the impact of multiple observations across time. Here, we present a novel dynamic version of network analysis that is capable of capturing temporal aspects of acquisition--that is, how successive observations by an individual influence its acquisition of the novel behavior. We apply this model to studying the spread of two novel tool-use variants, "moss-sponging" and "leaf-sponge re-use," in the Sonso chimpanzee community of Budongo Forest, Uganda. Chimpanzees are widely considered the most "cultural" of all animal species, with 39 behaviors suspected as socially acquired, most of them in the domain of tool-use. The cultural hypothesis is supported by experimental data from captive chimpanzees and a range of observational data. However, for wild groups, there is still no direct experimental evidence for social learning, nor has there been any direct observation of social diffusion of behavioral innovations. Here, we tested both a static and a dynamic network model and found strong evidence that diffusion patterns of moss-sponging, but not leaf-sponge re-use, were significantly better explained by social than individual learning. The most conservative estimate of social transmission accounted for 85% of observed events, with an estimated 15-fold increase in learning rate for each time a novice observed an informed individual moss-sponging. We conclude that group-specific behavioral variants in wild chimpanzees can be socially learned, adding to the evidence that this prerequisite for culture originated in a common ancestor of great apes and humans, long before the advent of modern humans.

  16. Social network analysis shows direct evidence for social transmission of tool use in wild chimpanzees.

    Science.gov (United States)

    Hobaiter, Catherine; Poisot, Timothée; Zuberbühler, Klaus; Hoppitt, William; Gruber, Thibaud

    2014-09-01

    Social network analysis methods have made it possible to test whether novel behaviors in animals spread through individual or social learning. To date, however, social network analysis of wild populations has been limited to static models that cannot precisely reflect the dynamics of learning, for instance, the impact of multiple observations across time. Here, we present a novel dynamic version of network analysis that is capable of capturing temporal aspects of acquisition--that is, how successive observations by an individual influence its acquisition of the novel behavior. We apply this model to studying the spread of two novel tool-use variants, "moss-sponging" and "leaf-sponge re-use," in the Sonso chimpanzee community of Budongo Forest, Uganda. Chimpanzees are widely considered the most "cultural" of all animal species, with 39 behaviors suspected as socially acquired, most of them in the domain of tool-use. The cultural hypothesis is supported by experimental data from captive chimpanzees and a range of observational data. However, for wild groups, there is still no direct experimental evidence for social learning, nor has there been any direct observation of social diffusion of behavioral innovations. Here, we tested both a static and a dynamic network model and found strong evidence that diffusion patterns of moss-sponging, but not leaf-sponge re-use, were significantly better explained by social than individual learning. The most conservative estimate of social transmission accounted for 85% of observed events, with an estimated 15-fold increase in learning rate for each time a novice observed an informed individual moss-sponging. We conclude that group-specific behavioral variants in wild chimpanzees can be socially learned, adding to the evidence that this prerequisite for culture originated in a common ancestor of great apes and humans, long before the advent of modern humans.

  17. Toxicity and medical countermeasure studies on the organophosphorus nerve agents VM and VX.

    Science.gov (United States)

    Rice, Helen; Dalton, Christopher H; Price, Matthew E; Graham, Stuart J; Green, A Christopher; Jenner, John; Groombridge, Helen J; Timperley, Christopher M

    2015-04-08

    To support the effort to eliminate the Syrian Arab Republic chemical weapons stockpile safely, there was a requirement to provide scientific advice based on experimentally derived information on both toxicity and medical countermeasures (MedCM) in the event of exposure to VM, VX or VM-VX mixtures. Complementary in vitro and in vivo studies were undertaken to inform that advice. The penetration rate of neat VM was not significantly different from that of neat VX, through either guinea pig or pig skin in vitro . The presence of VX did not affect the penetration rate of VM in mixtures of various proportions. A lethal dose of VM was approximately twice that of VX in guinea pigs poisoned via the percutaneous route. There was no interaction in mixed agent solutions which altered the in vivo toxicity of the agents. Percutaneous poisoning by VM responded to treatment with standard MedCM, although complete protection was not achieved.

  18. Functional coupling networks inferred from prefrontal cortex activity show experience-related effective plasticity

    Directory of Open Access Journals (Sweden)

    Gaia Tavoni

    2017-10-01

    Full Text Available Functional coupling networks are widely used to characterize collective patterns of activity in neural populations. Here, we ask whether functional couplings reflect the subtle changes, such as in physiological interactions, believed to take place during learning. We infer functional network models reproducing the spiking activity of simultaneously recorded neurons in prefrontal cortex (PFC of rats, during the performance of a cross-modal rule shift task (task epoch, and during preceding and following sleep epochs. A large-scale study of the 96 recorded sessions allows us to detect, in about 20% of sessions, effective plasticity between the sleep epochs. These coupling modifications are correlated with the coupling values in the task epoch, and are supported by a small subset of the recorded neurons, which we identify by means of an automatized procedure. These potentiated groups increase their coativation frequency in the spiking data between the two sleep epochs, and, hence, participate to putative experience-related cell assemblies. Study of the reactivation dynamics of the potentiated groups suggests a possible connection with behavioral learning. Reactivation is largely driven by hippocampal ripple events when the rule is not yet learned, and may be much more autonomous, and presumably sustained by the potentiated PFC network, when learning is consolidated. Cell assemblies coding for memories are widely believed to emerge through synaptic modification resulting from learning, yet their identification from activity is very arduous. We propose a functional-connectivity-based approach to identify experience-related cell assemblies from multielectrode recordings in vivo, and apply it to the prefrontal cortex activity of rats recorded during a task epoch and the preceding and following sleep epochs. We infer functional couplings between the recorded cells in each epoch. Comparisons of the functional coupling networks across the epochs allow us

  19. VMCast: A VM-Assisted Stability Enhancing Solution for Tree-Based Overlay Multicast.

    Directory of Open Access Journals (Sweden)

    Weidong Gu

    Full Text Available Tree-based overlay multicast is an effective group communication method for media streaming applications. However, a group member's departure causes all of its descendants to be disconnected from the multicast tree for some time, which results in poor performance. The above problem is difficult to be addressed because overlay multicast tree is intrinsically instable. In this paper, we proposed a novel stability enhancing solution, VMCast, for tree-based overlay multicast. This solution uses two types of on-demand cloud virtual machines (VMs, i.e., multicast VMs (MVMs and compensation VMs (CVMs. MVMs are used to disseminate the multicast data, whereas CVMs are used to offer streaming compensation. The used VMs in the same cloud datacenter constitute a VM cluster. Each VM cluster is responsible for a service domain (VMSD, and each group member belongs to a specific VMSD. The data source delivers the multicast data to MVMs through a reliable path, and MVMs further disseminate the data to group members along domain overlay multicast trees. The above approach structurally improves the stability of the overlay multicast tree. We further utilized CVM-based streaming compensation to enhance the stability of the data distribution in the VMSDs. VMCast can be used as an extension to existing tree-based overlay multicast solutions, to provide better services for media streaming applications. We applied VMCast to two application instances (i.e., HMTP and HCcast. The results show that it can obviously enhance the stability of the data distribution.

  20. vmPFC activation during a stressor predicts positive emotions during stress recovery

    Science.gov (United States)

    Yang, Xi; Garcia, Katelyn M; Jung, Youngkyoo; Whitlow, Christopher T; McRae, Kateri; Waugh, Christian E

    2018-01-01

    Abstract Despite accruing evidence showing that positive emotions facilitate stress recovery, the neural basis for this effect remains unclear. To identify the underlying mechanism, we compared stress recovery for people reflecting on a stressor while in a positive emotional context with that for people in a neutral context. While blood–oxygen-level dependent data were being collected, participants (N = 43) performed a stressful anagram task, which was followed by a recovery period during which they reflected on the stressor while watching a positive or neutral video. Participants also reported positive and negative emotions throughout the task as well as retrospective thoughts about the task. Although there was no effect of experimental context on emotional recovery, we found that ventromedial prefrontal cortex (vmPFC) activation during the stressor predicted more positive emotions during recovery, which in turn predicted less negative emotions during recovery. In addition, the relationship between vmPFC activation and positive emotions during recovery was mediated by decentering—the meta-cognitive detachment of oneself from one’s feelings. In sum, successful recovery from a stressor seems to be due to activation of positive emotion-related regions during the stressor itself as well as to their downstream effects on certain cognitive forms of emotion regulation. PMID:29462404

  1. Experience on QA in the CernVM File System

    CERN Multimedia

    CERN. Geneva; MEUSEL, Rene

    2015-01-01

    The CernVM-File System (CVMFS) delivers experiment software installations to thousands of globally distributed nodes in the WLCG and beyond. In recent years it became a mission-critical component for offline data processing of the LHC experiments and many other collaborations. From a software engineering perspective, CVMFS is a medium-sized C++ system-level project. Following the growth of the project, we introduced a number of measures to improve the code quality, testability, and maintainability. In particular, we found very useful code reviews through github pull requests and automated unit- and integration testing. We are also transitioning to a test-driven development for new features and bug fixes. These processes are supported by a number of tools, such as Google Test, Jenkins, Docker, and others. We would like to share our experience on problems we encountered and on which processes and tools worked well for us.

  2. Investigating the role of the ventromedial prefrontal cortex (vmPFC in the assessment of brands

    Directory of Open Access Journals (Sweden)

    Jose Paulo eSantos

    2011-06-01

    Full Text Available The ventromedial prefrontal cortex (vmPFC is believed to be important in everyday preference judgments, processing emotions during decision-making. However, there is still controversy in the literature regarding the participation of the vmPFC. To further elucidate the contribution of the vmPFC in brand preference, we designed a functional magnetic resonance imaging (fMRI study where 18 subjects assessed positive, indifferent and fictitious brands. Also, both the period during and after the decision process were analyzed, hoping to unravel temporally the role of the vmPFC, using modeled and model-free fMRI analysis. Considering together the period before and after decision-making, there was activation of the vmPFC when comparing positive with indifferent or fictitious brands. However, when the decision-making period was separated from the moment after the response, and especially for positive brands, the vmPFC was more active after the choice than during the decision process itself, challenging some of the existing literature. The results of the present study support the notion that the vmPFC may be unimportant in the decision stage of brand preference, questioning theories that postulate that the vmPFC is in the origin of such a choice. Further studies are needed to investigate in detail why the vmPFC seems to be involved in brand preference only after the decision process.

  3. Protracted abstinence from distinct drugs of abuse shows regulation of a common gene network.

    Science.gov (United States)

    Le Merrer, Julie; Befort, Katia; Gardon, Olivier; Filliol, Dominique; Darcq, Emmanuel; Dembele, Doulaye; Becker, Jerome A J; Kieffer, Brigitte L

    2012-01-01

    Addiction is a chronic brain disorder. Prolonged abstinence from drugs of abuse involves dysphoria, high stress responsiveness and craving. The neurobiology of drug abstinence, however, is poorly understood. We previously identified a unique set of hundred mu-opioid receptor-dependent genes in the extended amygdala, a key site for hedonic and stress processing in the brain. Here we examined these candidate genes either immediately after chronic morphine, nicotine, Δ9-tetrahydrocannabinol or alcohol, or following 4 weeks of abstinence. Regulation patterns strongly differed among chronic groups. In contrast, gene regulations strikingly converged in the abstinent groups and revealed unforeseen common adaptations within a novel huntingtin-centered molecular network previously unreported in addiction research. This study demonstrates that, regardless the drug, a specific set of transcriptional regulations develops in the abstinent brain, which possibly contributes to the negative affect characterizing protracted abstinence. This transcriptional signature may represent a hallmark of drug abstinence and a unitary adaptive molecular mechanism in substance abuse disorders. © 2011 The Authors, Addiction Biology © 2011 Society for the Study of Addiction.

  4. Radiation-induced conduction under high electric field (1 x 106 to 1 x 108 V/m) in polyethylene-terephthalate

    International Nuclear Information System (INIS)

    Maeda, H.; Kurashige, M.; Ito, D.; Nakakita, T.

    1978-01-01

    Radiation-induced conduction in polyethylene-terephthalate (PET) has been measured under high electric field (1.0 x 10 6 to 1.6 x 10 8 V/m). In a 6-μm-thick PET film, saturation of the radiation-induced current occurs at field strengths above 1.2 x 10 8 V/m. This has been demonstrated by the thickness and dose rate dependence of the induced current. Radiation-induced conductivity increases monotonically with field strength, then shows a saturation tendency. This may be explained by geminate recombination. Above 1 x 10 8 V/m, slowly increasing radiation-induced current appears. This may be caused by electron injection from the cathode, enhanced by the accumulation of the hetero space charges near it

  5. Fast-Solving Quasi-Optimal LS-S3VM Based on an Extended Candidate Set.

    Science.gov (United States)

    Ma, Yuefeng; Liang, Xun; Kwok, James T; Li, Jianping; Zhou, Xiaoping; Zhang, Haiyan

    2018-04-01

    The semisupervised least squares support vector machine (LS-S 3 VM) is an important enhancement of least squares support vector machines in semisupervised learning. Given that most data collected from the real world are without labels, semisupervised approaches are more applicable than standard supervised approaches. Although a few training methods for LS-S 3 VM exist, the problem of deriving the optimal decision hyperplane efficiently and effectually has not been solved. In this paper, a fully weighted model of LS-S 3 VM is proposed, and a simple integer programming (IP) model is introduced through an equivalent transformation to solve the model. Based on the distances between the unlabeled data and the decision hyperplane, a new indicator is designed to represent the possibility that the label of an unlabeled datum should be reversed in each iteration during training. Using the indicator, we construct an extended candidate set consisting of the indices of unlabeled data with high possibilities, which integrates more information from unlabeled data. Our algorithm is degenerated into a special scenario of the previous algorithm when the extended candidate set is reduced into a set with only one element. Two strategies are utilized to determine the descent directions based on the extended candidate set. Furthermore, we developed a novel method for locating a good starting point based on the properties of the equivalent IP model. Combined with the extended candidate set and the carefully computed starting point, a fast algorithm to solve LS-S 3 VM quasi-optimally is proposed. The choice of quasi-optimal solutions results in low computational cost and avoidance of overfitting. Experiments show that our algorithm equipped with the two designed strategies is more effective than other algorithms in at least one of the following three aspects: 1) computational complexity; 2) generalization ability; and 3) flexibility. However, our algorithm and other algorithms have

  6. Systems level analysis of systemic sclerosis shows a network of immune and profibrotic pathways connected with genetic polymorphisms.

    Directory of Open Access Journals (Sweden)

    J Matthew Mahoney

    2015-01-01

    Full Text Available Systemic sclerosis (SSc is a rare systemic autoimmune disease characterized by skin and organ fibrosis. The pathogenesis of SSc and its progression are poorly understood. The SSc intrinsic gene expression subsets (inflammatory, fibroproliferative, normal-like, and limited are observed in multiple clinical cohorts of patients with SSc. Analysis of longitudinal skin biopsies suggests that a patient's subset assignment is stable over 6-12 months. Genetically, SSc is multi-factorial with many genetic risk loci for SSc generally and for specific clinical manifestations. Here we identify the genes consistently associated with the intrinsic subsets across three independent cohorts, show the relationship between these genes using a gene-gene interaction network, and place the genetic risk loci in the context of the intrinsic subsets. To identify gene expression modules common to three independent datasets from three different clinical centers, we developed a consensus clustering procedure based on mutual information of partitions, an information theory concept, and performed a meta-analysis of these genome-wide gene expression datasets. We created a gene-gene interaction network of the conserved molecular features across the intrinsic subsets and analyzed their connections with SSc-associated genetic polymorphisms. The network is composed of distinct, but interconnected, components related to interferon activation, M2 macrophages, adaptive immunity, extracellular matrix remodeling, and cell proliferation. The network shows extensive connections between the inflammatory- and fibroproliferative-specific genes. The network also shows connections between these subset-specific genes and 30 SSc-associated polymorphic genes including STAT4, BLK, IRF7, NOTCH4, PLAUR, CSK, IRAK1, and several human leukocyte antigen (HLA genes. Our analyses suggest that the gene expression changes underlying the SSc subsets may be long-lived, but mechanistically interconnected

  7. Anger Modulates Influence Hierarchies Within and Between Emotional Reactivity and Regulation Networks

    Science.gov (United States)

    Jacob, Yael; Gilam, Gadi; Lin, Tamar; Raz, Gal; Hendler, Talma

    2018-01-01

    Emotion regulation is hypothesized to be mediated by the interactions between emotional reactivity and regulation networks during the dynamic unfolding of the emotional episode. Yet, it remains unclear how to delineate the effective relationships between these networks. In this study, we examined the aforementioned networks’ information flow hierarchy during viewing of an anger provoking movie excerpt. Anger regulation is particularly essential for averting individuals from aggression and violence, thus improving prosocial behavior. Using subjective ratings of anger intensity we differentiated between low and high anger periods of the film. We then applied the Dependency Network Analysis (DEPNA), a newly developed graph theory method to quantify networks’ node importance during the two anger periods. The DEPNA analysis revealed that the impact of the ventromedial prefrontal cortex (vmPFC) was higher in the high anger condition, particularly within the regulation network and on the connections between the reactivity and regulation networks. We further showed that higher levels of vmPFC impact on the regulation network were associated with lower subjective anger intensity during the high-anger cinematic period, and lower trait anger levels. Supporting and replicating previous findings, these results emphasize the previously acknowledged central role of vmPFC in modulating negative affect. We further show that the impact of the vmPFC relies on its correlational influence on the connectivity between reactivity and regulation networks. More importantly, the hierarchy network analysis revealed a link between connectivity patterns of the vmPFC and individual differences in anger reactivity and trait, suggesting its potential therapeutic role. PMID:29681803

  8. A UV-Induced Genetic Network Links the RSC Complex to Nucleotide Excision Repair and Shows Dose-Dependent Rewiring

    Directory of Open Access Journals (Sweden)

    Rohith Srivas

    2013-12-01

    Full Text Available Efficient repair of UV-induced DNA damage requires the precise coordination of nucleotide excision repair (NER with numerous other biological processes. To map this crosstalk, we generated a differential genetic interaction map centered on quantitative growth measurements of >45,000 double mutants before and after different doses of UV radiation. Integration of genetic data with physical interaction networks identified a global map of 89 UV-induced functional interactions among 62 protein complexes, including a number of links between the RSC complex and several NER factors. We show that RSC is recruited to both silenced and transcribed loci following UV damage where it facilitates efficient repair by promoting nucleosome remodeling. Finally, a comparison of the response to high versus low levels of UV shows that the degree of genetic rewiring correlates with dose of UV and reveals a network of dose-specific interactions. This study makes available a large resource of UV-induced interactions, and it illustrates a methodology for identifying dose-dependent interactions based on quantitative shifts in genetic networks.

  9. Non-Toxic Metabolic Management of Metastatic Cancer in VM Mice: Novel Combination of Ketogenic Diet, Ketone Supplementation, and Hyperbaric Oxygen Therapy.

    Directory of Open Access Journals (Sweden)

    A M Poff

    Full Text Available The Warburg effect and tumor hypoxia underlie a unique cancer metabolic phenotype characterized by glucose dependency and aerobic fermentation. We previously showed that two non-toxic metabolic therapies - the ketogenic diet with concurrent hyperbaric oxygen (KD+HBOT and dietary ketone supplementation - could increase survival time in the VM-M3 mouse model of metastatic cancer. We hypothesized that combining these therapies could provide an even greater therapeutic benefit in this model. Mice receiving the combination therapy demonstrated a marked reduction in tumor growth rate and metastatic spread, and lived twice as long as control animals. To further understand the effects of these metabolic therapies, we characterized the effects of high glucose (control, low glucose (LG, ketone supplementation (βHB, hyperbaric oxygen (HBOT, or combination therapy (LG+βHB+HBOT on VM-M3 cells. Individually and combined, these metabolic therapies significantly decreased VM-M3 cell proliferation and viability. HBOT, alone or in combination with LG and βHB, increased ROS production in VM-M3 cells. This study strongly supports further investigation into this metabolic therapy as a potential non-toxic treatment for late-stage metastatic cancers.

  10. Risk factors associated with cognitions for late-onset depression based on anterior and posterior default mode sub-networks.

    Science.gov (United States)

    Liu, Rui; Yue, Yingying; Hou, Zhenghua; Yuan, Yonggui; Wang, Qiao

    2018-08-01

    Abnormal functional connectivity (FC) in the default mode network (DMN) plays an important role in late-onset depression (LOD) patients. In this study, the risk predictors of LOD based on anterior and posterior DMN are explored. A total of 27 LOD patients and 40 healthy controls (HC) underwent resting-state functional magnetic resonance imaging and cognitive assessments. Firstly, FCs within DMN sub-networks were determined by placing seeds in the ventral medial prefrontal cortex (vmPFC) and posterior cingulate cortex (PCC). Secondly, multivariable logistic regression was used to identify risk factors for LOD patients. Finally, correlation analysis was performed to investigate the relationship between risk factors and the cognitive value. Multivariable logistic regression showed that the FCs between the vmPFC and right middle temporal gyrus (MTG) (vmPFC-MTG_R), FCs between the vmPFC and left precuneus (PCu), and FCs between the PCC and left PCu (PCC-PCu_L) were the risk factors for LOD. Furthermore, FCs of the vmPFC-MTG_R and PCC-PCu_L correlated with processing speed (R = 0.35, P = 0.002; R = 0.32, P = 0.009), and FCs of the vmPFC-MTG_R correlated with semantic memory (R = 0.41, P = 0.001). The study was a cross-sectional study. The results may be potentially biased because of a small sample. In this study, we confirmed that LOD patients mainly present cognitive deficits in processing speed and semantic memory. Moreover, our findings further suggested that FCs within DMN sub-networks associated with cognitions were risk factors, which may be used for the prediction of LOD. Copyright © 2018 Elsevier B.V. All rights reserved.

  11. sRNAtoolboxVM: Small RNA Analysis in a Virtual Machine.

    Science.gov (United States)

    Gómez-Martín, Cristina; Lebrón, Ricardo; Rueda, Antonio; Oliver, José L; Hackenberg, Michael

    2017-01-01

    High-throughput sequencing (HTS) data for small RNAs (noncoding RNA molecules that are 20-250 nucleotides in length) can now be routinely generated by minimally equipped wet laboratories; however, the bottleneck in HTS-based research has shifted now to the analysis of such huge amount of data. One of the reasons is that many analysis types require a Linux environment but computers, system administrators, and bioinformaticians suppose additional costs that often cannot be afforded by small to mid-sized groups or laboratories. Web servers are an alternative that can be used if the data is not subjected to privacy issues (what very often is an important issue with medical data). However, in any case they are less flexible than stand-alone programs limiting the number of workflows and analysis types that can be carried out.We show in this protocol how virtual machines can be used to overcome those problems and limitations. sRNAtoolboxVM is a virtual machine that can be executed on all common operating systems through virtualization programs like VirtualBox or VMware, providing the user with a high number of preinstalled programs like sRNAbench for small RNA analysis without the need to maintain additional servers and/or operating systems.

  12. Multiple organ gigantism caused by mutation in VmPPD gene in blackgram (Vigna mungo).

    Science.gov (United States)

    Naito, Ken; Takahashi, Yu; Chaitieng, Bubpa; Hirano, Kumi; Kaga, Akito; Takagi, Kyoko; Ogiso-Tanaka, Eri; Thavarasook, Charaspon; Ishimoto, Masao; Tomooka, Norihiko

    2017-03-01

    Seed size is one of the most important traits in leguminous crops. We obtained a recessive mutant of blackgram that had greatly enlarged leaves, stems and seeds. The mutant produced 100% bigger leaves, 50% more biomass and 70% larger seeds though it produced 40% less number of seeds. We designated the mutant as multiple-organ-gigantism ( mog ) and found the mog phenotype was due to increase in cell numbers but not in cell size. We also found the mog mutant showed a rippled leaf ( rl ) phenotype, which was probably caused by a pleiotropic effect of the mutation. We performed a map-based cloning and successfully identified an 8 bp deletion in the coding sequence of VmPPD gene, an orthologue of Arabidopsis PEAPOD ( PPD ) that regulates arrest of cell divisions in meristematic cells . We found no other mutations in the neighboring genes between the mutant and the wild type. We also knocked down GmPPD genes and reproduced both the mog and rl phenotypes in soybean. Controlling PPD genes to produce the mog phenotype is highly valuable for breeding since larger seed size could directly increase the commercial values of grain legumes.

  13. Properties and Microstructure of Laser Welded VM12-SHC Steel Pipes Joints

    Directory of Open Access Journals (Sweden)

    Skrzypczyk A.

    2016-06-01

    Full Text Available Paper presents results of microstructure and tests of welded joints of new generation VM12-SHC martensitic steel using high power CO2 laser (LBW method with bifocal welding head. VM12-SHC is dedicated to energetic installation material, designed to replace currently used. High content of chromium and others alloying elements improve its resistance and strength characteristic. Use of VM12-SHC steel for production of the superheaters, heating chambers and walls in steam boilers resulted in various weldability researches. In article are presented results of destructive and non-destructive tests. For destructive: static bending and Vickers hardness tests, and for non-destructive: VT, RT, UT, micro and macroscopic tests were performed.

  14. Performance Tests of CMSSW on the CernVM

    CERN Document Server

    Petek, Marko

    2012-01-01

    goal of allowing the execution of the experiment's software on different operating systems in an easy way for the users. To achieve this it makes use of Virtual Machine images consisting of a JEOS (Just Enough Operational System) Linux image, bundled with CVMFS, a distributed file system for software. This image can this be run with a proper virtualizer on most of the platforms available. It also aggressively caches data on the local user's machine so that it can operate disconnected from the network. CMS wanted to compare the performance of the CMS Software running in the virtualized environment with the same software running on a native Linux box. To answer this need a series of tests were made on a controlled environment during 2010-2011. This work presents the results of those tests.

  15. Deep neural networks show an equivalent and often superior performance to dermatologists in onychomycosis diagnosis: Automatic construction of onychomycosis datasets by region-based convolutional deep neural network.

    Directory of Open Access Journals (Sweden)

    Seung Seog Han

    Full Text Available Although there have been reports of the successful diagnosis of skin disorders using deep learning, unrealistically large clinical image datasets are required for artificial intelligence (AI training. We created datasets of standardized nail images using a region-based convolutional neural network (R-CNN trained to distinguish the nail from the background. We used R-CNN to generate training datasets of 49,567 images, which we then used to fine-tune the ResNet-152 and VGG-19 models. The validation datasets comprised 100 and 194 images from Inje University (B1 and B2 datasets, respectively, 125 images from Hallym University (C dataset, and 939 images from Seoul National University (D dataset. The AI (ensemble model; ResNet-152 + VGG-19 + feedforward neural networks results showed test sensitivity/specificity/ area under the curve values of (96.0 / 94.7 / 0.98, (82.7 / 96.7 / 0.95, (92.3 / 79.3 / 0.93, (87.7 / 69.3 / 0.82 for the B1, B2, C, and D datasets. With a combination of the B1 and C datasets, the AI Youden index was significantly (p = 0.01 higher than that of 42 dermatologists doing the same assessment manually. For B1+C and B2+ D dataset combinations, almost none of the dermatologists performed as well as the AI. By training with a dataset comprising 49,567 images, we achieved a diagnostic accuracy for onychomycosis using deep learning that was superior to that of most of the dermatologists who participated in this study.

  16. Deep neural networks show an equivalent and often superior performance to dermatologists in onychomycosis diagnosis: Automatic construction of onychomycosis datasets by region-based convolutional deep neural network.

    Science.gov (United States)

    Han, Seung Seog; Park, Gyeong Hun; Lim, Woohyung; Kim, Myoung Shin; Na, Jung Im; Park, Ilwoo; Chang, Sung Eun

    2018-01-01

    Although there have been reports of the successful diagnosis of skin disorders using deep learning, unrealistically large clinical image datasets are required for artificial intelligence (AI) training. We created datasets of standardized nail images using a region-based convolutional neural network (R-CNN) trained to distinguish the nail from the background. We used R-CNN to generate training datasets of 49,567 images, which we then used to fine-tune the ResNet-152 and VGG-19 models. The validation datasets comprised 100 and 194 images from Inje University (B1 and B2 datasets, respectively), 125 images from Hallym University (C dataset), and 939 images from Seoul National University (D dataset). The AI (ensemble model; ResNet-152 + VGG-19 + feedforward neural networks) results showed test sensitivity/specificity/ area under the curve values of (96.0 / 94.7 / 0.98), (82.7 / 96.7 / 0.95), (92.3 / 79.3 / 0.93), (87.7 / 69.3 / 0.82) for the B1, B2, C, and D datasets. With a combination of the B1 and C datasets, the AI Youden index was significantly (p = 0.01) higher than that of 42 dermatologists doing the same assessment manually. For B1+C and B2+ D dataset combinations, almost none of the dermatologists performed as well as the AI. By training with a dataset comprising 49,567 images, we achieved a diagnostic accuracy for onychomycosis using deep learning that was superior to that of most of the dermatologists who participated in this study.

  17. HotpathVM: An Effective JIT for Resource-constrained Devices

    DEFF Research Database (Denmark)

    Gal, Andreas; Franz, Michael; Probst, Christian

    2006-01-01

    We present a just-in-time compiler for a Java VM that is small enough to fit on resource-constrained devices, yet surprisingly effective. Our system dynamically identifies traces of frequently executed bytecode instructions (which may span several basic blocks across several methods) and compiles...

  18. 3D-e-Chem-VM: Structural Cheminformatics Research Infrastructure in a Freely Available Virtual Machine.

    Science.gov (United States)

    McGuire, Ross; Verhoeven, Stefan; Vass, Márton; Vriend, Gerrit; de Esch, Iwan J P; Lusher, Scott J; Leurs, Rob; Ridder, Lars; Kooistra, Albert J; Ritschel, Tina; de Graaf, Chris

    2017-02-27

    3D-e-Chem-VM is an open source, freely available Virtual Machine ( http://3d-e-chem.github.io/3D-e-Chem-VM/ ) that integrates cheminformatics and bioinformatics tools for the analysis of protein-ligand interaction data. 3D-e-Chem-VM consists of software libraries, and database and workflow tools that can analyze and combine small molecule and protein structural information in a graphical programming environment. New chemical and biological data analytics tools and workflows have been developed for the efficient exploitation of structural and pharmacological protein-ligand interaction data from proteomewide databases (e.g., ChEMBLdb and PDB), as well as customized information systems focused on, e.g., G protein-coupled receptors (GPCRdb) and protein kinases (KLIFS). The integrated structural cheminformatics research infrastructure compiled in the 3D-e-Chem-VM enables the design of new approaches in virtual ligand screening (Chemdb4VS), ligand-based metabolism prediction (SyGMa), and structure-based protein binding site comparison and bioisosteric replacement for ligand design (KRIPOdb).

  19. Ventral medial prefrontal cortex (vmPFC) as a target of the dorsolateral prefrontal modulation by transcranial direct current stimulation (tDCS) in drug addiction.

    Science.gov (United States)

    Nakamura-Palacios, Ester Miyuki; Lopes, Isabela Bittencourt Coutinho; Souza, Rodolpho Albuquerque; Klauss, Jaisa; Batista, Edson Kruger; Conti, Catarine Lima; Moscon, Janine Andrade; de Souza, Rodrigo Stênio Moll

    2016-10-01

    Here, we report some electrophysiologic and imaging effects of the transcranial direct current stimulation (tDCS) over the dorsolateral prefrontal cortex (dlPFC) in drug addiction, notably in alcohol and crack-cocaine dependence. The low resolution electromagnetic tomography (LORETA) analysis obtained through event-related potentials (ERPs) under drug-related cues, more specifically in its P3 segment (300-500 ms) in both, alcoholics and crack-cocaine users, showed that the ventral medial prefrontal cortex (vmPFC) was the brain area with the largest change towards increasing activation under drug-related cues in those subjects that kept abstinence during and after the treatment with bilateral tDCS (2 mA, 35 cm(2), cathodal left and anodal right) over dlPFC, applied repetitively (five daily sessions). In an additional study in crack-cocaine, which showed craving decreases after repetitive bilateral tDCS, we examined data originating from diffusion tensor imaging (DTI), and we found increased DTI parameters in the left connection between vmPFC and nucleus accumbens (NAcc), such as the number of voxels, fractional anisotropy (FA) and apparent diffusion coefficient (ADC), in tDCS-treated crack-cocaine users when compared to the sham-tDCS group. This increasing of DTI parameters was significantly correlated with craving decreasing after the repetitive tDCS. The vmPFC relates to the control of drug seeking, possibly by extinguishing this behavior. In our studies, the bilateral dlPFC tDCS reduced relapses and craving to the drug use, and increased the vmPFC activation under drug cues, which may be of a great importance in the control of drug use in drug addiction.

  20. Cocaine craving during protracted withdrawal requires PKCε priming within vmPFC.

    Science.gov (United States)

    Miller, Bailey W; Wroten, Melissa G; Sacramento, Arianne D; Silva, Hannah E; Shin, Christina B; Vieira, Philip A; Ben-Shahar, Osnat; Kippin, Tod E; Szumlinski, Karen K

    2017-05-01

    In individuals with a history of drug taking, the capacity of drug-associated cues to elicit indices of drug craving intensifies or incubates with the passage of time during drug abstinence. This incubation of cocaine craving, as well as difficulties with learning to suppress drug-seeking behavior during protracted withdrawal, are associated with a time-dependent deregulation of ventromedial prefrontal cortex (vmPFC) function. As the molecular bases for cocaine-related vmPFC deregulation remain elusive, the present study assayed the consequences of extended access to intravenous cocaine (6 hours/day; 0.25 mg/infusion for 10 day) on the activational state of protein kinase C epsilon (PKCε), an enzyme highly implicated in drug-induced neuroplasticity. The opportunity to engage in cocaine seeking during cocaine abstinence time-dependently altered PKCε phosphorylation within vmPFC, with reduced and increased p-PKCε expression observed in early (3 days) and protracted (30 days) withdrawal, respectively. This effect was more robust within the ventromedial versus dorsomedial PFC, was not observed in comparable cocaine-experienced rats not tested for drug-seeking behavior and was distinct from the rise in phosphorylated extracellular signal-regulated kinase observed in cocaine-seeking rats. Further, the impact of inhibiting PKCε translocation within the vmPFC using TAT infusion proteins upon cue-elicited responding was determined and inhibition coinciding with the period of testing attenuated cocaine-seeking behavior, with an effect also apparent the next day. In contrast, inhibitor pretreatment prior to testing during early withdrawal was without effect. Thus, a history of excessive cocaine taking influences the cue reactivity of important intracellular signaling molecules within the vmPFC, with PKCε playing a critical role in the manifestation of cue-elicited cocaine seeking during protracted drug withdrawal. © 2016 Society for the Study of Addiction.

  1. Anatomical Network Analysis Shows Decoupling of Modular Lability and Complexity in the Evolution of the Primate Skull

    Science.gov (United States)

    Esteve-Altava, Borja; Boughner, Julia C.; Diogo, Rui; Villmoare, Brian A.; Rasskin-Gutman, Diego

    2015-01-01

    Modularity and complexity go hand in hand in the evolution of the skull of primates. Because analyses of these two parameters often use different approaches, we do not know yet how modularity evolves within, or as a consequence of, an also-evolving complex organization. Here we use a novel network theory-based approach (Anatomical Network Analysis) to assess how the organization of skull bones constrains the co-evolution of modularity and complexity among primates. We used the pattern of bone contacts modeled as networks to identify connectivity modules and quantify morphological complexity. We analyzed whether modularity and complexity evolved coordinately in the skull of primates. Specifically, we tested Herbert Simon’s general theory of near-decomposability, which states that modularity promotes the evolution of complexity. We found that the skulls of extant primates divide into one conserved cranial module and up to three labile facial modules, whose composition varies among primates. Despite changes in modularity, statistical analyses reject a positive feedback between modularity and complexity. Our results suggest a decoupling of complexity and modularity that translates to varying levels of constraint on the morphological evolvability of the primate skull. This study has methodological and conceptual implications for grasping the constraints that underlie the developmental and functional integration of the skull of humans and other primates. PMID:25992690

  2. A network model shows the importance of coupled processes in the microbial N cycle in the Cape Fear River Estuary

    Science.gov (United States)

    Hines, David E.; Lisa, Jessica A.; Song, Bongkeun; Tobias, Craig R.; Borrett, Stuart R.

    2012-06-01

    Estuaries serve important ecological and economic functions including habitat provision and the removal of nutrients. Eutrophication can overwhelm the nutrient removal capacity of estuaries and poses a widely recognized threat to the health and function of these ecosystems. Denitrification and anaerobic ammonium oxidation (anammox) are microbial processes responsible for the removal of fixed nitrogen and diminish the effects of eutrophication. Both of these microbial removal processes can be influenced by direct inputs of dissolved inorganic nitrogen substrates or supported by microbial interactions with other nitrogen transforming pathways such as nitrification and dissimilatory nitrate reduction to ammonium (DNRA). The coupling of nitrogen removal pathways to other transformation pathways facilitates the removal of some forms of inorganic nitrogen; however, differentiating between direct and coupled nitrogen removal is difficult. Network modeling provides a tool to examine interactions among microbial nitrogen cycling processes and to determine the within-system history of nitrogen involved in denitrification and anammox. To examine the coupling of nitrogen cycling processes, we built a nitrogen budget mass balance network model in two adjacent 1 cm3 sections of bottom water and sediment in the oligohaline portion of the Cape Fear River Estuary, NC, USA. Pathway, flow, and environ ecological network analyses were conducted to characterize the organization of nitrogen flow in the estuary and to estimate the coupling of nitrification to denitrification and of nitrification and DNRA to anammox. Centrality analysis indicated NH4+ is the most important form of nitrogen involved in removal processes. The model analysis further suggested that direct denitrification and coupled nitrification-denitrification had similar contributions to nitrogen removal while direct anammox was dominant to coupled forms of anammox. Finally, results also indicated that partial

  3. Studying VM-1 molybdenum alloy workability at high current density. II

    Energy Technology Data Exchange (ETDEWEB)

    Tatarinova, O M; Amirkhanova, N A; Zaripov, R A

    1976-01-01

    Under galvanostatic conditions, voltampere characteristics have been taken off for VM-1 alloy; determined are also the selective effect of electrolytes and the influence of hydrodynamical conditions on the rate of anodic dissolution in the electrolytes containing 15% NaNO/sub 3/; 15% NaNO/sub 3/ + 5% NaOH, and 15 % NaOH. In a composite electrolyte, the quality of the surface is improved, and higher current densities have been attained as compared with those for pure 15% NaNO/sub 3/. The process of dissolution in the above electrolytes is effected with diffuse limitations. For the electrochemical treatment of the VM-1 alloy under production conditions, a composite electrolyte containing 15% NaNO/sub 3/ and 5% NaOH has been suggested and tested.

  4. Investigation into electrochemical behavior of molybdenum VM-1 alloy at high current density

    Energy Technology Data Exchange (ETDEWEB)

    Tatarinova, O M; Amirkhanova, N A; Akhmadiev, A G

    1975-01-01

    The effect of the composition and concentration of electrolyte on the workability of the molybdenum VM-1 alloy has been studied and a number of anions has been determined relative to their activation capacity. The best workability of the alloy is achieved in a 15% NaOH solution and a composite electrolyte 15% NaNO/sub 3/+5%NaOH. It is shown that in polarization of the VM-1 alloy both in alkali- and salt solutions a film of oxides of different valence molybdenum is formed: Mo/sub 2/O/sub 3/, Mo/sub 4/O/sub 11/, Mo/sub 9/O/sub 26/, MoO/sub 3/, but molybdenum gets dissolved only in a hexavalent form, its content in a solution being in conformity with the polarizing current densities. Using a temperature-kinetic technique it has been found that the concentrational polarization is the limiting stage in the reaction of molybdenum and VM-1 alloy anodic dissolution in 15% NaNO/sub 3/ solution and in the composite electrolyte 15%NaNO/sub 3/+5%NaOH.

  5. cernatschool.org's use of CVMFS and the CernVM

    CERN Multimedia

    CERN. Geneva

    2018-01-01

    cernatschool.org is a very small Virtual Organisation made up of secondary school and university students, and participating organisations in the Institute for Research in Schools. We use CVMFS to delpoy dependencies and Python 3 itself for custom software used for analysing radiation data from Medipix detectors. This software is designed for running on GridPP worker nodes, part of the UK based distributed computing grid. The cernatschool.org VO also uses the CernVM, for job submission and interacting with the grid. The current use for both CVMFS and the CernVM is for facilitating analysis of 3 years worth of data from the LUCID payload on TechDemoSat-1. The CernVM looks like it could be particularly useful in the future for a standard system for students to use to program and analyse data themselves with, allowing easy access to any software they might need (not necessarily using GridPP compute resources at all).

  6. Multi-site cholera surveillance within the African Cholera Surveillance Network shows endemicity in Mozambique, 2011–2015

    Science.gov (United States)

    Langa, José Paulo; Dengo Baloi, Liliana; Wood, Richard; Ouedraogo, Issaka; Njanpop-Lafourcade, Berthe-Marie; Inguane, Dorteia; Elias Chitio, Jucunu; Mhlanga, Themba; Gujral, Lorna; D. Gessner, Bradford; Munier, Aline; A. Mengel, Martin

    2017-01-01

    Background Mozambique suffers recurrent annual cholera outbreaks especially during the rainy season between October to March. The African Cholera Surveillance Network (Africhol) was implemented in Mozambique in 2011 to generate accurate detailed surveillance data to support appropriate interventions for cholera control and prevention in the country. Methodology/Principal findings Africhol was implemented in enhanced surveillance zones located in the provinces of Sofala (Beira), Zambézia (District Mocuba), and Cabo Delgado (Pemba City). Data were also analyzed from the three outbreak areas that experienced the greatest number of cases during the time period under observation (in the districts of Cuamba, Montepuez, and Nampula). Rectal swabs were collected from suspected cases for identification of Vibrio cholerae, as well as clinical, behavioral, and socio-demographic variables. We analyzed factors associated with confirmed, hospitalized, and fatal cholera using multivariate logistic regression models. A total of 1,863 suspected cases and 23 deaths (case fatality ratio (CFR), 1.2%) were reported from October 2011 to December 2015. Among these suspected cases, 52.2% were tested of which 23.5% were positive for Vibrio cholerae O1 Ogawa. Risk factors independently associated with the occurrence of confirmed cholera were living in Nampula city district, the year 2014, human immunodeficiency virus infection, and the primary water source for drinking. Conclusions/Significance Cholera was endemic in Mozambique during the study period with a high CFR and identifiable risk factors. The study reinforces the importance of continued cholera surveillance, including a strong laboratory component. The results enhanced our understanding of the need to target priority areas and at-risk populations for interventions including oral cholera vaccine (OCV) use, and assess the impact of prevention and control strategies. Our data were instrumental in informing integrated prevention and

  7. Multi-site cholera surveillance within the African Cholera Surveillance Network shows endemicity in Mozambique, 2011-2015.

    Science.gov (United States)

    Semá Baltazar, Cynthia; Langa, José Paulo; Dengo Baloi, Liliana; Wood, Richard; Ouedraogo, Issaka; Njanpop-Lafourcade, Berthe-Marie; Inguane, Dorteia; Elias Chitio, Jucunu; Mhlanga, Themba; Gujral, Lorna; D Gessner, Bradford; Munier, Aline; A Mengel, Martin

    2017-10-01

    Mozambique suffers recurrent annual cholera outbreaks especially during the rainy season between October to March. The African Cholera Surveillance Network (Africhol) was implemented in Mozambique in 2011 to generate accurate detailed surveillance data to support appropriate interventions for cholera control and prevention in the country. Africhol was implemented in enhanced surveillance zones located in the provinces of Sofala (Beira), Zambézia (District Mocuba), and Cabo Delgado (Pemba City). Data were also analyzed from the three outbreak areas that experienced the greatest number of cases during the time period under observation (in the districts of Cuamba, Montepuez, and Nampula). Rectal swabs were collected from suspected cases for identification of Vibrio cholerae, as well as clinical, behavioral, and socio-demographic variables. We analyzed factors associated with confirmed, hospitalized, and fatal cholera using multivariate logistic regression models. A total of 1,863 suspected cases and 23 deaths (case fatality ratio (CFR), 1.2%) were reported from October 2011 to December 2015. Among these suspected cases, 52.2% were tested of which 23.5% were positive for Vibrio cholerae O1 Ogawa. Risk factors independently associated with the occurrence of confirmed cholera were living in Nampula city district, the year 2014, human immunodeficiency virus infection, and the primary water source for drinking. Cholera was endemic in Mozambique during the study period with a high CFR and identifiable risk factors. The study reinforces the importance of continued cholera surveillance, including a strong laboratory component. The results enhanced our understanding of the need to target priority areas and at-risk populations for interventions including oral cholera vaccine (OCV) use, and assess the impact of prevention and control strategies. Our data were instrumental in informing integrated prevention and control efforts during major cholera outbreaks in recent years.

  8. Engineering the CernVM-Filesystem as a High Bandwidth Distributed Filesystem for Auxiliary Physics Data

    Science.gov (United States)

    Dykstra, D.; Bockelman, B.; Blomer, J.; Herner, K.; Levshina, T.; Slyz, M.

    2015-12-01

    A common use pattern in the computing models of particle physics experiments is running many distributed applications that read from a shared set of data files. We refer to this data is auxiliary data, to distinguish it from (a) event data from the detector (which tends to be different for every job), and (b) conditions data about the detector (which tends to be the same for each job in a batch of jobs). Relatively speaking, conditions data also tends to be relatively small per job where both event data and auxiliary data are larger per job. Unlike event data, auxiliary data comes from a limited working set of shared files. Since there is spatial locality of the auxiliary data access, the use case appears to be identical to that of the CernVM- Filesystem (CVMFS). However, we show that distributing auxiliary data through CVMFS causes the existing CVMFS infrastructure to perform poorly. We utilize a CVMFS client feature called "alien cache" to cache data on existing local high-bandwidth data servers that were engineered for storing event data. This cache is shared between the worker nodes at a site and replaces caching CVMFS files on both the worker node local disks and on the site's local squids. We have tested this alien cache with the dCache NFSv4.1 interface, Lustre, and the Hadoop Distributed File System (HDFS) FUSE interface, and measured performance. In addition, we use high-bandwidth data servers at central sites to perform the CVMFS Stratum 1 function instead of the low-bandwidth web servers deployed for the CVMFS software distribution function. We have tested this using the dCache HTTP interface. As a result, we have a design for an end-to-end high-bandwidth distributed caching read-only filesystem, using existing client software already widely deployed to grid worker nodes and existing file servers already widely installed at grid sites. Files are published in a central place and are soon available on demand throughout the grid and cached locally on the

  9. Engineering the CernVM-Filesystem as a High Bandwidth Distributed Filesystem for Auxiliary Physics Data

    Energy Technology Data Exchange (ETDEWEB)

    Dykstra, D. [Fermilab; Bockelman, B. [Nebraska U.; Blomer, J. [CERN; Herner, K. [Fermilab; Levshina, T. [Fermilab; Slyz, M. [Fermilab

    2015-12-23

    A common use pattern in the computing models of particle physics experiments is running many distributed applications that read from a shared set of data files. We refer to this data is auxiliary data, to distinguish it from (a) event data from the detector (which tends to be different for every job), and (b) conditions data about the detector (which tends to be the same for each job in a batch of jobs). Relatively speaking, conditions data also tends to be relatively small per job where both event data and auxiliary data are larger per job. Unlike event data, auxiliary data comes from a limited working set of shared files. Since there is spatial locality of the auxiliary data access, the use case appears to be identical to that of the CernVM- Filesystem (CVMFS). However, we show that distributing auxiliary data through CVMFS causes the existing CVMFS infrastructure to perform poorly. We utilize a CVMFS client feature called 'alien cache' to cache data on existing local high-bandwidth data servers that were engineered for storing event data. This cache is shared between the worker nodes at a site and replaces caching CVMFS files on both the worker node local disks and on the site's local squids. We have tested this alien cache with the dCache NFSv4.1 interface, Lustre, and the Hadoop Distributed File System (HDFS) FUSE interface, and measured performance. In addition, we use high-bandwidth data servers at central sites to perform the CVMFS Stratum 1 function instead of the low-bandwidth web servers deployed for the CVMFS software distribution function. We have tested this using the dCache HTTP interface. As a result, we have a design for an end-to-end high-bandwidth distributed caching read-only filesystem, using existing client software already widely deployed to grid worker nodes and existing file servers already widely installed at grid sites. Files are published in a central place and are soon available on demand throughout the grid and cached

  10. Physical metallurgy: Scientific school of the Academician V.M. Schastlivtsev

    Science.gov (United States)

    Tabatchikova, T. I.

    2016-04-01

    This paper is to honor Academician Vadim Mikhailovich Schastlivtsev, a prominent scientist in the field of metal physics and materials science. The article comprises an analysis of the topical issues of the physical metallurgy of the early 21st century and of the contribution of V.M. Schastlivtsev and of his school to the science of phase and structural transformations in steels. In 2015, Vadim Mikhailovich celebrates his 80th birthday, and this paper is timed to this honorable date. The list of his main publications is given in it.

  11. Dynamic virtual AliEn Grid sites on Nimbus with CernVM

    International Nuclear Information System (INIS)

    Harutyunyan, A; Buncic, P; Freeman, T; Keahey, K

    2010-01-01

    We describe the work on enabling one click deployment of Grid sites of AliEn Grid framework on the Nimbus 'science cloud' at the University of Chicago. The integration of computing resources of the cloud with the resource pool of AliEn Grid is achieved by leveraging two mechanisms: the Nimbus Context Broker developed at Argonne National Laboratory and the University of Chicago, and CernVM - a baseline virtual software appliance for LHC experiments developed at CERN. Two approaches of dynamic virtual AliEn Grid site deployment are presented.

  12. Development of a Temperature Controller for a Vuilleumier (VM) Cycle Power Cylinder

    Science.gov (United States)

    1975-10-01

    the system in the event of a shorted sensor; both of these actions turn the power section of the controller "off," and it cannot be repowered until...400-Hz power to a low-level DC with the attendant necessity of using a 400-Hz power transformer . Thus use of DC will allow a less compli- cated...N AFFDL.TR-75-99 7? ^0 00 o o o CQ DEVELOPMENT OF A TEMPERATURE CONTROLLER FOR A VUILLEUMIER (VM) CYCLE POWER CYLINDER i ■ L RTHUR D

  13. Security in the CernVM File System and the Frontier Distributed Database Caching System

    International Nuclear Information System (INIS)

    Dykstra, D; Blomer, J

    2014-01-01

    Both the CernVM File System (CVMFS) and the Frontier Distributed Database Caching System (Frontier) distribute centrally updated data worldwide for LHC experiments using http proxy caches. Neither system provides privacy or access control on reading the data, but both control access to updates of the data and can guarantee the authenticity and integrity of the data transferred to clients over the internet. CVMFS has since its early days required digital signatures and secure hashes on all distributed data, and recently Frontier has added X.509-based authenticity and integrity checking. In this paper we detail and compare the security models of CVMFS and Frontier.

  14. Security in the CernVM File System and the Frontier Distributed Database Caching System

    Science.gov (United States)

    Dykstra, D.; Blomer, J.

    2014-06-01

    Both the CernVM File System (CVMFS) and the Frontier Distributed Database Caching System (Frontier) distribute centrally updated data worldwide for LHC experiments using http proxy caches. Neither system provides privacy or access control on reading the data, but both control access to updates of the data and can guarantee the authenticity and integrity of the data transferred to clients over the internet. CVMFS has since its early days required digital signatures and secure hashes on all distributed data, and recently Frontier has added X.509-based authenticity and integrity checking. In this paper we detail and compare the security models of CVMFS and Frontier.

  15. Using XRootD to provide caches for CernVM-FS

    CERN Document Server

    Domenighini, Matteo

    2017-01-01

    CernVM-FS recently added the possibility of using plugin for cache management. In order to investigate the capabilities and limits of such possibility, an XRootD plugin was written and benchmarked; as a byproduct, a POSIX plugin was also generated. The tests revealed that the plugin interface introduces no signicant performance over- head; moreover, the XRootD plugin performance was discovered to be worse than the ones of the built-in cache manager and the POSIX plugin. Further test of the XRootD component revealed that its per- formance is dependent on the server disk speed.

  16. Managing the Virtual Machine Lifecycle of the CernVM Project

    International Nuclear Information System (INIS)

    Charalampidis, I; Blomer, J; Buncic, P; Harutyunyan, A; Larsen, D

    2012-01-01

    CernVM is a virtual software appliance designed to support the development cycle and provide a runtime environment for LHC applications. It consists of a minimal Linux distribution, a specially tuned file system designed to deliver application software on demand, and contextualization tools. The maintenance of these components involves a variety of different procedures and tools that cannot always connect with each other. Additionally, most of these procedures need to be performed frequently. Currently, in the CernVM project, every time we build a new virtual machine image, we have to perform the whole process manually, because of the heterogeneity of the tools involved. The overall process is error-prone and time-consuming. Therefore, to simplify and aid this continuous maintenance process, we are developing a framework that combines these virtually unrelated tools with a single, coherent interface. To do so, we identified all the involved procedures and their tools, tracked their dependencies and organized them into logical groups (e.g. build, test, instantiate). These groups define the procedures that are performed throughout the lifetime of a virtual machine. In this paper we describe the Virtual Machine Lifecycle and the framework we developed (iAgent) in order to simplify the maintenance process.

  17. CernVM Co-Pilot: an Extensible Framework for Building Scalable Cloud Computing Infrastructures

    CERN Multimedia

    CERN. Geneva

    2012-01-01

    CernVM Co-Pilot is a framework for instantiating an ad-hoc computing infrastructure on top of distributed computing resources. Such resources include commercial computing clouds (e.g. Amazon EC2), scientific computing clouds (e.g. CERN lxcloud), as well as the machines of users participating in volunteer computing projects (e.g. BOINC). The framework consists of components that communicate using the Extensible Messaging and Presence protocol (XMPP), allowing for new components to be developed in virtually any programming language and interfaced to existing Grid and batch computing infrastructures exploited by the High Energy Physics community. Co-Pilot has been used to execute jobs for both the ALICE and ATLAS experiments at CERN. CernVM Co-Pilot is also one of the enabling technologies behind the LHC@home 2.0 volunteer computing project, which is the first such project that exploits virtual machine technology. The use of virtual machines eliminates the necessity of modifying existing applications and adapt...

  18. Universal Voltage Conveyor and its Novel Dual-Output Fully-Cascadable VM APF Application

    Directory of Open Access Journals (Sweden)

    Norbert Herencsar

    2017-03-01

    Full Text Available This letter presents a novel realization of a voltage-mode (VM first-order all-pass filter (APF with attractive features. The proposed circuit employs a single readily available six-terminal active device called as universal voltage conveyor (UVC and only grounded passive components, which predict its easy monolithic integration with desired circuit simplicity. The auxiliary voltage input (W and output (ZP, ZN terminals of the device fully ensure easy cascadability of VM APF, since the input and output terminal impedances are theoretically infinitely high and zero, respectively. Moreover, thanks to mutually inverse outputs of the UVC, the proposed filter simultaneously provides both inverting and non-inverting outputs from the same configuration. All of these features make the UVC a unique active device currently available in the literature. The behavior of the filter was experimentally measured using the readily available UVC-N1C 0520 chip, which was produced in cooperation with ON Semiconductor Czech Republic, Ltd.

  19. PROOF as a service on the cloud: a virtual analysis facility based on the CernVM ecosystem

    International Nuclear Information System (INIS)

    Berzano, D; Blomer, J; Buncic, P; Charalampidis, I; Ganis, G; Lestaris, G; Meusel, R

    2014-01-01

    PROOF, the Parallel ROOT Facility, is a ROOT-based framework which enables interactive parallelism for event-based tasks on a cluster of computing nodes. Although PROOF can be used simply from within a ROOT session with no additional requirements, deploying and configuring a PROOF cluster used to be not as straightforward. Recently great efforts have been spent to make the provisioning of generic PROOF analysis facilities with zero configuration, with the added advantages of positively affecting both stability and scalability, making the deployment operations feasible even for the end user. Since a growing amount of large-scale computing resources are nowadays made available by Cloud providers in a virtualized form, we have developed the Virtual PROOF-based Analysis Facility: a cluster appliance combining the solid CernVM ecosystem and PoD (PROOF on Demand), ready to be deployed on the Cloud and leveraging some peculiar Cloud features such as elasticity. We will show how this approach is effective both for sysadmins, who will have little or no configuration to do to run it on their Clouds, and for the end users, who are ultimately in full control of their PROOF cluster and can even easily restart it by themselves in the unfortunate event of a major failure. We will also show how elasticity leads to a more optimal and uniform usage of Cloud resources.

  20. Neuroanatomy of the vmPFC and dlPFC predicts individual differences in cognitive regulation during dietary self-control across regulation strategies.

    Science.gov (United States)

    Schmidt, Liane; Tusche, Anita; Manoharan, Nicolas; Hutcherson, Cendri; Hare, Todd; Plassmann, Hilke

    2018-06-04

    Making healthy food choices is challenging for many people. Individuals differ greatly in their ability to follow health goals in the face of temptation, but it is unclear what underlies such differences. Using voxel-based morphometry (VBM), we investigated in healthy humans (i.e., men and women) links between structural variation in gray matter volume and individuals' level of success in shifting toward healthier food choices. We combined MRI and choice data into a joint dataset by pooling across three independent studies that employed a task prompting participants to explicitly focus on the healthiness of food items before making their food choices. Within this dataset, we found that individual differences in gray matter volume in the ventromedial prefrontal cortex (vmPFC) and dorsolateral prefrontal cortex (dlPFC) predicted regulatory success. We extended and confirmed these initial findings by predicting regulatory success out of sample and across tasks in a second dataset requiring participants to apply a different regulation strategy that entailed distancing from cravings for unhealthy, appetitive foods. Our findings suggest that neuroanatomical markers in the vmPFC and dlPFC generalized to different forms of dietary regulation strategies across participant groups. They provide novel evidence that structural differences in neuroanatomy of two key regions for valuation and its control, the vmPFC and dlPFC, predict an individual's ability to exert control in dietary choices. SIGNIFICANCE STATEMENT Dieting involves regulating food choices in order to eat healthier foods and fewer unhealthy foods. People differ dramatically in their ability to achieve or maintain this regulation, but it is unclear why. Here, we show that individuals with more gray matter volume in the dorsolateral and ventromedial prefrontal cortex are better at exercising dietary self-control. This relationship was observed across four different studies examining two different forms of dietary

  1. Gene network analysis shows immune-signaling and ERK1/2 as novel genetic markers for multiple addiction phenotypes: alcohol, smoking and opioid addiction.

    Science.gov (United States)

    Reyes-Gibby, Cielito C; Yuan, Christine; Wang, Jian; Yeung, Sai-Ching J; Shete, Sanjay

    2015-06-05

    Addictions to alcohol and tobacco, known risk factors for cancer, are complex heritable disorders. Addictive behaviors have a bidirectional relationship with pain. We hypothesize that the associations between alcohol, smoking, and opioid addiction observed in cancer patients have a genetic basis. Therefore, using bioinformatics tools, we explored the underlying genetic basis and identified new candidate genes and common biological pathways for smoking, alcohol, and opioid addiction. Literature search showed 56 genes associated with alcohol, smoking and opioid addiction. Using Core Analysis function in Ingenuity Pathway Analysis software, we found that ERK1/2 was strongly interconnected across all three addiction networks. Genes involved in immune signaling pathways were shown across all three networks. Connect function from IPA My Pathway toolbox showed that DRD2 is the gene common to both the list of genetic variations associated with all three addiction phenotypes and the components of the brain neuronal signaling network involved in substance addiction. The top canonical pathways associated with the 56 genes were: 1) calcium signaling, 2) GPCR signaling, 3) cAMP-mediated signaling, 4) GABA receptor signaling, and 5) G-alpha i signaling. Cancer patients are often prescribed opioids for cancer pain thus increasing their risk for opioid abuse and addiction. Our findings provide candidate genes and biological pathways underlying addiction phenotypes, which may be future targets for treatment of addiction. Further study of the variations of the candidate genes could allow physicians to make more informed decisions when treating cancer pain with opioid analgesics.

  2. On Use of the Variable Zagreb vM2 Index in QSPR: Boiling Points of Benzenoid Hydrocarbons

    Directory of Open Access Journals (Sweden)

    Albin Jurić

    2004-12-01

    Full Text Available The variable Zagreb vM2 index is introduced and applied to the structure-boiling point modeling of benzenoid hydrocarbons. The linear model obtained (thestandard error of estimate for the fit model Sfit=6.8 oC is much better than thecorresponding model based on the original Zagreb M2 index (Sfit=16.4 oC. Surprisingly,the model based on the variable vertex-connectivity index (Sfit=6.8 oC is comparable tothe model based on vM2 index. A comparative study with models based on the vertex-connectivity index, edge-connectivity index and several distance indices favours modelsbased on the variable Zagreb vM2 index and variable vertex-connectivity index.However, the multivariate regression with two-, three- and four-descriptors givesimproved models, the best being the model with four-descriptors (but vM2 index is notamong them with Sfit=5 oC, though the four-descriptor model contaning vM2 index isonly slightly inferior (Sfit=5.3 oC.

  3. PROOF as a Service on the Cloud: a Virtual Analysis Facility based on the CernVM ecosystem

    CERN Document Server

    Berzano, Dario; Buncic, Predrag; Charalampidis, Ioannis; Ganis, Gerardo; Lestaris, Georgios; Meusel, René

    2014-01-01

    PROOF, the Parallel ROOT Facility, is a ROOT-based framework which enables interactive parallelism for event-based tasks on a cluster of computing nodes. Although PROOF can be used simply from within a ROOT session with no additional requirements, deploying and configuring a PROOF cluster used to be not as straightforward. Recently great efforts have been spent to make the provisioning of generic PROOF analysis facilities with zero configuration, with the added advantages of positively affecting both stability and scalability, making the deployment operations feasible even for the end user. Since a growing amount of large-scale computing resources are nowadays made available by Cloud providers in a virtualized form, we have developed the Virtual PROOF-based Analysis Facility: a cluster appliance combining the solid CernVM ecosystem and PoD (PROOF on Demand), ready to be deployed on the Cloud and leveraging some peculiar Cloud features such as elasticity. We will show how this approach is effective both for sy...

  4. A New Resources Provisioning Method Based on QoS Differentiation and VM Resizing in IaaS

    Directory of Open Access Journals (Sweden)

    Rongdong Hu

    2015-01-01

    Full Text Available In order to improve the host energy efficiency in IaaS, we proposed an adaptive host resource provisioning method, CoST, which is based on QoS differentiation and VM resizing. The control model can adaptively adjust control parameters according to real time application performance, in order to cope with changes in load. CoST takes advantage of the fact that different types of applications have different sensitivity degrees to performance and cost. It places two different types of VMs on the same host and dynamically adjusts their sizes based on the load forecasting and QoS feedback. It not only guarantees the performance defined in SLA, but also keeps the host running in energy-efficient state. Real Google cluster trace and host power data are used to evaluate the proposed method. Experimental results show that CoST can provide performance-sensitive application with a steady QoS and simultaneously speed up the overall processing of performance-tolerant application by 20~66%. The host energy efficiency is significantly improved by 7~23%.

  5. Motor units in vastus lateralis and in different vastus medialis regions show different firing properties during low-level, isometric knee extension contraction.

    Science.gov (United States)

    de Souza, Leonardo Mendes Leal; Cabral, Hélio Veiga; de Oliveira, Liliam Fernandes; Vieira, Taian Martins

    2018-04-01

    Architectural differences along vastus medialis (VM) and between VM and vastus lateralis (VL) are considered functionally important for the patellar tracking, knee joint stability and knee joint extension. Whether these functional differences are associated with a differential activity of motor units between VM and VL is however unknown. In the present study, we, therefore, investigate neuroanatomical differences in the activity of motor units detected proximo-distally from VM and from the VL muscle. Nine healthy volunteers performed low-level isometric knee extension contractions (20% of their maximum voluntary contraction) following a trapezoidal trajectory. Surface electromyograms (EMGs) were recorded from VM proximal and distal regions and from VL using three linear adhesive arrays of eight electrodes. The firing rate and recruitment threshold of motor units decomposed from EMGs were then compared among muscle regions. Results show that VL motor units reached lower mean firing rates in comparison with VM motor units, regardless of their position within VM (P motor units (P = .997). Furthermore, no significant differences in the recruitment threshold were observed for all motor units analysed (P = .108). Our findings possibly suggest the greater potential of VL to generate force, due to its fibres arrangement, may account for the lower discharge rate observed for VL then either proximally or distally detected motor units in VM. Additionally, the present study opens new perspectives on the importance of considering muscle architecture in investigations of the neural aspects of motor behaviour. Copyright © 2017 Elsevier B.V. All rights reserved.

  6. Integration of genome-scale metabolic networks into whole-body PBPK models shows phenotype-specific cases of drug-induced metabolic perturbation.

    Science.gov (United States)

    Cordes, Henrik; Thiel, Christoph; Baier, Vanessa; Blank, Lars M; Kuepfer, Lars

    2018-01-01

    Drug-induced perturbations of the endogenous metabolic network are a potential root cause of cellular toxicity. A mechanistic understanding of such unwanted side effects during drug therapy is therefore vital for patient safety. The comprehensive assessment of such drug-induced injuries requires the simultaneous consideration of both drug exposure at the whole-body and resulting biochemical responses at the cellular level. We here present a computational multi-scale workflow that combines whole-body physiologically based pharmacokinetic (PBPK) models and organ-specific genome-scale metabolic network (GSMN) models through shared reactions of the xenobiotic metabolism. The applicability of the proposed workflow is illustrated for isoniazid, a first-line antibacterial agent against Mycobacterium tuberculosis , which is known to cause idiosyncratic drug-induced liver injuries (DILI). We combined GSMN models of a human liver with N-acetyl transferase 2 (NAT2)-phenotype-specific PBPK models of isoniazid. The combined PBPK-GSMN models quantitatively describe isoniazid pharmacokinetics, as well as intracellular responses, and changes in the exometabolome in a human liver following isoniazid administration. Notably, intracellular and extracellular responses identified with the PBPK-GSMN models are in line with experimental and clinical findings. Moreover, the drug-induced metabolic perturbations are distributed and attenuated in the metabolic network in a phenotype-dependent manner. Our simulation results show that a simultaneous consideration of both drug pharmacokinetics at the whole-body and metabolism at the cellular level is mandatory to explain drug-induced injuries at the patient level. The proposed workflow extends our mechanistic understanding of the biochemistry underlying adverse events and may be used to prevent drug-induced injuries in the future.

  7. NMDA antagonist, but not nNOS inhibitor, requires AMPA receptors in the ventromedial prefrontal cortex (vmPFC) to induce antidepressant-like effects

    DEFF Research Database (Denmark)

    Pereira, V. S.; Wegener, Gregers; Joca, S. R.

    2013-01-01

    of the glutamatergic and nitrergic systems of the vmPFC on the behavioral consequences induced by forced swimming (FS), an animal model of depression. Male Wistar rats (230-260g) with guide cannulas aimed at the prelimbic (PL) region of vmPFC were submitted to a 15min session of FS and, 24h later, they were submitted...

  8. Advanced neuroblastoma: improved response rate using a multiagent regimen (OPEC) including sequential cisplatin and VM-26.

    Science.gov (United States)

    Shafford, E A; Rogers, D W; Pritchard, J

    1984-07-01

    Forty-two children, all over one year of age, were given vincristine, cyclophosphamide, and sequentially timed cisplatin and VM-26 (OPEC) or OPEC and doxorubicin (OPEC-D) as initial treatment for newly diagnosed stage III or IV neuroblastoma. Good partial response was achieved in 31 patients (74%) overall and in 28 (78%) of 36 patients whose treatment adhered to the chemotherapy protocol, compared with a 65% response rate achieved in a previous series of children treated with pulsed cyclophosphamide and vincristine with or without doxorubicin. Only six patients, including two of the six children whose treatment did not adhere to protocol, failed to respond, but there were five early deaths from treatment-related complications. Tumor response to OPEC, which was the less toxic of the two regimens, was at least as good as tumor response to OPEC-D. Cisplatin-induced morbidity was clinically significant in only one patient and was avoided in others by careful monitoring of glomerular filtration rate and hearing. Other centers should test the efficacy of OPEC or equivalent regimens in the treatment of advanced neuroblastoma.

  9. Barbröstade grabbar, med färgat hår och litervis med öl : En analys av Aftonbladets skildring av herr- och damfotboll i Herr-VM 2006 och Dam-VM 2007

    OpenAIRE

    Mårtensson, Henning

    2012-01-01

    I den här uppsatsen har jag undersökt hur män och kvinnor framställs i bild och text i Aftonbladets rapportering från herrarnas fotbolls-VM i Tyskland 2006 och damernas fotbolls-VM i Kina 2007. Mitt syfte var att titta på hur konstrueringen av en nationell diskurs skiljer sig åt i texterna om dam- och herrfotboll, om det finns någon tydlig manlig och kvinnlig diskurs på bilderna, samt hur väl min undersökning stämmer in på beprövade genusteorier. För att kunna besvara mitt syfte använde jag m...

  10. Utilizing ICN/CCN for service and VM migration support in virtualized LTE systems

    NARCIS (Netherlands)

    Karimzadeh Motallebi Azar, Morteza; Satria, Triadimas; Karagiannis, Georgios

    2014-01-01

    One of the most important concepts used in mobile networks, like LTE (Long Term Evolution) is service continuity. A mobile user moving from one network to another network should not lose an on-going service. In cloud-based (virtualized) LTE systems, services are hosted on Virtual Machines (VMs) that

  11. vlPFC-vmPFC-Amygdala Interactions Underlie Age-Related Differences in Cognitive Regulation of Emotion.

    Science.gov (United States)

    Silvers, Jennifer A; Insel, Catherine; Powers, Alisa; Franz, Peter; Helion, Chelsea; Martin, Rebecca E; Weber, Jochen; Mischel, Walter; Casey, B J; Ochsner, Kevin N

    2017-07-01

    Emotion regulation is a critical life skill that develops throughout childhood and adolescence. Despite this development in emotional processes, little is known about how the underlying brain systems develop with age. This study examined emotion regulation in 112 individuals (aged 6-23 years) as they viewed aversive and neutral images using a reappraisal task. On "reappraisal" trials, participants were instructed to view the images as distant, a strategy that has been previously shown to reduce negative affect. On "reactivity" trials, participants were instructed to view the images without regulating emotions to assess baseline emotional responding. During reappraisal, age predicted less negative affect, reduced amygdala responses and inverse coupling between the ventromedial prefrontal cortex (vmPFC) and amygdala. Moreover, left ventrolateral prefrontal (vlPFC) recruitment mediated the relationship between increasing age and diminishing amygdala responses. This negative vlPFC-amygdala association was stronger for individuals with inverse coupling between the amygdala and vmPFC. These data provide evidence that vmPFC-amygdala connectivity facilitates vlPFC-related amygdala modulation across development. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

  12. Network-state modulation of power-law frequency-scaling in visual cortical neurons.

    Science.gov (United States)

    El Boustani, Sami; Marre, Olivier; Béhuret, Sébastien; Baudot, Pierre; Yger, Pierre; Bal, Thierry; Destexhe, Alain; Frégnac, Yves

    2009-09-01

    Various types of neural-based signals, such as EEG, local field potentials and intracellular synaptic potentials, integrate multiple sources of activity distributed across large assemblies. They have in common a power-law frequency-scaling structure at high frequencies, but it is still unclear whether this scaling property is dominated by intrinsic neuronal properties or by network activity. The latter case is particularly interesting because if frequency-scaling reflects the network state it could be used to characterize the functional impact of the connectivity. In intracellularly recorded neurons of cat primary visual cortex in vivo, the power spectral density of V(m) activity displays a power-law structure at high frequencies with a fractional scaling exponent. We show that this exponent is not constant, but depends on the visual statistics used to drive the network. To investigate the determinants of this frequency-scaling, we considered a generic recurrent model of cortex receiving a retinotopically organized external input. Similarly to the in vivo case, our in computo simulations show that the scaling exponent reflects the correlation level imposed in the input. This systematic dependence was also replicated at the single cell level, by controlling independently, in a parametric way, the strength and the temporal decay of the pairwise correlation between presynaptic inputs. This last model was implemented in vitro by imposing the correlation control in artificial presynaptic spike trains through dynamic-clamp techniques. These in vitro manipulations induced a modulation of the scaling exponent, similar to that observed in vivo and predicted in computo. We conclude that the frequency-scaling exponent of the V(m) reflects stimulus-driven correlations in the cortical network activity. Therefore, we propose that the scaling exponent could be used to read-out the "effective" connectivity responsible for the dynamical signature of the population signals measured

  13. Network-state modulation of power-law frequency-scaling in visual cortical neurons.

    Directory of Open Access Journals (Sweden)

    Sami El Boustani

    2009-09-01

    Full Text Available Various types of neural-based signals, such as EEG, local field potentials and intracellular synaptic potentials, integrate multiple sources of activity distributed across large assemblies. They have in common a power-law frequency-scaling structure at high frequencies, but it is still unclear whether this scaling property is dominated by intrinsic neuronal properties or by network activity. The latter case is particularly interesting because if frequency-scaling reflects the network state it could be used to characterize the functional impact of the connectivity. In intracellularly recorded neurons of cat primary visual cortex in vivo, the power spectral density of V(m activity displays a power-law structure at high frequencies with a fractional scaling exponent. We show that this exponent is not constant, but depends on the visual statistics used to drive the network. To investigate the determinants of this frequency-scaling, we considered a generic recurrent model of cortex receiving a retinotopically organized external input. Similarly to the in vivo case, our in computo simulations show that the scaling exponent reflects the correlation level imposed in the input. This systematic dependence was also replicated at the single cell level, by controlling independently, in a parametric way, the strength and the temporal decay of the pairwise correlation between presynaptic inputs. This last model was implemented in vitro by imposing the correlation control in artificial presynaptic spike trains through dynamic-clamp techniques. These in vitro manipulations induced a modulation of the scaling exponent, similar to that observed in vivo and predicted in computo. We conclude that the frequency-scaling exponent of the V(m reflects stimulus-driven correlations in the cortical network activity. Therefore, we propose that the scaling exponent could be used to read-out the "effective" connectivity responsible for the dynamical signature of the population

  14. A π-π 3D network of tetranuclear μ2/μ3-carbonato Dy(III) bis-pyrazolylpyridine clusters showing single molecule magnetism features.

    Science.gov (United States)

    Gass, Ian A; Moubaraki, Boujemaa; Langley, Stuart K; Batten, Stuart R; Murray, Keith S

    2012-02-18

    2,6-Di(pyrazole-3-yl)pyridine, 3-bpp, forms a porous (4(9)·6(6)) π-π mediated 3D network of trigonal pyramidal [Dy(III)(4)] carbonato-bridged complexes, with hexagonal channels comprising 54% of the unit cell volume, the material displaying slow magnetisation reversal. This journal is © The Royal Society of Chemistry 2012

  15. Autosomal dominant inheritance of brain cardiolipin fatty acid abnormality in VM/DK mice: association with hypoxic-induced cognitive insensitivity.

    Science.gov (United States)

    Ta, Nathan L; Jia, Xibei; Kiebish, Michael; Seyfried, Thomas N

    2014-01-01

    Cardiolipin is a complex polyglycerol phospholipid found almost exclusively in the inner mitochondrial membrane and regulates numerous enzyme activities especially those related to oxidative phosphorylation and coupled respiration. Abnormalities in cardiolipin can impair mitochondrial function and bioenergetics. We recently demonstrated that the ratio of shorter chain saturated and monounsaturated fatty acids (C16:0; C18:0; C18:1) to longer chain polyunsaturated fatty acids (C18:2; C20:4; C22:6) was significantly greater in the brains of adult VM/DK (VM) inbred mice than in the brains of C57BL/6 J (B6) mice. The cardiolipin fatty acid abnormalities in VM mice are also associated with alterations in the activity of mitochondrial respiratory complexes. In this study we found that the abnormal brain fatty acid ratio in the VM strain was inherited as an autosomal dominant trait in reciprocal B6 × VM F1 hybrids. To evaluate the potential influence of brain cardiolipin fatty acid composition on cognitive sensitivity, we placed the parental B6 and VM mice and their reciprocal male and female B6VMF1 hybrid mice (3-month-old) in a hypoxic chamber (5 % O2). Cognitive awareness (conscientiousness) under hypoxia was significantly lower in the VM parental mice and F1 hybrid mice (11.4 ± 0.4  and 11.0 ± 0.4 min, respectively) than in the parental B6 mice (15.3 ± 1.4 min), indicating an autosomal dominant inheritance like that of the brain cardiolipin abnormalities. These findings suggest that impaired cognitive awareness under hypoxia is associated with abnormalities in neural lipid composition.

  16. CernVM Co-Pilot: an Extensible Framework for Building Scalable Computing Infrastructures on the Cloud

    Science.gov (United States)

    Harutyunyan, A.; Blomer, J.; Buncic, P.; Charalampidis, I.; Grey, F.; Karneyeu, A.; Larsen, D.; Lombraña González, D.; Lisec, J.; Segal, B.; Skands, P.

    2012-12-01

    CernVM Co-Pilot is a framework for instantiating an ad-hoc computing infrastructure on top of managed or unmanaged computing resources. Co-Pilot can either be used to create a stand-alone computing infrastructure, or to integrate new computing resources into existing infrastructures (such as Grid or batch). Unlike traditional middleware systems, Co-Pilot components communicate using the Extensible Messaging and Presence protocol (XMPP). This allows the system to be easily scaled in case of a high load, and it also simplifies the development of new components. In this contribution we present the latest developments and the current status of the framework, discuss how it can be extended to suit the needs of a particular community, as well as describe the operational experience of using the framework in the LHC@home 2.0 volunteer computing project.

  17. CernVM Co-Pilot: a Framework for Orchestrating Virtual Machines Running Applications of LHC Experiments on the Cloud

    International Nuclear Information System (INIS)

    Harutyunyan, A; Sánchez, C Aguado; Blomer, J; Buncic, P

    2011-01-01

    CernVM Co-Pilot is a framework for the delivery and execution of the workload on remote computing resources. It consists of components which are developed to ease the integration of geographically distributed resources (such as commercial or academic computing clouds, or the machines of users participating in volunteer computing projects) into existing computing grid infrastructures. The Co-Pilot framework can also be used to build an ad-hoc computing infrastructure on top of distributed resources. In this paper we present the architecture of the Co-Pilot framework, describe how it is used to execute the jobs of the ALICE and ATLAS experiments, as well as to run the Monte-Carlo simulation application of CERN Theoretical Physics Group.

  18. Acceptance of the 2014 V.M. Goldschmidt Award of the Gochemical Society by Timothy L. Grove

    Science.gov (United States)

    Grove, Timothy L.

    2015-06-01

    I am deeply honored to be the recipient of the 2014 V.M. Goldschmidt Award. Many of the past recipients of this award have been scientific heroes to me, and it is hard to express how it feels to be included in this distinguished group. My feelings run the full spectrum; from exhilaration and deep personal satisfaction for the recognition of the work that I have done, to humility and anxiety that maybe I am really not good enough to deserve this award. This is called impostor syndrome. You younger scientists should know that many of us, even those who appear very successful, still experience it - don't let it hold you back.

  19. CernVM Co-Pilot: an Extensible Framework for Building Scalable Computing Infrastructures on the Cloud

    International Nuclear Information System (INIS)

    Harutyunyan, A; Blomer, J; Buncic, P; Charalampidis, I; Grey, F; Karneyeu, A; Larsen, D; Lombraña González, D; Lisec, J; Segal, B; Skands, P

    2012-01-01

    CernVM Co-Pilot is a framework for instantiating an ad-hoc computing infrastructure on top of managed or unmanaged computing resources. Co-Pilot can either be used to create a stand-alone computing infrastructure, or to integrate new computing resources into existing infrastructures (such as Grid or batch). Unlike traditional middleware systems, Co-Pilot components communicate using the Extensible Messaging and Presence protocol (XMPP). This allows the system to be easily scaled in case of a high load, and it also simplifies the development of new components. In this contribution we present the latest developments and the current status of the framework, discuss how it can be extended to suit the needs of a particular community, as well as describe the operational experience of using the framework in the LHC at home 2.0 volunteer computing project.

  20. Inhibition of xyloglucanase from an alkalothermophilic Thermomonospora sp. by a peptidic aspartic protease inhibitor from Penicillium sp. VM24.

    Science.gov (United States)

    Menon, Vishnu; Rao, Mala

    2012-11-01

    A bifunctional inhibitor from Penicillium sp VM24 causing inactivation of xyloglucanase from Thermomonospora sp and an aspartic protease from Aspergillus saitoi was identified. Steady state kinetics studies of xyloglucanase and the inhibitor revealed an irreversible, non-competitive, two-step inhibition mechanism with IC(50) and K(i) values of 780 and 500nM respectively. The interaction of o-phthalaldehyde (OPTA)-labeled xyloglucanase with the inhibitor revealed that the inhibitor binds to the active site of the enzyme. Far- and near-UV spectrophotometric analysis suggests that the conformational changes induced in xyloglucanase by the inhibitor may be due to irreversible denaturation of enzyme. The bifunctional inhibitor may have potential as a biocontrol agent for the protection of plants against phytopathogenic fungi. Copyright © 2012 Elsevier Ltd. All rights reserved.

  1. Postglacial Rebound and Current Ice Loss Estimates from Space Geodesy: The New ICE-6G (VM5a) Global Model

    Science.gov (United States)

    Peltier, W. R.; Argus, D.; Drummond, R.; Moore, A. W.

    2012-12-01

    We compare, on a global basis, estimates of site velocity against predictions of the newly constructed postglacial rebound model ICE-6G (VM5a). This model is fit to observations of North American postglacial rebound thereby demonstrating that the ice sheet at last glacial maximum must have been, relative to ICE-5G,thinner in southern Manitoba, thinner near Yellowknife (northwest Territories), thicker in eastern and southern Quebec, and thicker along the British Columbia-Alberta border. The GPS based estimates of site velocity that we employ are more accurate than were previously available because they are based on GPS estimates of position as a function of time determined by incorporating satellite phase center variations [Desai et al. 2011]. These GPS estimates are constraining postglacial rebound in North America and Europe more tightly than ever before. In particular, given the high density of GPS sites in North America, and the fact that the velocity of the mass center (CM) of Earth is also more tightly constrained, the new model much more strongly constrains both the lateral extent of the proglacial forebulge and the rate at which this peripheral bulge (that was emplaced peripheral to the late Pleistocence Laurentia ice sheet) is presently collapsing. This fact proves to be important to the more accurate inference of the current rate of ice loss from both Greenland and Alaska based upon the time dependent gravity observations being provided by the GRACE satellite system. In West Antarctica we have also been able to significantly revise the previously prevalent ICE-5G deglaciation history so as to enable its predictions to be optimally consistent with GPS site velocities determined by connecting campaign WAGN measurements to those provided by observations from the permanent ANET sites. Ellsworth Land (south of the Antarctic peninsula), is observed to be rising at 6 ±3 mm/yr according to our latest analyses; the Ellsworth mountains themselves are observed to be

  2. Cocaine users with comorbid Cluster B personality disorders show dysfunctional brain activation and connectivity in the emotional regulation networks during negative emotion maintenance and reappraisal.

    Science.gov (United States)

    Albein-Urios, Natalia; Verdejo-Román, Juan; Soriano-Mas, Carles; Asensio, Samuel; Martínez-González, José Miguel; Verdejo-García, Antonio

    2013-12-01

    Cocaine dependence often co-occurs with Cluster B personality disorders. Since both disorders are characterized by emotion regulation deficits, we predicted that cocaine comorbid patients would exhibit dysfunctional patterns of brain activation and connectivity during reappraisal of negative emotions. We recruited 18 cocaine users with comorbid Cluster B personality disorders, 17 cocaine users without comorbidities and 21 controls to be scanned using functional magnetic resonance imaging (fMRI) during performance on a reappraisal task in which they had to maintain or suppress the emotions induced by negative affective stimuli. We followed region of interest (ROI) and whole-brain approaches to investigate brain activations and connectivity associated with negative emotion experience and reappraisal. Results showed that cocaine users with comorbid personality disorders had reduced activation of the subgenual anterior cingulate cortex during negative emotion maintenance and increased activation of the lateral orbitofrontal cortex and the amygdala during reappraisal. Amygdala activation correlated with impulsivity and antisocial beliefs in the comorbid group. Connectivity analyses showed that in the cocaine comorbid group the subgenual cingulate was less efficiently connected with the amygdala and the fusiform gyri and more efficiently connected with the anterior insula during maintenance, whereas during reappraisal the left orbitofrontal cortex was more efficiently connected with the amygdala and the right orbitofrontal cortex was less efficiently connected with the dorsal striatum. We conclude that cocaine users with comorbid Cluster B personality disorders have distinctive patterns of brain activation and connectivity during maintenance and reappraisal of negative emotions, which correlate with impulsivity and dysfunctional beliefs. Copyright © 2013 Elsevier B.V. and ECNP. All rights reserved.

  3. The ICE-6G_C (VM5a) Global Model of the GIA Process: Antarctica at High Spatial Resolution

    Science.gov (United States)

    Peltier, W. R.; Drummond, R.; Argus, D. F.

    2016-12-01

    The ICE-6G_C (VM5a) global model of the glacial isostatic adjustment process (Argus et al., 2014 GJI 198, 537-563; Peltier et al. , 2015, JGR 119, doi:10.1002/2014JB011176) is the latest model in the ICE-nG (VMx) sequence. The model continues to be unique in that it is the only model whose properties are made freely available at each iterative step in its development. This latest version, which embodies detailed descriptions of the Laurentide , Fennoscandian/Barents Sea, Greenland and Antarctic ice sheets through the most recent glacial cycle, is a refinement based primarily upon the incorporation of the constraints being provided by GPS measurements of the vertical and horizontal motion of the crust as well as GRACE observations of the time dependent gravity field. The model has been shown to provide exceptionally accurate predictions of these space geodetic observations of the response to the most recent Late Quaternary glacial cycle. Particular attention has been paid to the Antarctic component as it is well known on the basis of analyses of the sedimentary stratigraphy off-shore and geomorphological characteristics of the continental shelf, that the Last Glacial Maximum state of the southern continent was one in which grounded ice extended out to the shelf break in most locations, including significant fractions of the Ross Sea and Weddell Sea embayments. In the latter regions especially, it is expected that grounded ice would have existed below sea level. In ICE-6G_C (VM5a) a grounding line tracking algorithm was employed (Stuhne and Peltier, 2015 JGR 120, 1841-1865) in order to describe the unloading of the solid surface by ice that was initially grounded below sea level, an apparently unique characteristic of this model. In the initially published version, in which the Sea Level Equation (SLE) was inverted on a basis of spherical harmonics truncated at degree and order 256, this led to "ringing" in the embayments when the Stokes coefficients of the model

  4. Glacial Isostatic Adjustment Derived Boundary Conditions for Paleoclimate Simulation: the Refined ICE-6G_D (VM5a) Model and the Dansgaard-Oeschger Oscillation

    Science.gov (United States)

    Peltier, W. R.; Vettoretti, G.; Argus, D. F.

    2017-12-01

    Global models of the glacial isostatic adjustment (GIA) process are designed to fit a wide range of geophysical and geomorphological observations that simultaneously constrain the internal viscoelastic structure of Earths interior and the history of grounded ice thickness variations that has occurred over the most recent ice-age cycle of the Late Quaternary interval of time. The most recent refinement of the ICE-NG (VMX) series of such global models from the University of Toronto, ICE-6G_C (VM5a), has recently been slightly modified insofar as its Antarctic component is concerned to produce a "_D" version of the structure. This has been chosen to provide the boundary conditions for the next round of model-data inter-comparisons in the context of the international Paleoclimate Modeling Inter-comparison Project (PMIP). The output of PMIP will contribute to the Sixth Assessment Report (AR6) of the Intergovernmental Panel on Climate Change which is now under way. A highly significant test of the utility of this latest model has recently been performed that is focused upon the Dansgaard-Oeschger oscillation that was the primary source of climate variability during Marine Isotope Stage 3 (MIS3) of the most recent glacial cycle. By introducing the surface boundary conditions for paleotopography and paleobathymetry, land-sea mask and surface albedo into the NCAR CESM1 coupled climate model configured at full one degree by one degree CMIP5 resolution, together with the appropriate trace gas and orbital insolation forcing, we show that the millennium timescale Dansgard-Oeschger oscillation naturally develops following spin- up of the model into the glacial state.

  5. Activity in dlPFC and its effective connectivity to vmPFC are associated with temporal discounting

    Directory of Open Access Journals (Sweden)

    Todd A Hare

    2014-03-01

    Full Text Available There is widespread interest in identifying computational and neurobiological mechanisms that influence the ability to choose long-term benefits over more proximal and readily available rewards in domains such as dietary and economic choice. We present the results of a human fMRI study that examines how neural activity relates to observed individual differences in the discounting of future rewards during an intertemporal monetary choice task. We found that a region of left dlPFC BA-46 was more active in trials where subjects chose delayed rewards, after controlling for the subjective value of those rewards. We also found that the connectivity from dlPFC BA-46 to a region of vmPFC widely associated with the computational of stimulus values, increased at the time of choice, and especially during trials in which subjects chose delayed rewards. Finally, we found that estimates of effective connectivity between these two regions played a critical role in predicting out-of-sample, between-subject differences in discount rates. Together with previous findings in dietary choice, these results suggest that a common set of computational and neurobiological mechanisms facilitate choices in favor of long- term reward in both settings.

  6. Networking

    OpenAIRE

    Rauno Lindholm, Daniel; Boisen Devantier, Lykke; Nyborg, Karoline Lykke; Høgsbro, Andreas; Fries, de; Skovlund, Louise

    2016-01-01

    The purpose of this project was to examine what influencing factor that has had an impact on the presumed increasement of the use of networking among academics on the labour market and how it is expressed. On the basis of the influence from globalization on the labour market it can be concluded that the globalization has transformed the labour market into a market based on the organization of networks. In this new organization there is a greater emphasis on employees having social qualificati...

  7. Aging-related changes in the default mode network and its anti-correlated networks: a resting-state fMRI study.

    Science.gov (United States)

    Wu, Jing-Tao; Wu, Hui-Zhen; Yan, Chao-Gan; Chen, Wen-Xin; Zhang, Hong-Ying; He, Yong; Yang, Hai-Shan

    2011-10-17

    Intrinsic brain activity in a resting state incorporates components of the task negative network called default mode network (DMN) and task-positive networks called attentional networks. In the present study, the reciprocal neuronal networks in the elder group were compared with the young group to investigate the differences of the intrinsic brain activity using a method of temporal correlation analysis based on seed regions of posterior cingulate cortex (PCC) and ventromedial prefrontal cortex (vmPFC). We found significant decreased positive correlations and negative correlations with the seeds of PCC and vmPFC in the old group. The decreased coactivations in the DMN network components and their negative networks in the old group may reflect age-related alterations in various brain functions such as attention, motor control and inhibition modulation in cognitive processing. These alterations in the resting state anti-correlative networks could provide neuronal substrates for the aging brain. Copyright © 2011 Elsevier Ireland Ltd. All rights reserved.

  8. Antitumor activity of the two epipodophyllotoxin derivatives VP-16 and VM-26 in preclinical systems: a comparison of in vitro and in vivo drug evaluation

    DEFF Research Database (Denmark)

    Jensen, P B; Roed, H; Skovsgaard, T

    1990-01-01

    doses on an optimal schedule in vivo and it has not been clarified as to whether a therapeutic difference exists between them. A prolonged schedule is optimal for both drugs; accordingly we determined the toxicity in mice using a 5-day schedule. The dose killing 10% of the mice (LD10) was 9.4 mg...... the increase in life span and the number of cures. The drugs were also compared in nude mice inoculated with human small-cell lung cancer lines OC-TOL and CPH-SCCL-123; however, they were more toxic to the nude mice and only a limited therapeutic effect was observed. In conclusion, the complete cross......-resistance between the two drugs suggests that they have an identical antineoplastic spectrum. VM-26 was more potent than VP-16 in vitro; however, this was not correlated to a therapeutic advantage for VM-26 over VP-16 in vivo....

  9. Inhibition of Information Flow to the Default Mode Network During Self-Reference Versus Reference to Others.

    Science.gov (United States)

    Soch, Joram; Deserno, Lorenz; Assmann, Anne; Barman, Adriana; Walter, Henrik; Richardson-Klavehn, Alan; Schott, Björn H

    2017-08-01

    The default mode network (DMN), a network centered around the cortical midline, shows deactivation during most cognitive tasks and pronounced resting-state connectivity, but is actively engaged in self-reference and social cognition. It is, however, yet unclear how information reaches the DMN during social cognitive processing. Here, we addressed this question using dynamic causal modeling (DCM) of functional magnetic resonance imaging (fMRI) data acquired during self-reference (SR) and reference to others (OR). Both conditions engaged the left inferior frontal gyrus (LIFG), most likely reflecting semantic processing. Within the DMN, self-reference preferentially elicited rostral anterior cingulate and ventromedial prefrontal cortex (rACC/vmPFC) activity, whereas OR engaged posterior cingulate and precuneus (PCC/PreCun). DCM revealed that the regulation of information flow to the DMN was primarily inhibitory. Most prominently, SR elicited inhibited information flow from the LIFG to the PCC/PreCun, while OR was associated with suppression of the connectivity from the LIFG to the rACC/vmPFC. These results suggest that task-related DMN activation is enabled by inhibitory down-regulation of task-irrelevant information flow when switching from rest to stimulus-specific processing. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

  10. ARC-VM: An architecture real options complexity-based valuation methodology for military systems-of-systems acquisitions

    Science.gov (United States)

    Domercant, Jean Charles

    The combination of today's national security environment and mandated acquisition policies makes it necessary for military systems to interoperate with each other to greater degrees. This growing interdependency results in complex Systems-of-Systems (SoS) that only continue to grow in complexity to meet evolving capability needs. Thus, timely and affordable acquisition becomes more difficult, especially in the face of mounting budgetary pressures. To counter this, architecting principles must be applied to SoS design. The research objective is to develop an Architecture Real Options Complexity-Based Valuation Methodology (ARC-VM) suitable for acquisition-level decision making, where there is a stated desire for more informed tradeoffs between cost, schedule, and performance during the early phases of design. First, a framework is introduced to measure architecture complexity as it directly relates to military SoS. Development of the framework draws upon a diverse set of disciplines, including Complexity Science, software architecting, measurement theory, and utility theory. Next, a Real Options based valuation strategy is developed using techniques established for financial stock options that have recently been adapted for use in business and engineering decisions. The derived complexity measure provides architects with an objective measure of complexity that focuses on relevant complex system attributes. These attributes are related to the organization and distribution of SoS functionality and the sharing and processing of resources. The use of Real Options provides the necessary conceptual and visual framework to quantifiably and traceably combine measured architecture complexity, time-valued performance levels, as well as programmatic risks and uncertainties. An example suppression of enemy air defenses (SEAD) capability demonstrates the development and usefulness of the resulting architecture complexity & Real Options based valuation methodology. Different

  11. Performance evaluation of the General Electric eXplore CT 120 micro-CT using the vmCT phantom

    Energy Technology Data Exchange (ETDEWEB)

    Bahri, M.A., E-mail: M.Bahri@ulg.ac.be [ULg-Liege University, Cyclotron Research Centre, Liege, Bat. 30, Allee du 6 aout, 8 (Belgium); Warnock, G.; Plenevaux, A. [ULg-Liege University, Cyclotron Research Centre, Liege, Bat. 30, Allee du 6 aout, 8 (Belgium); Choquet, P.; Constantinesco, A. [Biophysique et Medecine Nucleaire, Hopitaux universitaires de Strasbourg, Strasbourg (France); Salmon, E.; Luxen, A. [ULg-Liege University, Cyclotron Research Centre, Liege, Bat. 30, Allee du 6 aout, 8 (Belgium); Seret, A. [ULg-Liege University, Cyclotron Research Centre, Liege, Bat. 30, Allee du 6 aout, 8 (Belgium); ULg-Liege University, Experimental Medical Imaging, Liege (Belgium)

    2011-08-21

    The eXplore CT 120 is the latest generation micro-CT from General Electric. It is equipped with a high-power tube and a flat-panel detector. It allows high resolution and high contrast fast CT scanning of small animals. The aim of this study was to compare the performance of the eXplore CT 120 with that of the eXplore Ultra, its predecessor for which the methodology using the vmCT phantom has already been described . The phantom was imaged using typical a rat (fast scan or F) or mouse (in vivo bone scan or H) scanning protocols. With the slanted edge method, a 10% modulation transfer function (MTF) was observed at 4.4 (F) and 3.9-4.4 (H) mm{sup -1} corresponding to 114 {mu}m resolution. A fairly larger MTF was obtained by the coil method with the MTF for the thinnest coil (3.3 mm{sup -1}) equal to 0.32 (F) and 0.34 (H). The geometric accuracy was better than 0.3%. There was a highly linear (R{sup 2}>0.999) relationship between measured and expected CT numbers for both the CT number accuracy and linearity sections of the phantom. A cupping effect was clearly seen on the uniform slices and the uniformity-to-noise ratio ranged from 0.52 (F) to 0.89 (H). The air CT number depended on the amount of polycarbonate surrounding the area where it was measured; a difference as high as approximately 200 HU was observed. This hindered the calibration of this scanner in HU. This is likely due to the absence of corrections for beam hardening and scatter in the reconstruction software. However in view of the high linearity of the system, the implementation of these corrections would allow a good quality calibration of the scanner in HU. In conclusion, the eXplore CT 120 achieved a better spatial resolution than the eXplore Ultra (based on previously reported specifications) and future software developments will include beam hardening and scatter corrections that will make the new generation CT scanner even more promising.

  12. Show-Bix &

    DEFF Research Database (Denmark)

    2014-01-01

    The anti-reenactment 'Show-Bix &' consists of 5 dias projectors, a dial phone, quintophonic sound, and interactive elements. A responsive interface will enable the Dias projectors to show copies of original dias slides from the Show-Bix piece ”March på Stedet”, 265 images in total. The copies are...

  13. Spatial Disassociation of Disrupted Functional Connectivity for the Default Mode Network in Patients with End-Stage Renal Disease.

    Directory of Open Access Journals (Sweden)

    Xiaofen Ma

    Full Text Available To investigate the aberrant functional connectivity of the default mode network (DMN in patients with end-stage renal disease (ESRD and their clinical relevance.Resting-state functional MRI data were collected from 31 patients with ESRD (24 men, 24-61 years and 31 age- and gender-matched healthy controls (HCs, 21 men, 26-61years. A whole-brain seed-based functional connectivity analysis of these collected R-fMRI data was performed by locating the seeds in the posterior cingulate cortex (PCC and ventromedial prefrontal cortex (vmPFC to investigate the functional connectivity of the posterior and anterior DMN over the whole brain, respectively.Compared to the HCs, the patients exhibited significantly decreased functional connectivity with the PCC in the left middle temporal gyrus, the right anterior cingulate gyrus, and the bilateral medial superior frontal gyrus. For the vmPFC seed, only the right thalamus showed significantly decreased functional connectivity in the patients with ESRD compared to HCs. Interestingly, functional connectivity between the PCC and right medial superior frontal gyrus exhibited a significantly positive correlation with the hemoglobin level in the patients.Our findings suggest a spatially specific disruption of functional connectivity in the DMN in patients with ESRD, thereby providing novel insights into our understanding of the neurophysiology mechanism that underlies the disease.

  14. Network cohesion

    OpenAIRE

    Cavalcanti, Tiago Vanderlei; Giannitsarou, Chrysi; Johnson, CR

    2017-01-01

    We define a measure of network cohesion and show how it arises naturally in a broad class of dynamic models of endogenous perpetual growth with network externalities. Via a standard growth model, we show why network cohesion is crucial for conditional convergence and explain that as cohesion increases, convergence is faster. We prove properties of network cohesion and define a network aggregator that preserves network cohesion.

  15. Comment on "An Assessment of the ICE-6G_C (VM5a) Glacial Isostatic Adjustment Model" by Purcell et al.

    Science.gov (United States)

    Richard Peltier, W.; Argus, Donald F.; Drummond, Rosemarie

    2018-02-01

    The most recently published model of the glacial isostatic adjustment process in the ICE-NG (VMX) sequence from the University of Toronto, denoted ICE-6G_C (VM5a), was originally developed to degree and order 256 in spherical harmonics and has been shown to provide accurate fits to a voluminous database of GPS observations from North America, Eurasia, and Antarctica, to time dependent gravity data being provided by the GRACE satellites, and to radiocarbon-dated relative sea level histories through the Holocene epoch. The authors of the Purcell et al. (2016, https://doi.org/10.1002/2015JB012742) paper have suggested this model to be flawed. We have produced a further version of our model, denoted ICE-6G_D (VM5a), by employing the same BEDMAP2 bathymetry for the Southern Ocean as employed in their analysis which has somewhat reduced the differences between our results. However, significant physically important differences remain, including the magnitude of present-day vertical crustal motion in the embayments and in the spectrum of Stokes coefficients for present-day geoid height time dependence which continues to "flatten" at high spherical harmonic degree. We explore the reasons for these differences and trace them to the use by Purcell et al. of a loading history for the embayments that differs significantly from that tabulated for both the original and modified versions of our model.

  16. Talking with TV shows

    DEFF Research Database (Denmark)

    Sandvik, Kjetil; Laursen, Ditte

    2014-01-01

    User interaction with radio and television programmes is not a new thing. However, with new cross-media production concepts such as X Factor and Voice, this is changing dramatically. The second-screen logic of these productions encourages viewers, along with TV’s traditional one-way communication...... mode, to communicate on interactive (dialogue-enabling) devices such as laptops, smartphones and tablets. Using the TV show Voice as our example, this article shows how the technological and situational set-up of the production invites viewers to engage in new ways of interaction and communication...

  17. Talk Show Science.

    Science.gov (United States)

    Moore, Mitzi Ruth

    1992-01-01

    Proposes having students perform skits in which they play the roles of the science concepts they are trying to understand. Provides the dialog for a skit in which hot and cold gas molecules are interviewed on a talk show to study how these properties affect wind, rain, and other weather phenomena. (MDH)

  18. Obesity in show cats.

    Science.gov (United States)

    Corbee, R J

    2014-12-01

    Obesity is an important disease with a high prevalence in cats. Because obesity is related to several other diseases, it is important to identify the population at risk. Several risk factors for obesity have been described in the literature. A higher incidence of obesity in certain cat breeds has been suggested. The aim of this study was to determine whether obesity occurs more often in certain breeds. The second aim was to relate the increased prevalence of obesity in certain breeds to the official standards of that breed. To this end, 268 cats of 22 different breeds investigated by determining their body condition score (BCS) on a nine-point scale by inspection and palpation, at two different cat shows. Overall, 45.5% of the show cats had a BCS > 5, and 4.5% of the show cats had a BCS > 7. There were significant differences between breeds, which could be related to the breed standards. Most overweight and obese cats were in the neutered group. It warrants firm discussions with breeders and cat show judges to come to different interpretations of the standards in order to prevent overweight conditions in certain breeds from being the standard of beauty. Neutering predisposes for obesity and requires early nutritional intervention to prevent obese conditions. Journal of Animal Physiology and Animal Nutrition © 2014 Blackwell Verlag GmbH.

  19. Honored Teacher Shows Commitment.

    Science.gov (United States)

    Ratte, Kathy

    1987-01-01

    Part of the acceptance speech of the 1985 National Council for the Social Studies Teacher of the Year, this article describes the censorship experience of this honored social studies teacher. The incident involved the showing of a videotape version of the feature film entitled "The Seduction of Joe Tynan." (JDH)

  20. Global detection of live virtual machine migration based on cellular neural networks.

    Science.gov (United States)

    Xie, Kang; Yang, Yixian; Zhang, Ling; Jing, Maohua; Xin, Yang; Li, Zhongxian

    2014-01-01

    In order to meet the demands of operation monitoring of large scale, autoscaling, and heterogeneous virtual resources in the existing cloud computing, a new method of live virtual machine (VM) migration detection algorithm based on the cellular neural networks (CNNs), is presented. Through analyzing the detection process, the parameter relationship of CNN is mapped as an optimization problem, in which improved particle swarm optimization algorithm based on bubble sort is used to solve the problem. Experimental results demonstrate that the proposed method can display the VM migration processing intuitively. Compared with the best fit heuristic algorithm, this approach reduces the processing time, and emerging evidence has indicated that this new approach is affordable to parallelism and analog very large scale integration (VLSI) implementation allowing the VM migration detection to be performed better.

  1. Global Detection of Live Virtual Machine Migration Based on Cellular Neural Networks

    Directory of Open Access Journals (Sweden)

    Kang Xie

    2014-01-01

    Full Text Available In order to meet the demands of operation monitoring of large scale, autoscaling, and heterogeneous virtual resources in the existing cloud computing, a new method of live virtual machine (VM migration detection algorithm based on the cellular neural networks (CNNs, is presented. Through analyzing the detection process, the parameter relationship of CNN is mapped as an optimization problem, in which improved particle swarm optimization algorithm based on bubble sort is used to solve the problem. Experimental results demonstrate that the proposed method can display the VM migration processing intuitively. Compared with the best fit heuristic algorithm, this approach reduces the processing time, and emerging evidence has indicated that this new approach is affordable to parallelism and analog very large scale integration (VLSI implementation allowing the VM migration detection to be performed better.

  2. The energy show

    International Nuclear Information System (INIS)

    1988-01-01

    The Energy Show is a new look at the problems of world energy, where our supplies come from, now and in the future. The programme looks at how we need energy to maintain our standards of living. Energy supply is shown as the complicated set of problems it is - that Fossil Fuels are both raw materials and energy sources, that some 'alternatives' so readily suggested as practical options are in reality a long way from being effective. (author)

  3. MIPAS temperature from the stratosphere to the lower thermosphere: Comparison of vM21 with ACE-FTS, MLS, OSIRIS, SABER, SOFIE and lidar measurements

    Directory of Open Access Journals (Sweden)

    M. García-Comas

    2014-11-01

    Full Text Available We present vM21 MIPAS temperatures from the lower stratosphere to the lower thermosphere, which cover all optimized resolution measurements performed by MIPAS in the middle-atmosphere, upper-atmosphere and noctilucent-cloud modes during its lifetime, i.e., from January 2005 to April 2012. The main upgrades with respect to the previous version of MIPAS temperatures (vM11 are the update of the spectroscopic database, the use of a different climatology of atomic oxygen and carbon dioxide, and the improvement in important technical aspects of the retrieval setup (temperature gradient along the line of sight and offset regularizations, apodization accuracy. Additionally, an updated version of ESA-calibrated L1b spectra (5.02/5.06 is used. The vM21 temperatures correct the main systematic errors of the previous version because they provide on average a 1–2 K warmer stratopause and middle mesosphere, and a 6–10 K colder mesopause (except in high-latitude summers and lower thermosphere. These lead to a remarkable improvement in MIPAS comparisons with ACE-FTS, MLS, OSIRIS, SABER, SOFIE and the two Rayleigh lidars at Mauna Loa and Table Mountain, which, with a few specific exceptions, typically exhibit differences smaller than 1 K below 50 km and than 2 K at 50–80 km in spring, autumn and winter at all latitudes, and summer at low to midlatitudes. Differences in the high-latitude summers are typically smaller than 1 K below 50 km, smaller than 2 K at 50–65 km and 5 K at 65–80 km. Differences between MIPAS and the other instruments in the mid-mesosphere are generally negative. MIPAS mesopause is within 4 K of the other instruments measurements, except in the high-latitude summers, when it is within 5–10 K, being warmer there than SABER, MLS and OSIRIS and colder than ACE-FTS and SOFIE. The agreement in the lower thermosphere is typically better than 5 K, except for high latitudes during spring and summer, when MIPAS usually exhibits larger

  4. Showing Value (Editorial

    Directory of Open Access Journals (Sweden)

    Denise Koufogiannakis

    2009-06-01

    Full Text Available When Su Cleyle and I first decided to start Evidence Based Library and Information Practice, one of the things we agreed upon immediately was that the journal be open access. We knew that a major obstacle to librarians using the research literature was that they did not have access to the research literature. Although Su and I are both academic librarians who can access a wide variety of library and information literature from our institutions, we belong to a profession where not everyone has equal access to the research in our field. Without such access to our own body of literature, how can we ever hope for practitioners to use research evidence in their decision making? It would have been contradictory to the principles of evidence based library and information practice to do otherwise.One of the specific groups we thought could use such an open access venue for discovering research literature was school librarians. School librarians are often isolated and lacking access to the research literature that may help them prove to stakeholders the importance of their libraries and their role within schools. Certainly, school libraries have been in decline and the use of evidence to show value is needed. As Ken Haycock noted in his 2003 report, The Crisis in Canada’s School Libraries: The Case for Reform and Reinvestment, “Across the country, teacher-librarians are losing their jobs or being reassigned. Collections are becoming depleted owing to budget cuts. Some principals believe that in the age of the Internet and the classroom workstation, the school library is an artifact” (9. Within this context, school librarians are looking to our research literature for evidence of the impact that school library programs have on learning outcomes and student success. They are integrating that evidence into their practice, and reflecting upon what can be improved locally. They are focusing on students and showing the impact of school libraries and

  5. An alternative model to distribute VO software to WLCG sites based on CernVM-FS: a prototype at PIC Tier1

    International Nuclear Information System (INIS)

    Lanciotti, E; Merino, G; Blomer, J; Bria, A

    2011-01-01

    In a distributed computing model as WLCG the software of experiment specific application software has to be efficiently distributed to any site of the Grid. Application software is currently installed in a shared area of the site visible for all Worker Nodes (WNs) of the site through some protocol (NFS, AFS or other). The software is installed at the site by jobs which run on a privileged node of the computing farm where the shared area is mounted in write mode. This model presents several drawbacks which cause a non-negligible rate of job failure. An alternative model for software distribution based on the CERN Virtual Machine File System (CernVM-FS) has been tried at PIC, the Spanish Tierl site of WLCG. The test bed used and the results are presented in this paper.

  6. The Small GTPase Rac1 Contributes to Extinction of Aversive Memories of Drug Withdrawal by Facilitating GABAA Receptor Endocytosis in the vmPFC.

    Science.gov (United States)

    Wang, Weisheng; Ju, Yun-Yue; Zhou, Qi-Xin; Tang, Jian-Xin; Li, Meng; Zhang, Lei; Kang, Shuo; Chen, Zhong-Guo; Wang, Yu-Jun; Ji, Hui; Ding, Yu-Qiang; Xu, Lin; Liu, Jing-Gen

    2017-07-26

    Extinction of aversive memories has been a major concern in neuropsychiatric disorders, such as anxiety disorders and drug addiction. However, the mechanisms underlying extinction of aversive memories are not fully understood. Here, we report that extinction of conditioned place aversion (CPA) to naloxone-precipitated opiate withdrawal in male rats activates Rho GTPase Rac1 in the ventromedial prefrontal cortex (vmPFC) in a BDNF-dependent manner, which determines GABA A receptor (GABA A R) endocytosis via triggering synaptic translocation of activity-regulated cytoskeleton-associated protein (Arc) through facilitating actin polymerization. Active Rac1 is essential and sufficient for GABA A R endocytosis and CPA extinction. Knockdown of Rac1 expression within the vmPFC of rats using Rac1-shRNA suppressed GABA A R endocytosis and CPA extinction, whereas expression of a constitutively active form of Rac1 accelerated GABA A R endocytosis and CPA extinction. The crucial role of GABA A R endocytosis in the LTP induction and CPA extinction is evinced by the findings that blockade of GABA A R endocytosis by a dynamin function-blocking peptide (Myr-P4) abolishes LTP induction and CPA extinction. Thus, the present study provides first evidence that Rac1-dependent GABA A R endocytosis plays a crucial role in extinction of aversive memories and reveals the sequence of molecular events that contribute to learning experience modulation of synaptic GABA A R endocytosis. SIGNIFICANCE STATEMENT This study reveals that Rac1-dependent GABA A R endocytosis plays a crucial role in extinction of aversive memories associated with drug withdrawal and identifies Arc as a downstream effector of Rac1 regulations of synaptic plasticity as well as learning and memory, thereby suggesting therapeutic targets to promote extinction of the unwanted memories. Copyright © 2017 the authors 0270-6474/17/377096-15$15.00/0.

  7. Network cosmology.

    Science.gov (United States)

    Krioukov, Dmitri; Kitsak, Maksim; Sinkovits, Robert S; Rideout, David; Meyer, David; Boguñá, Marián

    2012-01-01

    Prediction and control of the dynamics of complex networks is a central problem in network science. Structural and dynamical similarities of different real networks suggest that some universal laws might accurately describe the dynamics of these networks, albeit the nature and common origin of such laws remain elusive. Here we show that the causal network representing the large-scale structure of spacetime in our accelerating universe is a power-law graph with strong clustering, similar to many complex networks such as the Internet, social, or biological networks. We prove that this structural similarity is a consequence of the asymptotic equivalence between the large-scale growth dynamics of complex networks and causal networks. This equivalence suggests that unexpectedly similar laws govern the dynamics of complex networks and spacetime in the universe, with implications to network science and cosmology.

  8. Planning and management of cloud computing networks

    Science.gov (United States)

    Larumbe, Federico

    The evolution of the Internet has a great impact on a big part of the population. People use it to communicate, query information, receive news, work, and as entertainment. Its extraordinary usefulness as a communication media made the number of applications and technological resources explode. However, that network expansion comes at the cost of an important power consumption. If the power consumption of telecommunication networks and data centers is considered as the power consumption of a country, it would rank at the 5 th place in the world. Furthermore, the number of servers in the world is expected to grow by a factor of 10 between 2013 and 2020. This context motivates us to study techniques and methods to allocate cloud computing resources in an optimal way with respect to cost, quality of service (QoS), power consumption, and environmental impact. The results we obtained from our test cases show that besides minimizing capital expenditures (CAPEX) and operational expenditures (OPEX), the response time can be reduced up to 6 times, power consumption by 30%, and CO2 emissions by a factor of 60. Cloud computing provides dynamic access to IT resources as a service. In this paradigm, programs are executed in servers connected to the Internet that users access from their computers and mobile devices. The first advantage of this architecture is to reduce the time of application deployment and interoperability, because a new user only needs a web browser and does not need to install software on local computers with specific operating systems. Second, applications and information are available from everywhere and with any device with an Internet access. Also, servers and IT resources can be dynamically allocated depending on the number of users and workload, a feature called elasticity. This thesis studies the resource management of cloud computing networks and is divided in three main stages. We start by analyzing the planning of cloud computing networks to get a

  9. The Antarctica component of postglacial rebound model ICE-6G_C (VM5a) based on GPS positioning, exposure age dating of ice thicknesses, and relative sea level histories

    Science.gov (United States)

    Argus, Donald F.; Peltier, W. R.; Drummond, R.; Moore, Angelyn W.

    2014-07-01

    A new model of the deglaciation history of Antarctica over the past 25 kyr has been developed, which we refer to herein as ICE-6G_C (VM5a). This revision of its predecessor ICE-5G (VM2) has been constrained to fit all available geological and geodetic observations, consisting of: (1) the present day uplift rates at 42 sites estimated from GPS measurements, (2) ice thickness change at 62 locations estimated from exposure-age dating, (3) Holocene relative sea level histories from 12 locations estimated on the basis of radiocarbon dating and (4) age of the onset of marine sedimentation at nine locations along the Antarctic shelf also estimated on the basis of 14C dating. Our new model fits the totality of these data well. An additional nine GPS-determined site velocities are also estimated for locations known to be influenced by modern ice loss from the Pine Island Bay and Northern Antarctic Peninsula regions. At the 42 locations not influenced by modern ice loss, the quality of the fit of postglacial rebound model ICE-6G_C (VM5A) is characterized by a weighted root mean square residual of 0.9 mm yr-1. The Southern Antarctic Peninsula is inferred to be rising at 2 mm yr-1, requiring there to be less Holocene ice loss there than in the prior model ICE-5G (VM2). The East Antarctica coast is rising at approximately 1 mm yr-1, requiring ice loss from this region to have been small since Last Glacial Maximum. The Ellsworth Mountains, at the base of the Antarctic Peninsula, are inferred to be rising at 5-8 mm yr-1, indicating large ice loss from this area during deglaciation that is poorly sampled by geological data. Horizontal deformation of the Antarctic Plate is minor with two exceptions. First, O'Higgins, at the tip of the Antarctic Peninsula, is moving southeast at a significant 2 mm yr-1 relative to the Antarctic Plate. Secondly, the margins of the Ronne and Ross Ice Shelves are moving horizontally away from the shelf centres at an approximate rate of 0.8 mm yr-1, in

  10. TIG- en plasmalassen : VM 81

    NARCIS (Netherlands)

    W.G. Essers

    2010-01-01

    Voor u ligt de voorlichtingspublicatie "TIG- en plasmalassen". Deze voorlichtingspublicatie is bedoeld voor allen die te maken hebben of te maken krijgen met toepassing van de betreffende verbindingstechnieken. Daarbij moet worden gedacht aan bijvoorbeeld constructeurs,

  11. State-dependent compound inhibition of Nav1.2 sodium channels using the FLIPR Vm dye: on-target and off-target effects of diverse pharmacological agents.

    Science.gov (United States)

    Benjamin, Elfrida R; Pruthi, Farhana; Olanrewaju, Shakira; Ilyin, Victor I; Crumley, Gregg; Kutlina, Elena; Valenzano, Kenneth J; Woodward, Richard M

    2006-02-01

    Voltage-gated sodium channels (NaChs) are relevant targets for pain, epilepsy, and a variety of neurological and cardiac disorders. Traditionally, it has been difficult to develop structure-activity relationships for NaCh inhibitors due to rapid channel kinetics and state-dependent compound interactions. Membrane potential (Vm) dyes in conjunction with a high-throughput fluorescence imaging plate reader (FLIPR) offer a satisfactory 1st-tier solution. Thus, the authors have developed a FLIPR Vm assay of rat Nav1.2 NaCh. Channels were opened by addition of veratridine, and Vm dye responses were measured. The IC50 values from various structural classes of compounds were compared to the resting state binding constant (Kr)and inactivated state binding constant (Ki)obtained using patch-clamp electrophysiology (EP). The FLIPR values correlated with Ki but not Kr. FLIPRIC50 values fell within 0.1-to 1.5-fold of EP Ki values, indicating that the assay generally reports use-dependent inhibition rather than resting state block. The Library of Pharmacologically Active Compounds (LOPAC, Sigma) was screened. Confirmed hits arose from diverse classes such as dopamine receptor antagonists, serotonin transport inhibitors, and kinase inhibitors. These data suggest that NaCh inhibition is inherent in a diverse set of biologically active molecules and may warrant counterscreening NaChs to avoid unwanted secondary pharmacology.

  12. Increased Default Mode Network Connectivity in Obsessive–Compulsive Disorder During Reward Processing

    Directory of Open Access Journals (Sweden)

    Kathrin Koch

    2018-06-01

    Full Text Available Objective: Obsessive-compulsive disorder (OCD is characterized by anxiety-provoking, obsessive thoughts (i.e., obsessions which patients react to with compulsive behaviors (i.e., compulsions. Due to the transient feeling of relief following the reduction of obsession-induced anxiety, compulsions are often described as relieving or even rewarding. Several studies investigated functional activation during reward processing in OCD, but findings are heterogeneous up to now and little is known about potential alterations in functional connectivity.Method: Against this background we studied OCD patients (n = 44 and healthy controls (n = 37 during the receipt of monetary reward by assessing both activation and functional connectivity.Results: Patients showed a decreased activation in several frontal regions and the posterior cingulate (PCC, BA31 together with a stronger connectivity between the PCC and the vmPFC (BA10.Conclusion: Present findings demonstrate an increased connectivity in patients within major nodes of the default mode network (DMN—a network known to be involved in the evaluation of internal mental states. These results may indicate an increased activity of internal, self-related processing at the expense of a normal responsiveness toward external rewards and incentives. This, in turn, may explain the constant urge for additional reinforcement and patients' inability to inhibit their compulsive behaviors.

  13. A Comprehensive Sensitivity Analysis of a Data Center Network with Server Virtualization for Business Continuity

    Directory of Open Access Journals (Sweden)

    Tuan Anh Nguyen

    2015-01-01

    Full Text Available Sensitivity assessment of availability for data center networks (DCNs is of paramount importance in design and management of cloud computing based businesses. Previous work has presented a performance modeling and analysis of a fat-tree based DCN using queuing theory. In this paper, we present a comprehensive availability modeling and sensitivity analysis of a DCell-based DCN with server virtualization for business continuity using stochastic reward nets (SRN. We use SRN in modeling to capture complex behaviors and dependencies of the system in detail. The models take into account (i two DCell configurations, respectively, composed of two and three physical hosts in a DCell0 unit, (ii failure modes and corresponding recovery behaviors of hosts, switches, and VMs, and VM live migration mechanism within and between DCell0s, and (iii dependencies between subsystems (e.g., between a host and VMs and between switches and VMs in the same DCell0. The constructed SRN models are analyzed in detail with regard to various metrics of interest to investigate system’s characteristics. A comprehensive sensitivity analysis of system availability is carried out in consideration of the major impacting parameters in order to observe the system’s complicated behaviors and find the bottlenecks of system availability. The analysis results show the availability improvement, capability of fault tolerance, and business continuity of the DCNs complying with DCell network topology. This study provides a basis of designing and management of DCNs for business continuity.

  14. Network cohesion

    OpenAIRE

    Cavalcanti, Tiago V. V.; Giannitsarou, Chryssi; Johnson, Charles R.

    2016-01-01

    This is the final version of the article. It first appeared from Springer via http://dx.doi.org/10.1007/s00199-016-0992-1 We define a measure of network cohesion and show how it arises naturally in a broad class of dynamic models of endogenous perpetual growth with network externalities. Via a standard growth model, we show why network cohesion is crucial for conditional convergence and explain that as cohesion increases, convergence is faster. We prove properties of network cohesion and d...

  15. Germinación, microinjertación y cultivo de callos in vitro de Vasconcellea stipulata V.M. Badillo y Vasconcellea pubescens A.DC

    OpenAIRE

    Espinosa Soto, Isabel

    2016-01-01

    En varias poblaciones rurales de regiones andinas y centroamericanas se utilizan con fines etnomédicos las hojas, el látex y el fruto de las plantas de la familia Caricaceae cuyo miembro más representativo es la papaya (Carica papaya L.), la cual produce la fuente comercial más importante de la enzima proteolítica papaína. El presente trabajo estudia las especies Vasconcellea stipulata V.M. Badillo y Vasconcellea pubescens A.DC que pertenecen al género Vasconcellea, miembros de la familia Car...

  16. NASA GIBS Use in Live Planetarium Shows

    Science.gov (United States)

    Emmart, C. B.

    2015-12-01

    The American Museum of Natural History's Hayden Planetarium was rebuilt in year 2000 as an immersive theater for scientific data visualization to show the universe in context to our planet. Specific astrophysical movie productions provide the main daily programming, but interactive control software, developed at AMNH allows immersive presentation within a data aggregation of astronomical catalogs called the Digital Universe 3D Atlas. Since 2006, WMS globe browsing capabilities have been built into a software development collaboration with Sweden's Linkoping University (LiU). The resulting Uniview software, now a product of the company SCISS, is operated by about fifty planetariums around that world with ability to network amongst the sites for global presentations. Public presentation of NASA GIBS has allowed authoritative narratives to be presented within the range of data available in context to other sources such as Science on a Sphere, NASA Earth Observatory and Google Earth KML resources. Specifically, the NOAA supported World Views Network conducted a series of presentations across the US that focused on local ecological issues that could then be expanded in the course of presentation to national and global scales of examination. NASA support of for GIBS resources in an easy access multi scale streaming format like WMS has tremendously enabled particularly facile presentations of global monitoring like never before. Global networking of theaters for distributed presentations broadens out the potential for impact of this medium. Archiving and refinement of these presentations has already begun to inform new types of documentary productions that examine pertinent, global interdependency topics.

  17. Risk Aversion in Game Shows

    DEFF Research Database (Denmark)

    Andersen, Steffen; Harrison, Glenn W.; Lau, Morten I.

    2008-01-01

    We review the use of behavior from television game shows to infer risk attitudes. These shows provide evidence when contestants are making decisions over very large stakes, and in a replicated, structured way. Inferences are generally confounded by the subjective assessment of skill in some games......, and the dynamic nature of the task in most games. We consider the game shows Card Sharks, Jeopardy!, Lingo, and finally Deal Or No Deal. We provide a detailed case study of the analyses of Deal Or No Deal, since it is suitable for inference about risk attitudes and has attracted considerable attention....

  18. Measuring performance at trade shows

    DEFF Research Database (Denmark)

    Hansen, Kåre

    2004-01-01

    Trade shows is an increasingly important marketing activity to many companies, but current measures of trade show performance do not adequately capture dimensions important to exhibitors. Based on the marketing literature's outcome and behavior-based control system taxonomy, a model is built...... that captures a outcome-based sales dimension and four behavior-based dimensions (i.e. information-gathering, relationship building, image building, and motivation activities). A 16-item instrument is developed for assessing exhibitors perceptions of their trade show performance. The paper presents evidence...

  19. Response of Cultured Neuronal Network Activity After High-Intensity Power Frequency Magnetic Field Exposure

    Directory of Open Access Journals (Sweden)

    Atsushi Saito

    2018-03-01

    Full Text Available High-intensity and low frequency (1–100 kHz time-varying electromagnetic fields stimulate the human body through excitation of the nervous system. In power frequency range (50/60 Hz, a frequency-dependent threshold of the external electric field-induced neuronal modulation in cultured neuronal networks was used as one of the biological indicator in international guidelines; however, the threshold of the magnetic field-induced neuronal modulation has not been elucidated. In this study, we exposed rat brain-derived neuronal networks to a high-intensity power frequency magnetic field (hPF-MF, and evaluated the modulation of synchronized bursting activity using a multi-electrode array (MEA-based extracellular recording technique. As a result of short-term hPF-MF exposure (50–400 mT root-mean-square (rms, 50 Hz, sinusoidal wave, 6 s, the synchronized bursting activity was increased in the 400 mT-exposed group. On the other hand, no change was observed in the 50–200 mT-exposed groups. In order to clarify the mechanisms of the 400 mT hPF-MF exposure-induced neuronal response, we evaluated it after blocking inhibitory synapses using bicuculline methiodide (BMI; subsequently, increase in bursting activity was observed with BMI application, and the response of 400 mT hPF-MF exposure disappeared. Therefore, it was suggested that the response of hPF-MF exposure was involved in the inhibitory input. Next, we screened the inhibitory pacemaker-like neuronal activity which showed autonomous 4–10 Hz firing with CNQX and D-AP5 application, and it was confirmed that the activity was reduced after 400 mT hPF-MF exposure. Comparison of these experimental results with estimated values of the induced electric field (E-field in the culture medium revealed that the change in synchronized bursting activity occurred over 0.3 V/m, which was equivalent to the findings of a previous study that used the external electric fields. In addition, the results suggested that

  20. Tokyo Motor Show 2003; Tokyo Motor Show 2003

    Energy Technology Data Exchange (ETDEWEB)

    Joly, E.

    2004-01-01

    The text which follows present the different techniques exposed during the 37. Tokyo Motor Show. The report points out the great tendencies of developments of the Japanese automobile industry. The hybrid electric-powered vehicles or those equipped with fuel cells have been highlighted by the Japanese manufacturers which allow considerable budgets in the research of less polluting vehicles. The exposed models, although being all different according to the manufacturer, use always a hybrid system: fuel cell/battery. The manufacturers have stressed too on the intelligent systems for navigation and safety as well as on the design and comfort. (O.M.)

  1. Network Affordances

    DEFF Research Database (Denmark)

    Samson, Audrey; Soon, Winnie

    2015-01-01

    This paper examines the notion of network affordance within the context of network art. Building on Gibson's theory (Gibson, 1979) we understand affordance as the perceived and actual parameters of a thing. We expand on Gaver's affordance of predictability (Gaver, 1996) to include ecological...... and computational parameters of unpredictability. We illustrate the notion of unpredictability by considering four specific works that were included in a network art exhibiton, SPEED SHOW [2.0] Hong Kong. The paper discusses how the artworks are contingent upon the parameteric relations (Parisi, 2013......), of the network. We introduce network affordance as a dynamic framework that could articulate the experienced tension arising from the (visible) symbolic representation of computational processes and its hidden occurrences. We base our proposal on the experience of both organising the SPEED SHOW and participating...

  2. Optimized Virtual Machine Placement with Traffic-Aware Balancing in Data Center Networks

    Directory of Open Access Journals (Sweden)

    Tao Chen

    2016-01-01

    Full Text Available Virtualization has been an efficient method to fully utilize computing resources such as servers. The way of placing virtual machines (VMs among a large pool of servers greatly affects the performance of data center networks (DCNs. As network resources have become a main bottleneck of the performance of DCNs, we concentrate on VM placement with Traffic-Aware Balancing to evenly utilize the links in DCNs. In this paper, we first proposed a Virtual Machine Placement Problem with Traffic-Aware Balancing (VMPPTB and then proved it to be NP-hard and designed a Longest Processing Time Based Placement algorithm (LPTBP algorithm to solve it. To take advantage of the communication locality, we proposed Locality-Aware Virtual Machine Placement Problem with Traffic-Aware Balancing (LVMPPTB, which is a multiobjective optimization problem of simultaneously minimizing the maximum number of VM partitions of requests and minimizing the maximum bandwidth occupancy on uplinks of Top of Rack (ToR switches. We also proved it to be NP-hard and designed a heuristic algorithm (Least-Load First Based Placement algorithm, LLBP algorithm to solve it. Through extensive simulations, the proposed heuristic algorithm is proven to significantly balance the bandwidth occupancy on uplinks of ToR switches, while keeping the number of VM partitions of each request small enough.

  3. Acupuncture analgesia involves modulation of pain-induced gamma oscillations and cortical network connectivity.

    Science.gov (United States)

    Hauck, Michael; Schröder, Sven; Meyer-Hamme, Gesa; Lorenz, Jürgen; Friedrichs, Sunja; Nolte, Guido; Gerloff, Christian; Engel, Andreas K

    2017-11-24

    Recent studies support the view that cortical sensory, limbic and executive networks and the autonomic nervous system might interact in distinct manners under the influence of acupuncture to modulate pain. We performed a double-blind crossover design study to investigate subjective ratings, EEG and ECG following experimental laser pain under the influence of sham and verum acupuncture in 26 healthy volunteers. We analyzed neuronal oscillations and inter-regional coherence in the gamma band of 128-channel-EEG recordings as well as heart rate variability (HRV) on two experimental days. Pain ratings and pain-induced gamma oscillations together with vagally-mediated power in the high-frequency bandwidth (vmHF) of HRV decreased significantly stronger during verum than sham acupuncture. Gamma oscillations were localized in the prefrontal cortex (PFC), mid-cingulate cortex (MCC), primary somatosensory cortex and insula. Reductions of pain ratings and vmHF-power were significantly correlated with increase of connectivity between the insula and MCC. In contrast, connectivity between left and right PFC and between PFC and insula correlated positively with vmHF-power without a relationship to acupuncture analgesia. Overall, these findings highlight the influence of the insula in integrating activity in limbic-saliency networks with vagally mediated homeostatic control to mediate antinociception under the influence of acupuncture.

  4. Reality show: um paradoxo nietzschiano

    Directory of Open Access Journals (Sweden)

    Ilana Feldman

    2011-01-01

    Full Text Available

    O fenômeno dos reality shows - e a subseqüente relação entre imagem e verdade - assenta-se sobre uma série de paradoxos. Tais paradoxos podem ser compreendidos à luz do pensamento do filósofo alemão Friedrich Nietzsche, que, através dos usos de formulações paradoxais, concebia a realidade como um mundo de pura aparência e a verdade como um acréscimo ficcional, como um efeito. A ficção é então tomada, na filosofia de Nietzsche, não em seu aspecto falsificante e desrealizador - como sempre pleiteou nossa tradição metafísica -, mas como condição necessária para que certa espécie de invenção possa operar como verdade. Sendo assim, a própria expressão reality show, através de sua formulação paradoxal, engendra explicitamente um mundo de pura aparência, em que a verdade, a parte reality da proposição, é da ordem do suplemento, daquilo que se acrescenta ficcionalmente - como um adjetivo - a show. O ornamento, nesse caso, passa a ocupar o lugar central, apontando para o efeito produzido: o efeito-de-verdade. Seguindo, então, o pensamento nietzschiano e sua atualização na contemporaneidade, investigaremos de que forma os televisivos “shows de realidade” operam paradoxalmente, em consonância com nossas paradoxais práticas culturais.

  5. Age Differences in the Intrinsic Functional Connectivity of Default Network Subsystems

    Directory of Open Access Journals (Sweden)

    Karen eCampbell

    2013-11-01

    Full Text Available Recent work suggests that the default mode network (DMN includes two core regions, the ventromedial prefrontal cortex (vmPFC and posterior cingulate cortex (PCC, and several unique subsystems that are functionally distinct. These include a medial temporal lobe (MTL subsystem, active during remembering and future projection, and a dorsomedial PFC (dmPFC subsystem, active during self-reference. The PCC has been further subdivided into ventral (vPCC and dorsal (dPCC regions that are more strongly connected with the DMN and cognitive control networks, respectively. The goal of this study was to examine age differences in resting state functional connectivity within these subsystems. After applying a rigorous procedure to reduce the effects of head motion, we used a multivariate technique to identify both common and unique patterns of functional connectivity in the MTL vs. the dmPFC, and in vPCC vs. dPCC. All four areas had robust functional connectivity with other DMN regions, and each also showed distinct connectivity patterns in both age groups. Young and older adults had equivalent functional connectivity in the MTL subsystem. Older adults showed weaker connectivity in the vPCC and dmPFC subsystems, particularly with other DMN areas, but stronger connectivity than younger adults in the dPCC subsystem, which included areas involved in cognitive control. Our data provide evidence for distinct subsystems involving DMN nodes, which are maintained with age. Nevertheless, there are age differences in the strength of functional connectivity within these subsystems, supporting prior evidence that DMN connectivity is particularly vulnerable to age, whereas connectivity involving cognitive control regions is relatively maintained. These results suggest an age difference in the integrated activity among brain networks that can have implications for cognition in older adults.

  6. Altered Behavioral and Autonomic Pain Responses in Alzheimer’s Disease Are Associated with Dysfunctional Affective, Self-Reflective and Salience Network Resting-State Connectivity

    Directory of Open Access Journals (Sweden)

    Paul A. Beach

    2017-09-01

    Full Text Available While pain behaviors are increased in Alzheimer’s disease (AD patients compared to healthy seniors (HS across multiple disease stages, autonomic responses are reduced with advancing AD. To better understand the neural mechanisms underlying these phenomena, we undertook a controlled cross-sectional study examining behavioral (Pain Assessment in Advanced Dementia, PAINAD scores and autonomic (heart rate, HR pain responses in 24 HS and 20 AD subjects using acute pressure stimuli. Resting-state fMRI was utilized to investigate how group connectivity differences were related to altered pain responses. Pain behaviors (slope of PAINAD score change and mean PAINAD score were increased in patients vs. controls. Autonomic measures (HR change intercept and mean HR change were reduced in severe vs. mildly affected AD patients. Group functional connectivity differences associated with greater pain behavior reactivity in patients included: connectivity within a temporal limbic network (TLN and between the TLN and ventromedial prefrontal cortex (vmPFC; between default mode network (DMN subcomponents; between the DMN and ventral salience network (vSN. Reduced HR responses within the AD group were associated with connectivity changes within the DMN and vSN—specifically the precuneus and vmPFC. Discriminant classification indicated HR-related connectivity within the vSN to the vmPFC best distinguished AD severity. Thus, altered behavioral and autonomic pain responses in AD reflects dysfunction of networks and structures subserving affective, self-reflective, salience and autonomic regulation.

  7. Graphs, Ideal Flow, and the Transportation Network

    OpenAIRE

    Teknomo, Kardi

    2016-01-01

    This lecture discusses the mathematical relationship between network structure and network utilization of transportation network. Network structure means the graph itself. Network utilization represent the aggregation of trajectories of agents in using the network graph. I show the similarity and relationship between the structural pattern of the network and network utilization.

  8. Relative sea level in the Western Mediterranean basin: A regional test of the ICE-7G_NA (VM7) model and a constraint on late Holocene Antarctic deglaciation

    Science.gov (United States)

    Roy, Keven; Peltier, W. R.

    2018-03-01

    The Mediterranean Basin is a region of special interest in the study of past and present relative sea level evolution, given its location south of the ice sheets that covered large fractions of Northern Europe during the last glaciation, the large number of biological, geological and archaeological sea level indicators that have been retrieved from its coastal regions, as well as its high density of modern coastal infrastructure. Models of the Glacial Isostatic Adjustment (GIA) process provide reconstructions of past relative sea level evolution, and can be tested for validity against past sea level indicators from the region. It is demonstrated herein that the latest ICE-7G_NA (VM7) model of the GIA process, the North American component of which was refined using a full suite of geophysical observables, is able to reconcile the vast majority of uniformly analyzed relative sea level constraints available for the Western part of the Mediterranean basin, a region to which it was not tuned. We also revisit herein the previously published interpretations of relative sea level information obtained from Roman-era coastal Mediterranean "fish tanks", analyze the far-field influence of the rate of late Holocene Antarctic ice sheet melting history on the exceptionally detailed relative sea level history available from southern Tunisia, and extend the analysis to complementary constraints on the history of Antarctic ice-sheet melting available from islands in the equatorial Pacific Ocean. The analyses reported herein provide strong support for the global "exportability" of the ICE-7G_NA (VM7) model, a result that speaks directly to the ability of spherically symmetric models of the internal viscoelastic structure to explain globally distributed observations, while also identifying isolated regions of remaining misfit which will benefit from further study.

  9. Chaotic diagonal recurrent neural network

    International Nuclear Information System (INIS)

    Wang Xing-Yuan; Zhang Yi

    2012-01-01

    We propose a novel neural network based on a diagonal recurrent neural network and chaos, and its structure and learning algorithm are designed. The multilayer feedforward neural network, diagonal recurrent neural network, and chaotic diagonal recurrent neural network are used to approach the cubic symmetry map. The simulation results show that the approximation capability of the chaotic diagonal recurrent neural network is better than the other two neural networks. (interdisciplinary physics and related areas of science and technology)

  10. Learning Networks, Networked Learning

    NARCIS (Netherlands)

    Sloep, Peter; Berlanga, Adriana

    2010-01-01

    Sloep, P. B., & Berlanga, A. J. (2011). Learning Networks, Networked Learning [Redes de Aprendizaje, Aprendizaje en Red]. Comunicar, XIX(37), 55-63. Retrieved from http://dx.doi.org/10.3916/C37-2011-02-05

  11. Software-defined optical network for metro-scale geographically distributed data centers.

    Science.gov (United States)

    Samadi, Payman; Wen, Ke; Xu, Junjie; Bergman, Keren

    2016-05-30

    The emergence of cloud computing and big data has rapidly increased the deployment of small and mid-sized data centers. Enterprises and cloud providers require an agile network among these data centers to empower application reliability and flexible scalability. We present a software-defined inter data center network to enable on-demand scale out of data centers on a metro-scale optical network. The architecture consists of a combined space/wavelength switching platform and a Software-Defined Networking (SDN) control plane equipped with a wavelength and routing assignment module. It enables establishing transparent and bandwidth-selective connections from L2/L3 switches, on-demand. The architecture is evaluated in a testbed consisting of 3 data centers, 5-25 km apart. We successfully demonstrated end-to-end bulk data transfer and Virtual Machine (VM) migrations across data centers with less than 100 ms connection setup time and close to full link capacity utilization.

  12. Reply to Comment by W. R. Peltier, D. F. Argus, and R. Drummond on "An Assessment of the ICE6G_C (VM5a) Glacial Isostatic Adjustment Model"

    Science.gov (United States)

    Purcell, A.; Tregoning, P.; Dehecq, A.

    2018-02-01

    The empirical approximation of Purcell et al. (2011, https://doi.org/10.1029/2011GL048624) has been validated by Peltier et al. (2018, https://doi.org/10.1002/2016JB013844). In their Comment they introduced new results derived from the same ice/rheology models of ICE6G_C (VM5a) but using a different model for Antarctic bathymetry. This has greatly reduced the differences in predicted Antarctic uplift rates relative to those of Purcell et al. (2016, https://doi.org/10.1002/2015JB012742). In fact, with a ˜50% reduction in uplift rate in the Weddell Sea, the results of Peltier et al. (2018, https://doi.org/10.1002/2016JB013844) now agree more closely with the predictions of Purcell et al. (2016, https://doi.org/10.1002/2015JB012742) than with the original ICE6G_C values. Peltier et al. (2018, https://doi.org/10.1002/2016JB013844) state that the high power in their high-frequency spherical harmonic coefficients remains in their new calculations. They also claim that Purcell et al. (2016, https://doi.org/10.1002/2015JB012742) used an inaccurate loading history in deriving their velocity field. In fact, the ice load history was unchanged; to remove any ambiguity, the ice and water load histories used in the CALSEA calculations are provided in the supporting information.

  13. Network connectivity value.

    Science.gov (United States)

    Dragicevic, Arnaud; Boulanger, Vincent; Bruciamacchie, Max; Chauchard, Sandrine; Dupouey, Jean-Luc; Stenger, Anne

    2017-04-21

    In order to unveil the value of network connectivity, we formalize the construction of ecological networks in forest environments as an optimal control dynamic graph-theoretic problem. The network is based on a set of bioreserves and patches linked by ecological corridors. The node dynamics, built upon the consensus protocol, form a time evolutive Mahalanobis distance weighted by the opportunity costs of timber production. We consider a case of complete graph, where the ecological network is fully connected, and a case of incomplete graph, where the ecological network is partially connected. The results show that the network equilibrium depends on the size of the reception zone, while the network connectivity depends on the environmental compatibility between the ecological areas. Through shadow prices, we find that securing connectivity in partially connected networks is more expensive than in fully connected networks, but should be undertaken when the opportunity costs are significant. Copyright © 2017 Elsevier Ltd. All rights reserved.

  14. Vulnerability and controllability of networks of networks

    International Nuclear Information System (INIS)

    Liu, Xueming; Peng, Hao; Gao, Jianxi

    2015-01-01

    Network science is a highly interdisciplinary field ranging from natural science to engineering technology and it has been applied to model complex systems and used to explain their behaviors. Most previous studies have been focus on isolated networks, but many real-world networks do in fact interact with and depend on other networks via dependency connectivities, forming “networks of networks” (NON). The interdependence between networks has been found to largely increase the vulnerability of interacting systems, when a node in one network fails, it usually causes dependent nodes in other networks to fail, which, in turn, may cause further damage on the first network and result in a cascade of failures with sometimes catastrophic consequences, e.g., electrical blackouts caused by the interdependence of power grids and communication networks. The vulnerability of a NON can be analyzed by percolation theory that can be used to predict the critical threshold where a NON collapses. We review here the analytic framework for analyzing the vulnerability of NON, which yields novel percolation laws for n-interdependent networks and also shows that percolation theory of a single network studied extensively in physics and mathematics in the last 50 years is a specific limited case of the more general case of n interacting networks. Understanding the mechanism behind the cascading failure in NON enables us finding methods to decrease the vulnerability of the natural systems and design of more robust infrastructure systems. By examining the vulnerability of NON under targeted attack and studying the real interdependent systems, we find two methods to decrease the systems vulnerability: (1) protect the high-degree nodes, and (2) increase the degree correlation between networks. Furthermore, the ultimate proof of our understanding of natural and technological systems is reflected in our ability to control them. We also review the recent studies and challenges on the

  15. Neural Network Ensembles

    DEFF Research Database (Denmark)

    Hansen, Lars Kai; Salamon, Peter

    1990-01-01

    We propose several means for improving the performance an training of neural networks for classification. We use crossvalidation as a tool for optimizing network parameters and architecture. We show further that the remaining generalization error can be reduced by invoking ensembles of similar...... networks....

  16. Heterogeneity and Networks

    OpenAIRE

    Goyal, S.

    2018-01-01

    This chapter shows that networks can have large and differentiated effects on behavior and then argues that social and economic pressures facilitate the formation of heterogenous networks. Thus networks can play an important role in understanding the wide diversity in human behaviour and in economic outcomes.

  17. Network protocols and sockets

    OpenAIRE

    BALEJ, Marek

    2010-01-01

    My work will deal with network protocols and sockets and their use in programming language C#. It will therefore deal programming network applications on the platform .NET from Microsoft and instruments, which C# provides to us. There will describe the tools and methods for programming network applications, and shows a description and sample applications that work with sockets and application protocols.

  18. Cascading Failures and Recovery in Networks of Networks

    Science.gov (United States)

    Havlin, Shlomo

    Network science have been focused on the properties of a single isolated network that does not interact or depends on other networks. In reality, many real-networks, such as power grids, transportation and communication infrastructures interact and depend on other networks. I will present a framework for studying the vulnerability and the recovery of networks of interdependent networks. In interdependent networks, when nodes in one network fail, they cause dependent nodes in other networks to also fail. This is also the case when some nodes like certain locations play a role in two networks -multiplex. This may happen recursively and can lead to a cascade of failures and to a sudden fragmentation of the system. I will present analytical solutions for the critical threshold and the giant component of a network of n interdependent networks. I will show, that the general theory has many novel features that are not present in the classical network theory. When recovery of components is possible global spontaneous recovery of the networks and hysteresis phenomena occur and the theory suggests an optimal repairing strategy of system of systems. I will also show that interdependent networks embedded in space are significantly more vulnerable compared to non embedded networks. In particular, small localized attacks may lead to cascading failures and catastrophic consequences.Thus, analyzing data of real network of networks is highly required to understand the system vulnerability. DTRA, ONR, Israel Science Foundation.

  19. Do Policy Networks lead to Network Governing?

    DEFF Research Database (Denmark)

    Damgaard, Bodil

    This paper challenges the notion that creation of local policy networks necessarily leads to network governing. Through actor-centred case studies in the area of municipally implemented employment policy in Denmark it was found that the local governing mode is determined mainly by the municipality......’s approach to local co-governing as well as by the capacity and interest of key private actors. It is argued that national legislation requesting the creation of local policy networks was not enough to assure network governing and the case studies show that local policy networks may subsist also under...... hierarchical governing modes. Reasons why hierarchical governing modes prevail over network governing in some settings are identified pointing to both actor borne and structural factors. Output indicators of the four cases do not show that a particular governing mode is more efficient in its employment policy...

  20. A Network Traffic Control Enhancement Approach over Bluetooth Networks

    DEFF Research Database (Denmark)

    Son, L.T.; Schiøler, Henrik; Madsen, Ole Brun

    2003-01-01

    This paper analyzes network traffic control issues in Bluetooth data networks as convex optimization problem. We formulate the problem of maximizing of total network flows and minimizing the costs of flows. An adaptive distributed network traffic control scheme is proposed as an approximated solu...... as capacity limitations and flow requirements in the network. Simulation shows that the performance of Bluetooth networks could be improved by applying the adaptive distributed network traffic control scheme...... solution of the stated optimization problem that satisfies quality of service requirements and topologically induced constraints in Bluetooth networks, such as link capacity and node resource limitations. The proposed scheme is decentralized and complies with frequent changes of topology as well......This paper analyzes network traffic control issues in Bluetooth data networks as convex optimization problem. We formulate the problem of maximizing of total network flows and minimizing the costs of flows. An adaptive distributed network traffic control scheme is proposed as an approximated...

  1. Determinants of Network Outcomes

    DEFF Research Database (Denmark)

    Ysa, Tamyko; Sierra, Vicenta; Esteve, Marc

    2014-01-01

    The literature on network management is extensive. However, it generally explores network structures, neglecting the impact of management strategies. In this article we assess the effect of management strategies on network outcomes, providing empirical evidence from 119 urban revitalization...... networks. We go beyond current work by testing a path model for the determinants of network outcomes and considering the interactions between the constructs: management strategies, trust, complexity, and facilitative leadership. Our results suggest that management strategies have a strong effect on network...... outcomes and that they enhance the level of trust. We also found that facilitative leadership has a positive impact on network management as well as on trust in the network. Our findings also show that complexity has a negative impact on trust. A key finding of our research is that managers may wield more...

  2. Networking for the Environment

    DEFF Research Database (Denmark)

    Dickel, Petra; Hörisch, Jacob; Ritter, Thomas

    2018-01-01

    Although the public debate on the environmental orientation of firms has intensified, there is a lack of understanding about the consequences of that orientation, especially in terms of its impact on firms' networking behavior. In order to fill this gap, this paper analyzes the impact of external...... and internal environmental orientation on start-ups’ network characteristics, because networks are both vital for the success of start-ups and resource demanding. More specifically, the effects of environmental orientation on networking frequency and network size among start-ups are analyzed. Empirical data...... from 248 technology-based start-ups shows that those firms with a strong external environmental orientation have significantly higher networking frequencies and build larger networks. Conversely, a strong internal environmental orientation is linked to smaller networks. Thus, the results highlight...

  3. Reciprocity of weighted networks.

    Science.gov (United States)

    Squartini, Tiziano; Picciolo, Francesco; Ruzzenenti, Franco; Garlaschelli, Diego

    2013-01-01

    In directed networks, reciprocal links have dramatic effects on dynamical processes, network growth, and higher-order structures such as motifs and communities. While the reciprocity of binary networks has been extensively studied, that of weighted networks is still poorly understood, implying an ever-increasing gap between the availability of weighted network data and our understanding of their dyadic properties. Here we introduce a general approach to the reciprocity of weighted networks, and define quantities and null models that consistently capture empirical reciprocity patterns at different structural levels. We show that, counter-intuitively, previous reciprocity measures based on the similarity of mutual weights are uninformative. By contrast, our measures allow to consistently classify different weighted networks according to their reciprocity, track the evolution of a network's reciprocity over time, identify patterns at the level of dyads and vertices, and distinguish the effects of flux (im)balances or other (a)symmetries from a true tendency towards (anti-)reciprocation.

  4. Robustness of airline route networks

    Science.gov (United States)

    Lordan, Oriol; Sallan, Jose M.; Escorihuela, Nuria; Gonzalez-Prieto, David

    2016-03-01

    Airlines shape their route network by defining their routes through supply and demand considerations, paying little attention to network performance indicators, such as network robustness. However, the collapse of an airline network can produce high financial costs for the airline and all its geographical area of influence. The aim of this study is to analyze the topology and robustness of the network route of airlines following Low Cost Carriers (LCCs) and Full Service Carriers (FSCs) business models. Results show that FSC hubs are more central than LCC bases in their route network. As a result, LCC route networks are more robust than FSC networks.

  5. QLab 3 show control projects for live performances & installations

    CERN Document Server

    Hopgood, Jeromy

    2013-01-01

    Used from Broadway to Britain's West End, QLab software is the tool of choice for many of the world's most prominent sound, projection, and integrated media designers. QLab 3 Show Control: Projects for Live Performances & Installations is a project-based book on QLab software covering sound, video, and show control. With information on both sound and video system basics and the more advanced functions of QLab such as MIDI show control, new OSC capabilities, networking, video effects, and microphone integration, each chapter's specific projects will allow you to learn the software's capabilitie

  6. Rain VM: Portable Concurrency through Managing Code

    OpenAIRE

    Brown, Neil C.C.

    2006-01-01

    A long-running recent trend in computer programming is the growth in popularity of virtual machines. However, few have included good support for concurrency - a natural mechanism in the Rain programming language. This paper details the design and implementation of a secure virtual machine with support for concurrency, which enables portability of concurrent programs. Possible implementation ideas of many-to-many threading models for the virtual machine kernel are discussed, and initial benchm...

  7. Low pressure gage type VM-01

    International Nuclear Information System (INIS)

    Brandea, I.; Curuia, M.; Culcer, M.

    2000-01-01

    High vacuum systems became an important element of many applied technologies, from gas analysers to rocket engines. An intelligent apparatus for pressure measurement in the range of 10 -3 - 10 -8 mbar, with incorporated INTEL 80C51 microcontroller is presented. Based on a Bayard-Alpert hot cathode gage, equally developed in our institute, the pressure gage allows the displaying of different operation parameters and also of the error codes for different kinds of malfunctioning, as for instance missing of grid voltage, grid-collector breakdown, pressure increasing above 10 -3 mbar. Its operation is based on a microcontroller assembly language program especially worked out and introduced in the central units EPROM memory. The gage characteristics for different gases are also introduced in an EPROM memory, and the type of the gas is selected by the operator from the front panel. One can select also from the front panel the pressure unit (mbar, torr, Pa). If a remote control is necessary, this can be done by means of a PC, with a program written in the LabVIEW graphical programming language. The pressure gage was tested and calibrated in relation with an EDWARDS vacuum measuring system and provided a good accuracy (better than 25%). Its field of application is both laboratory and industrial measurements. Its main features are: - supply voltage, 220 V ac / 50 Hz; - power consumption, 30 W; - gage's grid supply voltage, 160 V; grid current, 2 mA / p = 10 -5 ...10 -8 mbar and 0.2 mA / p = 10 -3 ...10 -5 mbar; - cathode heating current, max. 3 A; - measuring range, 10 -3 ...10 -8 mbar; - error of measurement, ±35%; - remote control, according to the RS232 standard; - size, 320 x 200 x 100 mm; - weight, 3.5 Kg. (authors)

  8. Microsoft Windows networking essentials

    CERN Document Server

    Gibson, Darril

    2011-01-01

    The core concepts and technologies of Windows networking Networking can be a complex topic, especially for those new to the field of IT. This focused, full-color book takes a unique approach to teaching Windows networking to beginners by stripping down a network to its bare basics, thereby making each topic clear and easy to understand. Focusing on the new Microsoft Technology Associate (MTA) program, this book pares down to just the essentials, showing beginners how to gain a solid foundation for understanding networking concepts upon which more advanced topics and technologies can be built.

  9. Declarative Networking

    CERN Document Server

    Loo, Boon Thau

    2012-01-01

    Declarative Networking is a programming methodology that enables developers to concisely specify network protocols and services, which are directly compiled to a dataflow framework that executes the specifications. Declarative networking proposes the use of a declarative query language for specifying and implementing network protocols, and employs a dataflow framework at runtime for communication and maintenance of network state. The primary goal of declarative networking is to greatly simplify the process of specifying, implementing, deploying and evolving a network design. In addition, decla

  10. Opposing Effects of Intrinsic Conductance and Correlated Synaptic Input on V-Fluctuations during Network Activity

    DEFF Research Database (Denmark)

    Kolind, Jens; Hounsgaard, Jørn Dybkjær; Berg, Rune W

    2012-01-01

    Neurons often receive massive concurrent bombardment of synaptic inhibition and excitation during functional network activity. This increases membrane conductance and causes fluctuations in membrane potential (V(m)) and spike timing. The conductance increase is commonly attributed to synaptic....... If the spikes arrive at random times the changes in synaptic conductance are therefore stochastic and rapid during intense network activity. In comparison, sub-threshold intrinsic conductances vary smoothly in time. In the present study this discrepancy is investigated using two conductance-based models: a (1...... conductance, but also includes the intrinsic conductances recruited during network activity. These two sources of conductance have contrasting dynamic properties at sub-threshold membrane potentials. Synaptic transmitter gated conductance changes abruptly and briefly with each presynaptic action potential...

  11. Information theoretic description of networks

    Science.gov (United States)

    Wilhelm, Thomas; Hollunder, Jens

    2007-11-01

    We present a new information theoretic approach for network characterizations. It is developed to describe the general type of networks with n nodes and L directed and weighted links, i.e., it also works for the simpler undirected and unweighted networks. The new information theoretic measures for network characterizations are based on a transmitter-receiver analogy of effluxes and influxes. Based on these measures, we classify networks as either complex or non-complex and as either democracy or dictatorship networks. Directed networks, in particular, are furthermore classified as either information spreading and information collecting networks. The complexity classification is based on the information theoretic network complexity measure medium articulation (MA). It is proven that special networks with a medium number of links ( L∼n1.5) show the theoretical maximum complexity MA=(log n)2/2. A network is complex if its MA is larger than the average MA of appropriately randomized networks: MA>MAr. A network is of the democracy type if its redundancy Rdictatorship network. In democracy networks all nodes are, on average, of similar importance, whereas in dictatorship networks some nodes play distinguished roles in network functioning. In other words, democracy networks are characterized by cycling of information (or mass, or energy), while in dictatorship networks there is a straight through-flow from sources to sinks. The classification of directed networks into information spreading and information collecting networks is based on the conditional entropies of the considered networks ( H(A/B)=uncertainty of sender node if receiver node is known, H(B/A)=uncertainty of receiver node if sender node is known): if H(A/B)>H(B/A), it is an information collecting network, otherwise an information spreading network. Finally, different real networks (directed and undirected, weighted and unweighted) are classified according to our general scheme.

  12. Synchronization on effective networks

    International Nuclear Information System (INIS)

    Zhou Tao; Zhao Ming; Zhou Changsong

    2010-01-01

    The study of network synchronization has attracted increasing attentionrecently. In this paper, we strictly define a class of networks, namely effective networks, which are synchronizable and orientable networks. We can prove that all the effective networks with the same size have the same spectra, and are of the best synchronizability according to the master stability analysis. However, it is found that the synchronization time for different effective networks can be quite different. Further analysis shows that the key ingredient affecting the synchronization time is the maximal depth of an effective network: the larger depth results in a longer synchronization time. The secondary factor is the number of links. The increasing number of links connecting nodes in the same layer (horizontal links) will lead to longer synchronization time, whereas the increasing number of links connecting nodes in neighboring layers (vertical links) will accelerate the synchronization. Our analysis of the relationship between the structure and synchronization properties of the original and effective networks shows that the purely directed effective network can provide an approximation of the original weighted network with normalized input strength. Our findings provide insights into the roles of depth, horizontal and vertical links in the synchronizing process, and suggest that the spectral analysis is helpful yet insufficient for the comprehensive understanding of network synchronization.

  13. Synchronization on effective networks

    Energy Technology Data Exchange (ETDEWEB)

    Zhou Tao [Web Sciences Center, University of Electronic Science and Technology of China, Chengdu 610054 (China); Zhao Ming [Department of Modern Physics, University of Science and Technology of China, Hefei 230026 (China); Zhou Changsong, E-mail: cszhou@hkbu.edu.h [Department of Physics, Hong Kong Baptist University, Kowloon Tong (Hong Kong)

    2010-04-15

    The study of network synchronization has attracted increasing attentionrecently. In this paper, we strictly define a class of networks, namely effective networks, which are synchronizable and orientable networks. We can prove that all the effective networks with the same size have the same spectra, and are of the best synchronizability according to the master stability analysis. However, it is found that the synchronization time for different effective networks can be quite different. Further analysis shows that the key ingredient affecting the synchronization time is the maximal depth of an effective network: the larger depth results in a longer synchronization time. The secondary factor is the number of links. The increasing number of links connecting nodes in the same layer (horizontal links) will lead to longer synchronization time, whereas the increasing number of links connecting nodes in neighboring layers (vertical links) will accelerate the synchronization. Our analysis of the relationship between the structure and synchronization properties of the original and effective networks shows that the purely directed effective network can provide an approximation of the original weighted network with normalized input strength. Our findings provide insights into the roles of depth, horizontal and vertical links in the synchronizing process, and suggest that the spectral analysis is helpful yet insufficient for the comprehensive understanding of network synchronization.

  14. Networks around entrepreneurs

    DEFF Research Database (Denmark)

    Bertelsen, Rasmus Gjedssø; Ashourizadeh, Shayegheh; Jensen, Kent Wickstrøm

    2017-01-01

    Purpose: Entrepreneurs are networking with others to get advice for their businesses. The networking differs between men and women; notably, men are more often networking in the public sphere and women are more often networking in the private sphere. The aim here is to account for how such gender......Purpose: Entrepreneurs are networking with others to get advice for their businesses. The networking differs between men and women; notably, men are more often networking in the public sphere and women are more often networking in the private sphere. The aim here is to account for how...... such gendering of entrepreneurs’ networks differ between societies and cultures. Research Design: Based on survey data from the Global Entrepreneurships Monitor, a sample of 16,365 entrepreneurs is used to compare the gendering of entrepreneurs’ networks in China, and five countries largely located around...... the Persian Gulf, namely Yemen, Iran, Saudi Arabia, Qatar and United Arab Emirates. Findings: Analyses show that female entrepreneurs tend to have slightly larger private sphere networks than male entrepreneurs. The differences between male and female entrepreneurs’ networking in the public sphere...

  15. [Social networks in drinking behaviors among Japanese: support network, drinking network, and intervening network].

    Science.gov (United States)

    Yoshihara, Chika; Shimizu, Shinji

    2005-10-01

    The national representative sample was analyzed to examine the relationship between respondents' drinking practice and the social network which was constructed of three different types of network: support network, drinking network, and intervening network. Non-parametric statistical analysis was conducted with chi square method and ANOVA analysis, due to the risk of small samples in some basic tabulation cells. The main results are as follows: (1) In the support network of workplace associates, moderate drinkers enjoyed much more sociable support care than both nondrinkers and hard drinkers, which might suggest a similar effect as the French paradox. Meanwhile in the familial and kinship network, the more intervening care support was provided, the harder respondents' drinking practice. (2) The drinking network among Japanese people for both sexes is likely to be convergent upon certain types of network categories and not decentralized in various categories. This might reflect of the drinking culture of Japan, which permits people to drink everyday as a practice, especially male drinkers. Subsequently, solitary drinking is not optional for female drinkers. (3) Intervening network analysis showed that the harder the respondents' drinking practices, the more frequently their drinking behaviors were checked in almost all the categories of network. A rather complicated gender double-standard was found in the network of hard drinkers with their friends, particularly for female drinkers. Medical professionals played a similar intervening role for men as family and kinship networks but to a less degree than friends for females. The social network is considerably associated with respondents' drinking, providing both sociability for moderate drinkers and intervention for hard drinkers, depending on network categories. To minimize the risk of hard drinking and advance self-healthy drinking there should be more research development on drinking practice and the social network.

  16. Network Performance Improvement under Epidemic Failures in Optical Transport Networks

    DEFF Research Database (Denmark)

    Fagertun, Anna Manolova; Ruepp, Sarah Renée

    2013-01-01

    In this paper we investigate epidemic failure spreading in large- scale GMPLS-controlled transport networks. By evaluating the effect of the epidemic failure spreading on the network, we design several strategies for cost-effective network performance improvement via differentiated repair times....... First we identify the most vulnerable and the most strategic nodes in the network. Then, via extensive simulations we show that strategic placement of resources for improved failure recovery has better performance than randomly assigning lower repair times among the network nodes. Our OPNET simulation...... model can be used during the network planning process for facilitating cost- effective network survivability design....

  17. Attachment and social networks.

    Science.gov (United States)

    Gillath, Omri; C Karantzas, Gery; Lee, Juwon

    2018-02-21

    The current review covers two lines of research linking attachment and social networks. One focuses on attachment networks (the people who fulfill one's attachment needs), examining composition and age-related differences pertaining to these networks. The other line integrates attachment with social network analysis to investigate how individual differences in adult attachment are associated with the management and characteristics (e.g., density, multiplexity, and centrality) of people's social networks. We show that most people's attachment networks are small and hierarchical, with one figure being the primary attachment figure (often a mother or romantic partner, depending on age). Furthermore, attachment style predicts network characteristics and management, such that insecurity is associated with less closeness, multiplexity, centrality, and poorer management (less maintenance, more dissolution). Copyright © 2018 Elsevier Ltd. All rights reserved.

  18. Individual Search and Social Networks

    OpenAIRE

    Sanjeev Goyal; Stephanie Rosenkranz; Utz Weitzel; Vincent Buskens

    2014-01-01

    The explosion in online social networks motivates an enquiry into their structure and their welfare effects. A central feature of these networks is information sharing: online social networks lower the cost of getting information from others. These lower costs affect the attractiveness of individual search vis-a-vis a reliance on social networks. The paper reports the findings of an experiment on these effects. Our experiment shows that online networks can have large effects. Information acqu...

  19. Privacy in social networking sites

    OpenAIRE

    Λεονάρδος, Γεώργιος; Leonardos, Giorgos

    2016-01-01

    The purpose of this study is to explore the aspects of privacy over the use of social networks web sites. More specific, we will show the types of social networks, their privacy mechanisms that are different in each social network site, their privacy options that are offered to users. We will report some serious privacy violations incidents of the most popular social networks sites such as Facebook, Twitter, LinkedIn. Also, we will report some important surveys about social networks and pr...

  20. Measuring political polarization: Twitter shows the two sides of Venezuela

    Science.gov (United States)

    Morales, A. J.; Borondo, J.; Losada, J. C.; Benito, R. M.

    2015-03-01

    We say that a population is perfectly polarized when divided in two groups of the same size and opposite opinions. In this paper, we propose a methodology to study and measure the emergence of polarization from social interactions. We begin by proposing a model to estimate opinions in which a minority of influential individuals propagate their opinions through a social network. The result of the model is an opinion probability density function. Next, we propose an index to quantify the extent to which the resulting distribution is polarized. Finally, we apply the proposed methodology to a Twitter conversation about the late Venezuelan president, Hugo Chávez, finding a good agreement between our results and offline data. Hence, we show that our methodology can detect different degrees of polarization, depending on the structure of the network.

  1. The network researchers' network

    DEFF Research Database (Denmark)

    Henneberg, Stephan C.; Jiang, Zhizhong; Naudé, Peter

    2009-01-01

    The Industrial Marketing and Purchasing (IMP) Group is a network of academic researchers working in the area of business-to-business marketing. The group meets every year to discuss and exchange ideas, with a conference having been held every year since 1984 (there was no meeting in 1987). In thi......The Industrial Marketing and Purchasing (IMP) Group is a network of academic researchers working in the area of business-to-business marketing. The group meets every year to discuss and exchange ideas, with a conference having been held every year since 1984 (there was no meeting in 1987......). In this paper, based upon the papers presented at the 22 conferences held to date, we undertake a Social Network Analysis in order to examine the degree of co-publishing that has taken place between this group of researchers. We identify the different components in this database, and examine the large main...

  2. Robustness of weighted networks

    Science.gov (United States)

    Bellingeri, Michele; Cassi, Davide

    2018-01-01

    Complex network response to node loss is a central question in different fields of network science because node failure can cause the fragmentation of the network, thus compromising the system functioning. Previous studies considered binary networks where the intensity (weight) of the links is not accounted for, i.e. a link is either present or absent. However, in real-world networks the weights of connections, and thus their importance for network functioning, can be widely different. Here, we analyzed the response of real-world and model networks to node loss accounting for link intensity and the weighted structure of the network. We used both classic binary node properties and network functioning measure, introduced a weighted rank for node importance (node strength), and used a measure for network functioning that accounts for the weight of the links (weighted efficiency). We find that: (i) the efficiency of the attack strategies changed using binary or weighted network functioning measures, both for real-world or model networks; (ii) in some cases, removing nodes according to weighted rank produced the highest damage when functioning was measured by the weighted efficiency; (iii) adopting weighted measure for the network damage changed the efficacy of the attack strategy with respect the binary analyses. Our results show that if the weighted structure of complex networks is not taken into account, this may produce misleading models to forecast the system response to node failure, i.e. consider binary links may not unveil the real damage induced in the system. Last, once weighted measures are introduced, in order to discover the best attack strategy, it is important to analyze the network response to node loss using nodes rank accounting the intensity of the links to the node.

  3. Modelling computer networks

    International Nuclear Information System (INIS)

    Max, G

    2011-01-01

    Traffic models in computer networks can be described as a complicated system. These systems show non-linear features and to simulate behaviours of these systems are also difficult. Before implementing network equipments users wants to know capability of their computer network. They do not want the servers to be overloaded during temporary traffic peaks when more requests arrive than the server is designed for. As a starting point for our study a non-linear system model of network traffic is established to exam behaviour of the network planned. The paper presents setting up a non-linear simulation model that helps us to observe dataflow problems of the networks. This simple model captures the relationship between the competing traffic and the input and output dataflow. In this paper, we also focus on measuring the bottleneck of the network, which was defined as the difference between the link capacity and the competing traffic volume on the link that limits end-to-end throughput. We validate the model using measurements on a working network. The results show that the initial model estimates well main behaviours and critical parameters of the network. Based on this study, we propose to develop a new algorithm, which experimentally determines and predict the available parameters of the network modelled.

  4. Symmetry in Complex Networks

    Directory of Open Access Journals (Sweden)

    Angel Garrido

    2011-01-01

    Full Text Available In this paper, we analyze a few interrelated concepts about graphs, such as their degree, entropy, or their symmetry/asymmetry levels. These concepts prove useful in the study of different types of Systems, and particularly, in the analysis of Complex Networks. A System can be defined as any set of components functioning together as a whole. A systemic point of view allows us to isolate a part of the world, and so, we can focus on those aspects that interact more closely than others. Network Science analyzes the interconnections among diverse networks from different domains: physics, engineering, biology, semantics, and so on. Current developments in the quantitative analysis of Complex Networks, based on graph theory, have been rapidly translated to studies of brain network organization. The brain's systems have complex network features—such as the small-world topology, highly connected hubs and modularity. These networks are not random. The topology of many different networks shows striking similarities, such as the scale-free structure, with the degree distribution following a Power Law. How can very different systems have the same underlying topological features? Modeling and characterizing these networks, looking for their governing laws, are the current lines of research. So, we will dedicate this Special Issue paper to show measures of symmetry in Complex Networks, and highlight their close relation with measures of information and entropy.

  5. Maximum entropy networks are more controllable than preferential attachment networks

    International Nuclear Information System (INIS)

    Hou, Lvlin; Small, Michael; Lao, Songyang

    2014-01-01

    A maximum entropy (ME) method to generate typical scale-free networks has been recently introduced. We investigate the controllability of ME networks and Barabási–Albert preferential attachment networks. Our experimental results show that ME networks are significantly more easily controlled than BA networks of the same size and the same degree distribution. Moreover, the control profiles are used to provide insight into control properties of both classes of network. We identify and classify the driver nodes and analyze the connectivity of their neighbors. We find that driver nodes in ME networks have fewer mutual neighbors and that their neighbors have lower average degree. We conclude that the properties of the neighbors of driver node sensitively affect the network controllability. Hence, subtle and important structural differences exist between BA networks and typical scale-free networks of the same degree distribution. - Highlights: • The controllability of maximum entropy (ME) and Barabási–Albert (BA) networks is investigated. • ME networks are significantly more easily controlled than BA networks of the same degree distribution. • The properties of the neighbors of driver node sensitively affect the network controllability. • Subtle and important structural differences exist between BA networks and typical scale-free networks

  6. Exploring network organization in practice

    DEFF Research Database (Denmark)

    Hu, Yimei; Sørensen, Olav Jull

    Constructing a network organization for global R&D is presented as a common sense practice in existing literature. However, there are still queries about the network organization, such as the persistence of hierarchies which make a network organization merely a “bureaucracy-lite” organization....... Furthermore, in practice, we rarely see radical organizational change towards a network organization that adopts an internal market. The co-existence of market, hierarchy and network triggered research interest. A multiple case study of three transnational corporations’ global R&D organization shows...... that there are different logical considerations when designing a network organization to facilitate innovation. I identify three types of network organizations: market-led, directed and culture-led network organizations. Different types of network organizations show that organizations are dual and even ternary systems...

  7. Weaponizing Wireless Networks

    DEFF Research Database (Denmark)

    Giannetsos, Athanasios; Tassos, Dimitriou; Prasad, Neeli R.

    2010-01-01

    of a sensor network. Results show that our tool can be flexibly applied to different sensor network operating systems and protocol stacks giving an adversary privileges to which she is not entitled to. We hope that our tool will be used proactively, to study the weaknesses of new security protocols, and......, hopefully, to enhance the level of security provided by these solutions even further....

  8. Building the quantum network

    International Nuclear Information System (INIS)

    Elliott, Chip

    2002-01-01

    We show how quantum key distribution (QKD) techniques can be employed within realistic, highly secure communications systems, using the internet architecture for a specific example. We also discuss how certain drawbacks in existing QKD point-to-point links can be mitigated by building QKD networks, where such networks can be composed of trusted relays or untrusted photonic switches. (author)

  9. Software Defined Coded Networking

    DEFF Research Database (Denmark)

    Di Paola, Carla; Roetter, Daniel Enrique Lucani; Palazzo, Sergio

    2017-01-01

    the quality of each link and even across neighbouring links and using simulations to show that an additional reduction of packet transmission in the order of 40% is possible. Second, to advocate for the use of network coding (NC) jointly with software defined networking (SDN) providing an implementation...

  10. UV Photography Shows Hidden Sun Damage

    Science.gov (United States)

    ... mcat1=de12", ]; for (var c = 0; c UV photography shows hidden sun damage A UV photograph gives ... developing skin cancer and prematurely aged skin. Normal photography UV photography 18 months of age: This boy's ...

  11. Telecommunication networks

    CERN Document Server

    Iannone, Eugenio

    2011-01-01

    Many argue that telecommunications network infrastructure is the most impressive and important technology ever developed. Analyzing the telecom market's constantly evolving trends, research directions, infrastructure, and vital needs, Telecommunication Networks responds with revolutionized engineering strategies to optimize network construction. Omnipresent in society, telecom networks integrate a wide range of technologies. These include quantum field theory for the study of optical amplifiers, software architectures for network control, abstract algebra required to design error correction co

  12. Tunable Sparse Network Coding for Multicast Networks

    DEFF Research Database (Denmark)

    Feizi, Soheil; Roetter, Daniel Enrique Lucani; Sørensen, Chres Wiant

    2014-01-01

    This paper shows the potential and key enabling mechanisms for tunable sparse network coding, a scheme in which the density of network coded packets varies during a transmission session. At the beginning of a transmission session, sparsely coded packets are transmitted, which benefits decoding...... complexity. At the end of a transmission, when receivers have accumulated degrees of freedom, coding density is increased. We propose a family of tunable sparse network codes (TSNCs) for multicast erasure networks with a controllable trade-off between completion time performance to decoding complexity...... a mechanism to perform efficient Gaussian elimination over sparse matrices going beyond belief propagation but maintaining low decoding complexity. Supporting simulation results are provided showing the trade-off between decoding complexity and completion time....

  13. Quantitative Efficiency Evaluation Method for Transportation Networks

    Directory of Open Access Journals (Sweden)

    Jin Qin

    2014-11-01

    Full Text Available An effective evaluation of transportation network efficiency/performance is essential to the establishment of sustainable development in any transportation system. Based on a redefinition of transportation network efficiency, a quantitative efficiency evaluation method for transportation network is proposed, which could reflect the effects of network structure, traffic demands, travel choice, and travel costs on network efficiency. Furthermore, the efficiency-oriented importance measure for network components is presented, which can be used to help engineers identify the critical nodes and links in the network. The numerical examples show that, compared with existing efficiency evaluation methods, the network efficiency value calculated by the method proposed in this paper can portray the real operation situation of the transportation network as well as the effects of main factors on network efficiency. We also find that the network efficiency and the importance values of the network components both are functions of demands and network structure in the transportation network.

  14. Local dependency in networks

    Directory of Open Access Journals (Sweden)

    Kudĕlka Miloš

    2015-06-01

    Full Text Available Many real world data and processes have a network structure and can usefully be represented as graphs. Network analysis focuses on the relations among the nodes exploring the properties of each network. We introduce a method for measuring the strength of the relationship between two nodes of a network and for their ranking. This method is applicable to all kinds of networks, including directed and weighted networks. The approach extracts dependency relations among the network’s nodes from the structure in local surroundings of individual nodes. For the tasks we deal with in this article, the key technical parameter is locality. Since only the surroundings of the examined nodes are used in computations, there is no need to analyze the entire network. This allows the application of our approach in the area of large-scale networks. We present several experiments using small networks as well as large-scale artificial and real world networks. The results of the experiments show high effectiveness due to the locality of our approach and also high quality node ranking comparable to PageRank.

  15. Multilayer Brain Networks

    Science.gov (United States)

    Vaiana, Michael; Muldoon, Sarah Feldt

    2018-01-01

    The field of neuroscience is facing an unprecedented expanse in the volume and diversity of available data. Traditionally, network models have provided key insights into the structure and function of the brain. With the advent of big data in neuroscience, both more sophisticated models capable of characterizing the increasing complexity of the data and novel methods of quantitative analysis are needed. Recently, multilayer networks, a mathematical extension of traditional networks, have gained increasing popularity in neuroscience due to their ability to capture the full information of multi-model, multi-scale, spatiotemporal data sets. Here, we review multilayer networks and their applications in neuroscience, showing how incorporating the multilayer framework into network neuroscience analysis has uncovered previously hidden features of brain networks. We specifically highlight the use of multilayer networks to model disease, structure-function relationships, network evolution, and link multi-scale data. Finally, we close with a discussion of promising new directions of multilayer network neuroscience research and propose a modified definition of multilayer networks designed to unite and clarify the use of the multilayer formalism in describing real-world systems.

  16. Cellular phone network and health: a pilot study. Design and first results; Mobilfunk und Befinden - eine Pilotstudie. Design und erste Ergebnisse

    Energy Technology Data Exchange (ETDEWEB)

    Spegel, H.; Meyer, N.; Ehrenstein, V.; Heinrich, S.; Schulze, A.; Klein, J.; Praml, G.; Nowak, D.; Radon, K. [Inst. und Poliklinik fuer Arbeits- und Umweltmedizin der Ludwig-Maximilians-Univ., Arbeitsgruppe Arbeits- und Umweltepidemiologie und NetTeaching, Muenchen (Germany); Brix, J. [Bayerisches Staatsministerium fuer Umwelt, Gesundheit und Verbraucherschutz, Muenchen (Germany); Kries, R. von [Inst. fuer Sozialpaediatrie und Jugendmedizin, der Ludwig-Maximilians-Univ., Muenchen (Germany)

    2006-07-01

    Background: we designed a cross-sectional population-based pilot study of possible acute health effects of cellular phone networks. We aimed to examine feasibility of such a study in the field and to assess adequacy of personal dosimetry. Methods: using personal dosimeters, we obtained a 24-hour exposure profile for each study participant. Exposure to frequencies within the mobile communication range (D-net, E-net, universal mobile telecommunications system (UMTS), and wireless local area networks (WLAN)) was measured and recorded every second. Simultaneously we used computer assisted personal interview (CAPI) to collect data on participants' symptoms, socio-demographic characteristics, and potential confounders. The initial results are now available for 42 children (ages 8-12 years), 57 adolescents (ages 13-17 years), and 64 adults (ages 18-65 years), all of them residents of Munich, Germany. Results: personal dosimetry proved to be an adequate and well accepted instrument for the use in the field. The duration of the cumulative exposure to all frequencies in excess of 0.1 V/m ranged from 0.1 to 96.5% of the 24-hour period, and the median daily duration across all age groups was 4.1%. The exposure was dominated by frequencies in the D-net range. Fatigue was the most prevalent symptom, reported by 47% of the children and adolescents and by 44% of the adults. Conclusions: this pilot study shows that both design and the questionnaire instrument are adequate for use in epidemiologic studies of association between exposure to high-frequency electromagnetic fields and health. Personal dosimeters have been optimised and fine-tuned through continuous use. The association between the exposure and health can now be further assessed in a dedicated study. (orig.)

  17. Macroecology of pollination networks

    DEFF Research Database (Denmark)

    Nielsen, Kristian Trøjelsgaard; Olesen, Jens Mogens

    2013-01-01

    towards the tropics, and that network topology would be affected by current climate. Location Global. Methods Each network was organized as a presence/absence matrix, consisting of P plant species, A pollinator species and their links. From these matrices, network parameters were estimated. Additionally...... with either latitude or elevation. However, network modularity decreased significantly with latitude whereas mean number of links per plant species (Lp) and A/P ratio peaked at mid-latitude. Above 500 m a.s.l., A/P ratio decreased and mean number of links per pollinator species (La) increased with elevation......Aim Interacting communities of species are organized into complex networks, and network analysis is reckoned to be a strong tool for describing their architecture. Many species assemblies show strong macroecological patterns, e.g. increasing species richness with decreasing latitude, but whether...

  18. Educational Outreach: The Space Science Road Show

    Science.gov (United States)

    Cox, N. L. J.

    2002-01-01

    The poster presented will give an overview of a study towards a "Space Road Show". The topic of this show is space science. The target group is adolescents, aged 12 to 15, at Dutch high schools. The show and its accompanying experiments would be supported with suitable educational material. Science teachers at schools can decide for themselves if they want to use this material in advance, afterwards or not at all. The aims of this outreach effort are: to motivate students for space science and engineering, to help them understand the importance of (space) research, to give them a positive feeling about the possibilities offered by space and in the process give them useful knowledge on space basics. The show revolves around three main themes: applications, science and society. First the students will get some historical background on the importance of space/astronomy to civilization. Secondly they will learn more about novel uses of space. On the one hand they will learn of "Views on Earth" involving technologies like Remote Sensing (or Spying), Communication, Broadcasting, GPS and Telemedicine. On the other hand they will experience "Views on Space" illustrated by past, present and future space research missions, like the space exploration missions (Cassini/Huygens, Mars Express and Rosetta) and the astronomy missions (Soho and XMM). Meanwhile, the students will learn more about the technology of launchers and satellites needed to accomplish these space missions. Throughout the show and especially towards the end attention will be paid to the third theme "Why go to space"? Other reasons for people to get into space will be explored. An important question in this is the commercial (manned) exploration of space. Thus, the questions of benefit of space to society are integrated in the entire show. It raises some fundamental questions about the effects of space travel on our environment, poverty and other moral issues. The show attempts to connect scientific with

  19. 2008 LHC Open Days Physics: the show

    CERN Multimedia

    2008-01-01

    A host of events and activities await visitors to the LHC Open Days on 5 and 6 April. A highlight will be the physics shows funded by the European Physical Society (EPS), which are set to surprise and challenge children and adults alike! School children use their experience of riding a bicycle to understand how planets move around the sun (Copyright : Circus Naturally) Participating in the Circus Naturally show could leave a strange taste in your mouth! (Copyright : Circus Naturally) The Rino Foundation’s experiments with liquid nitrogen can be pretty exciting! (Copyright: The Rino Foundation)What does a bicycle have in common with the solar system? Have you ever tried to weigh air or visualise sound? Ever heard of a vacuum bazooka? If you want to discover the answers to these questions and more then come to the Physics Shows taking place at the CERN O...

  20. Online Italian fandoms of American TV shows

    Directory of Open Access Journals (Sweden)

    Eleonora Benecchi

    2015-06-01

    Full Text Available The Internet has changed media fandom in two main ways: it helps fans connect with each other despite physical distance, leading to the formation of international fan communities; and it helps fans connect with the creators of the TV show, deepening the relationship between TV producers and international fandoms. To assess whether Italian fan communities active online are indeed part of transnational online communities and whether the Internet has actually altered their relationship with the creators of the original text they are devoted to, qualitative analysis and narrative interviews of 26 Italian fans of American TV shows were conducted to explore the fan-producer relationship. Results indicated that the online Italian fans surveyed preferred to stay local, rather than using geography-leveling online tools. Further, the sampled Italian fans' relationships with the show runners were mediated or even absent.

  1. Temporal networks

    CERN Document Server

    Saramäki, Jari

    2013-01-01

    The concept of temporal networks is an extension of complex networks as a modeling framework to include information on when interactions between nodes happen. Many studies of the last decade examine how the static network structure affect dynamic systems on the network. In this traditional approach  the temporal aspects are pre-encoded in the dynamic system model. Temporal-network methods, on the other hand, lift the temporal information from the level of system dynamics to the mathematical representation of the contact network itself. This framework becomes particularly useful for cases where there is a lot of structure and heterogeneity both in the timings of interaction events and the network topology. The advantage compared to common static network approaches is the ability to design more accurate models in order to explain and predict large-scale dynamic phenomena (such as, e.g., epidemic outbreaks and other spreading phenomena). On the other hand, temporal network methods are mathematically and concept...

  2. Interconnected networks

    CERN Document Server

    2016-01-01

    This volume provides an introduction to and overview of the emerging field of interconnected networks which include multi layer or multiplex networks, as well as networks of networks. Such networks present structural and dynamical features quite different from those observed in isolated networks. The presence of links between different networks or layers of a network typically alters the way such interconnected networks behave – understanding the role of interconnecting links is therefore a crucial step towards a more accurate description of real-world systems. While examples of such dissimilar properties are becoming more abundant – for example regarding diffusion, robustness and competition – the root of such differences remains to be elucidated. Each chapter in this topical collection is self-contained and can be read on its own, thus making it also suitable as reference for experienced researchers wishing to focus on a particular topic.

  3. Duchenne muscular dystrophy models show their age

    OpenAIRE

    Chamberlain, Jeffrey S.

    2010-01-01

    The lack of appropriate animal models has hampered efforts to develop therapies for Duchenne muscular dystrophy (DMD). A new mouse model lacking both dystrophin and telomerase (Sacco et al., 2010) closely mimics the pathological progression of human DMD and shows that muscle stem cell activity is a key determinant of disease severity.

  4. Show Them You Really Want the Job

    Science.gov (United States)

    Perlmutter, David D.

    2012-01-01

    Showing that one really "wants" the job entails more than just really wanting the job. An interview is part Broadway casting call, part intellectual dating game, part personality test, and part, well, job interview. When there are 300 applicants for a position, many of them will "fit" the required (and even the preferred) skills listed in the job…

  5. A Talk Show from the Past.

    Science.gov (United States)

    Gallagher, Arlene F.

    1991-01-01

    Describes a two-day activity in which elementary students examine voting rights, the right to assemble, and women's suffrage. Explains the game, "Assemble, Reassemble," and a student-produced talk show with five students playing the roles of leaders of the women's suffrage movement. Profiles Elizabeth Cady Stanton, Lucretia Mott, Susan…

  6. Laser entertainment and light shows in education

    Science.gov (United States)

    Sabaratnam, Andrew T.; Symons, Charles

    2002-05-01

    Laser shows and beam effects have been a source of entertainment since its first public performance May 9, 1969, at Mills College in Oakland, California. Since 1997, the Photonics Center, NgeeAnn Polytechnic, Singapore, has been using laser shows as a teaching tool. Students are able to exhibit their creative skills and learn at the same time how lasers are used in the entertainment industry. Students will acquire a number of skills including handling three- phase power supply, operation of cooling system, and laser alignment. Students also acquire an appreciation of the arts, learning about shapes and contours as they develop graphics for the shows. After holography, laser show animation provides a combination of the arts and technology. This paper aims to briefly describe how a krypton-argon laser, galvanometer scanners, a polychromatic acousto-optic modulator and related electronics are put together to develop a laser projector. The paper also describes how students are trained to make their own laser animation and beam effects with music, and at the same time have an appreciation of the operation of a Class IV laser and the handling of optical components.

  7. The Last Great American Picture Show

    NARCIS (Netherlands)

    Elsaesser, Thomas; King, Noel; Horwath, Alexander

    2004-01-01

    The Last Great American Picture Show brings together essays by scholars and writers who chart the changing evaluations of the American cinema of the 1970s, sometimes referred to as the decade of the lost generation, but now more and more recognized as the first New Hollywood, without which the

  8. Gradient networks on uncorrelated random scale-free networks

    International Nuclear Information System (INIS)

    Pan Guijun; Yan Xiaoqing; Huang Zhongbing; Ma Weichuan

    2011-01-01

    Uncorrelated random scale-free (URSF) networks are useful null models for checking the effects of scale-free topology on network-based dynamical processes. Here, we present a comparative study of the jamming level of gradient networks based on URSF networks and Erdos-Renyi (ER) random networks. We find that the URSF networks are less congested than ER random networks for the average degree (k)>k c (k c ∼ 2 denotes a critical connectivity). In addition, by investigating the topological properties of the two kinds of gradient networks, we discuss the relations between the topological structure and the transport efficiency of the gradient networks. These findings show that the uncorrelated scale-free structure might allow more efficient transport than the random structure.

  9. Spectral Analysis of Rich Network Topology in Social Networks

    Science.gov (United States)

    Wu, Leting

    2013-01-01

    Social networks have received much attention these days. Researchers have developed different methods to study the structure and characteristics of the network topology. Our focus is on spectral analysis of the adjacency matrix of the underlying network. Recent work showed good properties in the adjacency spectral space but there are few…

  10. Optical packet switched networks

    DEFF Research Database (Denmark)

    Hansen, Peter Bukhave

    1999-01-01

    Optical packet switched networks are investigated with emphasis on the performance of the packet switch blocks. Initially, the network context of the optical packet switched network is described showing that a packet network will provide transparency, flexibility and bridge the granularity gap...... in interferometric wavelength converters is investigated showing that a 10 Gbit/s 19 4x4 swich blocks can be cascaded at a BER of 10-14. An analytical traffic model enables the calculation of the traffice performance of a WDM packet network. Hereby the importance of WDM and wavelegth conversion in the switch blocks...... is established as a flexible means to reduce the optical buffer, e.g., the number of fibre delay lines for a 16x16 switch block is reduced from 23 to 6 by going from 2 to 8 wavelength channels pr. inlet. Additionally, a component count analysis is carried out to illustrate the trade-offs in the switch block...

  11. Network maintenance

    CERN Multimedia

    GS Department

    2009-01-01

    A site-wide network maintenance operation has been scheduled for Saturday 28 February. Most of the network devices of the general purpose network will be upgraded to a newer software version, in order to improve our network monitoring capabilities. This will result in a series of short (2-5 minutes) random interruptions everywhere on the CERN sites throughout the day. This upgrade will not affect the Computer Centre itself, Building 613, the Technical Network and the LHC experiments, dedicated networks at the pits. For further details of this intervention, please contact Netops by phone 74927 or e-mail mailto:Netops@cern.ch. IT/CS Group

  12. Network maintenance

    CERN Multimedia

    IT Department

    2009-01-01

    A site wide network maintenance has been scheduled for Saturday 28 February. Most of the network devices of the General Purpose network will be upgraded to a newer software version, in order to improve our network monitoring capabilities. This will result in a series of short (2-5 minutes) random interruptions everywhere on the CERN sites along this day. This upgrade will not affect: the Computer centre itself, building 613, the Technical Network and the LHC experiments dedicated networks at the pits. Should you need more details on this intervention, please contact Netops by phone 74927 or email mailto:Netops@cern.ch. IT/CS Group

  13. Reality, ficción o show

    Directory of Open Access Journals (Sweden)

    Sandra Ruíz Moreno

    2002-01-01

    Full Text Available Para tener un punto de vista claro y objetivo frente a la polémica establecida en torno al programa “Protagonistas de novela” y la tendiente proliferación de los reality show en las parrillas de programación de la televisión colombiana, se realizó un análisis de texto y contenido de dicho programa, intentando definirlo desde sus posibilidades de realidad, ficción y show. Las unidades de análisis y el estudio de su tratamiento arrojaron un alto contenido que gira en torno a las emociones del ser humano relacionadas con la convivencia, tratadas a manera de show y con algunos aportes textuales de ficción, pero sin su elemento mediador básico, el actor, quitándole toda la posibilidad de tener un tratamiento con la profundidad, distancia y ética que requieren los temas de esta índole. El resultado es un formato que sólo busca altos índices de sintonía y que pertenece más a la denominada televisión “trash”, que a una búsqueda de realidad del hombre y mucho menos de sociedad.

  14. Communication in Animal Social Networks

    NARCIS (Netherlands)

    Snijders, Lysanne; Naguib, Marc

    2017-01-01

    Animal social networks and animal communication networks are key disciplines for understanding animal social behavior, yet these disciplines remain poorly integrated. In this review, we show how communication and social networks are inherently linked, with social signals reflecting and affecting

  15. "Homeless Networks: Testing Peer and Homed Networks Against Location Choice"

    OpenAIRE

    Shinichiro Iwata; Koji Karato

    2007-01-01

    This paper examines the location choices of homeless people in Osaka City, and finds them concentrated because of homeless networks. The paper also shows that different types of homeless networks operate in two different homeless groups: (1) peer networks that provide a social tie inside homeless communities are observed in groups that had not had work experience in the day labor market; (2) homed networks that provide a social tie outside homeless communities affect location choice in the ex...

  16. Network Ambivalence

    Directory of Open Access Journals (Sweden)

    Patrick Jagoda

    2015-08-01

    Full Text Available The language of networks now describes everything from the Internet to the economy to terrorist organizations. In distinction to a common view of networks as a universal, originary, or necessary form that promises to explain everything from neural structures to online traffic, this essay emphasizes the contingency of the network imaginary. Network form, in its role as our current cultural dominant, makes scarcely imaginable the possibility of an alternative or an outside uninflected by networks. If so many things and relationships are figured as networks, however, then what is not a network? If a network points towards particular logics and qualities of relation in our historical present, what others might we envision in the future? In  many ways, these questions are unanswerable from within the contemporary moment. Instead of seeking an avant-garde approach (to move beyond networks or opting out of networks (in some cases, to recover elements of pre-networked existence, this essay proposes a third orientation: one of ambivalence that operates as a mode of extreme presence. I propose the concept of "network aesthetics," which can be tracked across artistic media and cultural forms, as a model, style, and pedagogy for approaching interconnection in the twenty-first century. The following essay is excerpted from Network Ambivalence (Forthcoming from University of Chicago Press. 

  17. Network workshop

    DEFF Research Database (Denmark)

    Bruun, Jesper; Evans, Robert Harry

    2014-01-01

    This paper describes the background for, realisation of and author reflections on a network workshop held at ESERA2013. As a new research area in science education, networks offer a unique opportunity to visualise and find patterns and relationships in complicated social or academic network data....... These include student relations and interactions and epistemic and linguistic networks of words, concepts and actions. Network methodology has already found use in science education research. However, while networks hold the potential for new insights, they have not yet found wide use in the science education...... research community. With this workshop, participants were offered a way into network science based on authentic educational research data. The workshop was constructed as an inquiry lesson with emphasis on user autonomy. Learning activities had participants choose to work with one of two cases of networks...

  18. Network Convergence

    Indian Academy of Sciences (India)

    First page Back Continue Last page Overview Graphics. Network Convergence. User is interested in application and content - not technical means of distribution. Boundaries between distribution channels fade out. Network convergence leads to seamless application and content solutions.

  19. Industrial Networks

    DEFF Research Database (Denmark)

    Karlsson, Christer

    2015-01-01

    Companies organize in a way that involves many activities that are external to the traditional organizational boundaries. This presents challenges to operations management and managing operations involves many issues and actions dealing with external networks. Taking a network perspective changes...

  20. Network Science

    National Research Council Canada - National Science Library

    Leland, Will

    2006-01-01

    OVERVIEW: (1) A committee of technical experts, military officers and R&D managers was assembled by the National Research Council to reach consensus on the nature of networks and network research. (2...

  1. Myopes show increased susceptibility to nearwork aftereffects.

    Science.gov (United States)

    Ciuffreda, K J; Wallis, D M

    1998-09-01

    Some aspects of accommodation may be slightly abnormal (or different) in myopes, compared with accommodation in emmetropes and hyperopes. For example, the initial magnitude of accommodative adaptation in the dark after nearwork is greatest in myopes. However, the critical test is to assess this initial accommodative aftereffect and its subsequent decay in the light under more natural viewing conditions with blur-related visual feedback present, if a possible link between this phenomenon and clinical myopia is to be considered. Subjects consisted of adult late- (n = 11) and early-onset (n = 13) myopes, emmetropes (n = 11), and hyperopes (n = 9). The distance-refractive state was assessed objectively using an autorefractor immediately before and after a 10-minute binocular near task at 20 cm (5 diopters [D]). Group results showed that myopes were most susceptible to the nearwork aftereffect. It averaged 0.35 D in initial magnitude, with considerably faster posttask decay to baseline in the early-onset (35 seconds) versus late-onset (63 seconds) myopes. There was no myopic aftereffect in the remaining two refractive groups. The myopes showed particularly striking accommodatively related nearwork aftereffect susceptibility. As has been speculated and found by many others, transient pseudomyopia may cause or be a precursor to permanent myopia or myopic progression. Time-integrated increased retinal defocus causing axial elongation is proposed as a possible mechanism.

  2. Molecular ecological network analyses.

    Science.gov (United States)

    Deng, Ye; Jiang, Yi-Huei; Yang, Yunfeng; He, Zhili; Luo, Feng; Zhou, Jizhong

    2012-05-30

    Understanding the interaction among different species within a community and their responses to environmental changes is a central goal in ecology. However, defining the network structure in a microbial community is very challenging due to their extremely high diversity and as-yet uncultivated status. Although recent advance of metagenomic technologies, such as high throughout sequencing and functional gene arrays, provide revolutionary tools for analyzing microbial community structure, it is still difficult to examine network interactions in a microbial community based on high-throughput metagenomics data. Here, we describe a novel mathematical and bioinformatics framework to construct ecological association networks named molecular ecological networks (MENs) through Random Matrix Theory (RMT)-based methods. Compared to other network construction methods, this approach is remarkable in that the network is automatically defined and robust to noise, thus providing excellent solutions to several common issues associated with high-throughput metagenomics data. We applied it to determine the network structure of microbial communities subjected to long-term experimental warming based on pyrosequencing data of 16 S rRNA genes. We showed that the constructed MENs under both warming and unwarming conditions exhibited topological features of scale free, small world and modularity, which were consistent with previously described molecular ecological networks. Eigengene analysis indicated that the eigengenes represented the module profiles relatively well. In consistency with many other studies, several major environmental traits including temperature and soil pH were found to be important in determining network interactions in the microbial communities examined. To facilitate its application by the scientific community, all these methods and statistical tools have been integrated into a comprehensive Molecular Ecological Network Analysis Pipeline (MENAP), which is open

  3. NASA Integrated Network COOP

    Science.gov (United States)

    Anderson, Michael L.; Wright, Nathaniel; Tai, Wallace

    2012-01-01

    Natural disasters, terrorist attacks, civil unrest, and other events have the potential of disrupting mission-essential operations in any space communications network. NASA's Space Communications and Navigation office (SCaN) is in the process of studying options for integrating the three existing NASA network elements, the Deep Space Network, the Near Earth Network, and the Space Network, into a single integrated network with common services and interfaces. The need to maintain Continuity of Operations (COOP) after a disastrous event has a direct impact on the future network design and operations concepts. The SCaN Integrated Network will provide support to a variety of user missions. The missions have diverse requirements and include anything from earth based platforms to planetary missions and rovers. It is presumed that an integrated network, with common interfaces and processes, provides an inherent advantage to COOP in that multiple elements and networks can provide cross-support in a seamless manner. The results of trade studies support this assumption but also show that centralization as a means of achieving integration can result in single points of failure that must be mitigated. The cost to provide this mitigation can be substantial. In support of this effort, the team evaluated the current approaches to COOP, developed multiple potential approaches to COOP in a future integrated network, evaluated the interdependencies of the various approaches to the various network control and operations options, and did a best value assessment of the options. The paper will describe the trade space, the study methods, and results of the study.

  4. Network Coded Software Defined Networking

    DEFF Research Database (Denmark)

    Krigslund, Jeppe; Hansen, Jonas; Roetter, Daniel Enrique Lucani

    2015-01-01

    Software Defined Networking (SDN) and Network Coding (NC) are two key concepts in networking that have garnered a large attention in recent years. On the one hand, SDN's potential to virtualize services in the Internet allows a large flexibility not only for routing data, but also to manage....... This paper advocates for the use of SDN to bring about future Internet and 5G network services by incorporating network coding (NC) functionalities. The inherent flexibility of both SDN and NC provides a fertile ground to envision more efficient, robust, and secure networking designs, that may also...

  5. Scheduling Maintenance Jobs in Networks

    OpenAIRE

    Abed, Fidaa; Chen, Lin; Disser, Yann; Groß, Martin; Megow, Nicole; Meißner, Julie; Richter, Alexander T.; Rischke, Roman

    2017-01-01

    We investigate the problem of scheduling the maintenance of edges in a network, motivated by the goal of minimizing outages in transportation or telecommunication networks. We focus on maintaining connectivity between two nodes over time; for the special case of path networks, this is related to the problem of minimizing the busy time of machines. We show that the problem can be solved in polynomial time in arbitrary networks if preemption is allowed. If preemption is restricted to integral t...

  6. Network Simulation

    CERN Document Server

    Fujimoto, Richard

    2006-01-01

    "Network Simulation" presents a detailed introduction to the design, implementation, and use of network simulation tools. Discussion topics include the requirements and issues faced for simulator design and use in wired networks, wireless networks, distributed simulation environments, and fluid model abstractions. Several existing simulations are given as examples, with details regarding design decisions and why those decisions were made. Issues regarding performance and scalability are discussed in detail, describing how one can utilize distributed simulation methods to increase the

  7. Asynchronous networks: modularization of dynamics theorem

    Science.gov (United States)

    Bick, Christian; Field, Michael

    2017-02-01

    Building on the first part of this paper, we develop the theory of functional asynchronous networks. We show that a large class of functional asynchronous networks can be (uniquely) represented as feedforward networks connecting events or dynamical modules. For these networks we can give a complete description of the network function in terms of the function of the events comprising the network: the modularization of dynamics theorem. We give examples to illustrate the main results.

  8. Network class superposition analyses.

    Directory of Open Access Journals (Sweden)

    Carl A B Pearson

    Full Text Available Networks are often used to understand a whole system by modeling the interactions among its pieces. Examples include biomolecules in a cell interacting to provide some primary function, or species in an environment forming a stable community. However, these interactions are often unknown; instead, the pieces' dynamic states are known, and network structure must be inferred. Because observed function may be explained by many different networks (e.g., ≈ 10(30 for the yeast cell cycle process, considering dynamics beyond this primary function means picking a single network or suitable sample: measuring over all networks exhibiting the primary function is computationally infeasible. We circumvent that obstacle by calculating the network class ensemble. We represent the ensemble by a stochastic matrix T, which is a transition-by-transition superposition of the system dynamics for each member of the class. We present concrete results for T derived from boolean time series dynamics on networks obeying the Strong Inhibition rule, by applying T to several traditional questions about network dynamics. We show that the distribution of the number of point attractors can be accurately estimated with T. We show how to generate Derrida plots based on T. We show that T-based Shannon entropy outperforms other methods at selecting experiments to further narrow the network structure. We also outline an experimental test of predictions based on T. We motivate all of these results in terms of a popular molecular biology boolean network model for the yeast cell cycle, but the methods and analyses we introduce are general. We conclude with open questions for T, for example, application to other models, computational considerations when scaling up to larger systems, and other potential analyses.

  9. Ancient bacteria show evidence of DNA repair

    DEFF Research Database (Denmark)

    Johnson, Sarah Stewart; Hebsgaard, Martin B; Christensen, Torben R

    2007-01-01

    -term survival of bacteria sealed in frozen conditions for up to one million years. Our results show evidence of bacterial survival in samples up to half a million years in age, making this the oldest independently authenticated DNA to date obtained from viable cells. Additionally, we find strong evidence...... geological timescales. There has been no direct evidence in ancient microbes for the most likely mechanism, active DNA repair, or for the metabolic activity necessary to sustain it. In this paper, we couple PCR and enzymatic treatment of DNA with direct respiration measurements to investigate long...... that this long-term survival is closely tied to cellular metabolic activity and DNA repair that over time proves to be superior to dormancy as a mechanism in sustaining bacteria viability....

  10. Microbiological and environmental issues in show caves.

    Science.gov (United States)

    Saiz-Jimenez, Cesareo

    2012-07-01

    Cultural tourism expanded in the last half of the twentieth century, and the interest of visitors has come to include caves containing archaeological remains. Some show caves attracted mass tourism, and economical interests prevailed over conservation, which led to a deterioration of the subterranean environment and the rock art. The presence and the role of microorganisms in caves is a topic that is often ignored in cave management. Knowledge of the colonisation patterns, the dispersion mechanisms, and the effect on human health and, when present, over rock art paintings of these microorganisms is of the utmost importance. In this review the most recent advances in the study of microorganisms in caves are presented, together with the environmental implications of the findings.

  11. Deterministic bound for avionics switched networks according to networking features using network calculus

    Directory of Open Access Journals (Sweden)

    Feng HE

    2017-12-01

    Full Text Available The state of the art avionics system adopts switched networks for airborne communications. A major concern in the design of the networks is the end-to-end guarantee ability. Analytic methods have been developed to compute the worst-case delays according to the detailed configurations of flows and networks within avionics context, such as network calculus and trajectory approach. It still lacks a relevant method to make a rapid performance estimation according to some typically switched networking features, such as networking scale, bandwidth utilization and average flow rate. The goal of this paper is to establish a deterministic upper bound analysis method by using these networking features instead of the complete network configurations. Two deterministic upper bounds are proposed from network calculus perspective: one is for a basic estimation, and another just shows the benefits from grouping strategy. Besides, a mathematic expression for grouping ability is established based on the concept of network connecting degree, which illustrates the possibly minimal grouping benefit. For a fully connected network with 4 switches and 12 end systems, the grouping ability coming from grouping strategy is 15–20%, which just coincides with the statistical data (18–22% from the actual grouping advantage. Compared with the complete network calculus analysis method for individual flows, the effectiveness of the two deterministic upper bounds is no less than 38% even with remarkably varied packet lengths. Finally, the paper illustrates the design process for an industrial Avionics Full DupleX switched Ethernet (AFDX networking case according to the two deterministic upper bounds and shows that a better control for network connecting, when designing a switched network, can improve the worst-case delays dramatically. Keywords: Deterministic bound, Grouping ability, Network calculus, Networking features, Switched networks

  12. Technical Network

    CERN Multimedia

    2007-01-01

    In order to optimise the management of the Technical Network (TN), to facilitate understanding of the purpose of devices connected to the TN and to improve security incident handling, the Technical Network Administrators and the CNIC WG have asked IT/CS to verify the "description" and "tag" fields of devices connected to the TN. Therefore, persons responsible for systems connected to the TN will receive e-mails from IT/CS asking them to add the corresponding information in the network database at "network-cern-ch". Thank you very much for your cooperation. The Technical Network Administrators & the CNIC WG

  13. Network ties and survival

    DEFF Research Database (Denmark)

    Acheampong, George; Narteh, Bedman; Rand, John

    2017-01-01

    Poultry farming has been touted as one of the major ways by which poverty can be reduced in low-income economies like Ghana. Yet, anecdotally there is a high failure rate among these poultry farms. This current study seeks to understand the relationship between network ties and survival chances...... of small commercial poultry farms (SCPFs). We utilize data from a 2-year network survey of SCPFs in rural Ghana. The survival of these poultry farms are modelled using a lagged probit model of farms that persisted from 2014 into 2015. We find that network ties are important to the survival chances...... but this probability reduces as the number of industry ties increases but moderation with dynamic capability of the firm reverses this trend. Our findings show that not all network ties aid survival and therefore small commercial poultry farmers need to be circumspect in the network ties they cultivate and develop....

  14. Hidden neural networks

    DEFF Research Database (Denmark)

    Krogh, Anders Stærmose; Riis, Søren Kamaric

    1999-01-01

    A general framework for hybrids of hidden Markov models (HMMs) and neural networks (NNs) called hidden neural networks (HNNs) is described. The article begins by reviewing standard HMMs and estimation by conditional maximum likelihood, which is used by the HNN. In the HNN, the usual HMM probability...... parameters are replaced by the outputs of state-specific neural networks. As opposed to many other hybrids, the HNN is normalized globally and therefore has a valid probabilistic interpretation. All parameters in the HNN are estimated simultaneously according to the discriminative conditional maximum...... likelihood criterion. The HNN can be viewed as an undirected probabilistic independence network (a graphical model), where the neural networks provide a compact representation of the clique functions. An evaluation of the HNN on the task of recognizing broad phoneme classes in the TIMIT database shows clear...

  15. Brain Network Modelling

    DEFF Research Database (Denmark)

    Andersen, Kasper Winther

    Three main topics are presented in this thesis. The first and largest topic concerns network modelling of functional Magnetic Resonance Imaging (fMRI) and Diffusion Weighted Imaging (DWI). In particular nonparametric Bayesian methods are used to model brain networks derived from resting state f...... for their ability to reproduce node clustering and predict unseen data. Comparing the models on whole brain networks, BCD and IRM showed better reproducibility and predictability than IDM, suggesting that resting state networks exhibit community structure. This also points to the importance of using models, which...... allow for complex interactions between all pairs of clusters. In addition, it is demonstrated how the IRM can be used for segmenting brain structures into functionally coherent clusters. A new nonparametric Bayesian network model is presented. The model builds upon the IRM and can be used to infer...

  16. Geoscience is Important? Show Me Why

    Science.gov (United States)

    Boland, M. A.

    2017-12-01

    "The public" is not homogenous and no single message or form of messaging will connect the entire public with the geosciences. One approach to promoting trust in, and engagement with, the geosciences is to identify specific sectors of the public and then develop interactions and communication products that are immediately relevant to that sector's interests. If the content and delivery are appropriate, this approach empowers people to connect with the geosciences on their own terms and to understand the relevance of the geosciences to their own situation. Federal policy makers are a distinct and influential subgroup of the general public. In preparation for the 2016 presidential election, the American Geosciences Institute (AGI) in collaboration with its 51 member societies prepared Geoscience for America's Critical Needs: Invitation to a National Dialogue, a document that identified major geoscience policy issues that should be addressed in a national policy platform. Following the election, AGI worked with eight other geoscience societies to develop Geoscience Policy Recommendations for the New Administration and the 115th Congress, which outlines specific policy actions to address national issues. State and local decision makers are another important subgroup of the public. AGI has developed online content, factsheets, and case studies with different levels of technical complexity so people can explore societally-relevant geoscience topics at their level of technical proficiency. A related webinar series is attracting a growing worldwide audience from many employment sectors. Partnering with government agencies and other scientific and professional societies has increased the visibility and credibility of these information products with our target audience. Surveys and other feedback show that these products are raising awareness of the geosciences and helping to build reciprocal relationships between geoscientists and decision makers. The core message of all

  17. Bacteriophages show promise as antimicrobial agents.

    Science.gov (United States)

    Alisky, J; Iczkowski, K; Rapoport, A; Troitsky, N

    1998-01-01

    The emergence of antibiotic-resistant bacteria has prompted interest in alternatives to conventional drugs. One possible option is to use bacteriophages (phage) as antimicrobial agents. We have conducted a literature review of all Medline citations from 1966-1996 that dealt with the therapeutic use of phage. There were 27 papers from Poland, the Soviet Union, Britain and the U.S.A. The Polish and Soviets administered phage orally, topically or systemically to treat a wide variety of antibiotic-resistant pathogens in both adults and children. Infections included suppurative wound infections, gastroenteritis, sepsis, osteomyelitis, dermatitis, empyemas and pneumonia; pathogens included Staphylococcus, Streptococcus, Klebsiella, Escherichia, Proteus, Pseudomonas, Shigella and Salmonella spp. Overall, the Polish and Soviets reported success rates of 80-95% for phage therapy, with rare, reversible gastrointestinal or allergic side effects. However, efficacy of phage was determined almost exclusively by qualitative clinical assessment of patients, and details of dosages and clinical criteria were very sketchy. There were also six British reports describing controlled trials of phage in animal models (mice, guinea pigs and livestock), measuring survival rates and other objective criteria. All of the British studies raised phage against specific pathogens then used to create experimental infections. Demonstrable efficacy against Escherichia, Acinetobacter, Pseudomonas and Staphylococcus spp. was noted in these model systems. Two U.S. papers dealt with improving the bioavailability of phage. Phage is sequestered in the spleen and removed from circulation. This can be overcome by serial passage of phage through mice to isolate mutants that resist sequestration. In conclusion, bacteriophages may show promise for treating antibiotic resistant pathogens. To facilitate further progress, directions for future research are discussed and a directory of authors from the reviewed

  18. Spatial networks

    Science.gov (United States)

    Barthélemy, Marc

    2011-02-01

    Complex systems are very often organized under the form of networks where nodes and edges are embedded in space. Transportation and mobility networks, Internet, mobile phone networks, power grids, social and contact networks, and neural networks, are all examples where space is relevant and where topology alone does not contain all the information. Characterizing and understanding the structure and the evolution of spatial networks is thus crucial for many different fields, ranging from urbanism to epidemiology. An important consequence of space on networks is that there is a cost associated with the length of edges which in turn has dramatic effects on the topological structure of these networks. We will thoroughly explain the current state of our understanding of how the spatial constraints affect the structure and properties of these networks. We will review the most recent empirical observations and the most important models of spatial networks. We will also discuss various processes which take place on these spatial networks, such as phase transitions, random walks, synchronization, navigation, resilience, and disease spread.

  19. Network science

    CERN Document Server

    Barabasi, Albert-Laszlo

    2016-01-01

    Networks are everywhere, from the Internet, to social networks, and the genetic networks that determine our biological existence. Illustrated throughout in full colour, this pioneering textbook, spanning a wide range of topics from physics to computer science, engineering, economics and the social sciences, introduces network science to an interdisciplinary audience. From the origins of the six degrees of separation to explaining why networks are robust to random failures, the author explores how viruses like Ebola and H1N1 spread, and why it is that our friends have more friends than we do. Using numerous real-world examples, this innovatively designed text includes clear delineation between undergraduate and graduate level material. The mathematical formulas and derivations are included within Advanced Topics sections, enabling use at a range of levels. Extensive online resources, including films and software for network analysis, make this a multifaceted companion for anyone with an interest in network sci...

  20. Vulnerability of network of networks

    Science.gov (United States)

    Havlin, S.; Kenett, D. Y.; Bashan, A.; Gao, J.; Stanley, H. E.

    2014-10-01

    Our dependence on networks - be they infrastructure, economic, social or others - leaves us prone to crises caused by the vulnerabilities of these networks. There is a great need to develop new methods to protect infrastructure networks and prevent cascade of failures (especially in cases of coupled networks). Terrorist attacks on transportation networks have traumatized modern societies. With a single blast, it has become possible to paralyze airline traffic, electric power supply, ground transportation or Internet communication. How, and at which cost can one restructure the network such that it will become more robust against malicious attacks? The gradual increase in attacks on the networks society depends on - Internet, mobile phone, transportation, air travel, banking, etc. - emphasize the need to develop new strategies to protect and defend these crucial networks of communication and infrastructure networks. One example is the threat of liquid explosives a few years ago, which completely shut down air travel for days, and has created extreme changes in regulations. Such threats and dangers warrant the need for new tools and strategies to defend critical infrastructure. In this paper we review recent advances in the theoretical understanding of the vulnerabilities of interdependent networks with and without spatial embedding, attack strategies and their affect on such networks of networks as well as recently developed strategies to optimize and repair failures caused by such attacks.

  1. Using a TV Game Show to Explain the Concept of a Dominant Strategy.

    Science.gov (United States)

    Trandel, Gregory A.

    1999-01-01

    Illustrates the game-theory concept of a dominant strategy using the MTV-network game show "Singled Out." Describes how the game show works and why this makes it attractive as an example of strategic behavior. Presents examples of how the show is used in class. (DSK)

  2. A balanced memory network.

    Directory of Open Access Journals (Sweden)

    Yasser Roudi

    2007-09-01

    Full Text Available A fundamental problem in neuroscience is understanding how working memory--the ability to store information at intermediate timescales, like tens of seconds--is implemented in realistic neuronal networks. The most likely candidate mechanism is the attractor network, and a great deal of effort has gone toward investigating it theoretically. Yet, despite almost a quarter century of intense work, attractor networks are not fully understood. In particular, there are still two unanswered questions. First, how is it that attractor networks exhibit irregular firing, as is observed experimentally during working memory tasks? And second, how many memories can be stored under biologically realistic conditions? Here we answer both questions by studying an attractor neural network in which inhibition and excitation balance each other. Using mean-field analysis, we derive a three-variable description of attractor networks. From this description it follows that irregular firing can exist only if the number of neurons involved in a memory is large. The same mean-field analysis also shows that the number of memories that can be stored in a network scales with the number of excitatory connections, a result that has been suggested for simple models but never shown for realistic ones. Both of these predictions are verified using simulations with large networks of spiking neurons.

  3. Active Versus Passive Academic Networking

    DEFF Research Database (Denmark)

    Goel, Rajeev K.; Grimpe, Christoph

    2013-01-01

    This paper examines determinants of networking by academics. Using information from a unique large survey of German researchers, the key contribution focuses on the active versus passive networking distinction. Is active networking by researchers a substitute or a complement to passive networking......? Other contributions include examining the role of geographic factors in networking and whether research bottlenecks affect a researcher's propensity to network. Are the determinants of European conference participation by German researchers different from conferences in rest of the world? Results show...... that some types of passive academic networking are complementary to active networking, while others are substitute. Further, we find differences in factors promoting participation in European conferences versus conferences in rest of the world. Finally, publishing bottlenecks as a group generally do...

  4. Networks model of the East Turkistan terrorism

    Science.gov (United States)

    Li, Ben-xian; Zhu, Jun-fang; Wang, Shun-guo

    2015-02-01

    The presence of the East Turkistan terrorist network in China can be traced back to the rebellions on the BAREN region in Xinjiang in April 1990. This article intends to research the East Turkistan networks in China and offer a panoramic view. The events, terrorists and their relationship are described using matrices. Then social network analysis is adopted to reveal the network type and the network structure characteristics. We also find the crucial terrorist leader. Ultimately, some results show that the East Turkistan network has big hub nodes and small shortest path, and that the network follows a pattern of small world network with hierarchical structure.

  5. Network Coded Software Defined Networking

    DEFF Research Database (Denmark)

    Hansen, Jonas; Roetter, Daniel Enrique Lucani; Krigslund, Jeppe

    2015-01-01

    Software defined networking has garnered large attention due to its potential to virtualize services in the Internet, introducing flexibility in the buffering, scheduling, processing, and routing of data in network routers. SDN breaks the deadlock that has kept Internet network protocols stagnant...... for decades, while applications and physical links have evolved. This article advocates for the use of SDN to bring about 5G network services by incorporating network coding (NC) functionalities. The latter constitutes a major leap forward compared to the state-of-the- art store and forward Internet paradigm...

  6. Control Networks in Paediatric Tourette Syndrome Show Immature and Anomalous Patterns of Functional Connectivity

    Science.gov (United States)

    Church, Jessica A.; Fair, Damien A.; Dosenbach, Nico U. F.; Cohen, Alexander L.; Miezin, Francis M.; Petersen, Steven E.; Schlaggar, Bradley L.

    2009-01-01

    Tourette syndrome (TS) is a developmental disorder characterized by unwanted, repetitive behaviours that manifest as stereotyped movements and vocalizations called "tics". Operating under the hypothesis that the brain's control systems may be impaired in TS, we measured resting-state functional connectivity MRI (rs-fcMRI) between 39 previously…

  7. Thermodynamics of random reaction networks.

    Directory of Open Access Journals (Sweden)

    Jakob Fischer

    Full Text Available Reaction networks are useful for analyzing reaction systems occurring in chemistry, systems biology, or Earth system science. Despite the importance of thermodynamic disequilibrium for many of those systems, the general thermodynamic properties of reaction networks are poorly understood. To circumvent the problem of sparse thermodynamic data, we generate artificial reaction networks and investigate their non-equilibrium steady state for various boundary fluxes. We generate linear and nonlinear networks using four different complex network models (Erdős-Rényi, Barabási-Albert, Watts-Strogatz, Pan-Sinha and compare their topological properties with real reaction networks. For similar boundary conditions the steady state flow through the linear networks is about one order of magnitude higher than the flow through comparable nonlinear networks. In all networks, the flow decreases with the distance between the inflow and outflow boundary species, with Watts-Strogatz networks showing a significantly smaller slope compared to the three other network types. The distribution of entropy production of the individual reactions inside the network follows a power law in the intermediate region with an exponent of circa -1.5 for linear and -1.66 for nonlinear networks. An elevated entropy production rate is found in reactions associated with weakly connected species. This effect is stronger in nonlinear networks than in the linear ones. Increasing the flow through the nonlinear networks also increases the number of cycles and leads to a narrower distribution of chemical potentials. We conclude that the relation between distribution of dissipation, network topology and strength of disequilibrium is nontrivial and can be studied systematically by artificial reaction networks.

  8. Thermodynamics of random reaction networks.

    Science.gov (United States)

    Fischer, Jakob; Kleidon, Axel; Dittrich, Peter

    2015-01-01

    Reaction networks are useful for analyzing reaction systems occurring in chemistry, systems biology, or Earth system science. Despite the importance of thermodynamic disequilibrium for many of those systems, the general thermodynamic properties of reaction networks are poorly understood. To circumvent the problem of sparse thermodynamic data, we generate artificial reaction networks and investigate their non-equilibrium steady state for various boundary fluxes. We generate linear and nonlinear networks using four different complex network models (Erdős-Rényi, Barabási-Albert, Watts-Strogatz, Pan-Sinha) and compare their topological properties with real reaction networks. For similar boundary conditions the steady state flow through the linear networks is about one order of magnitude higher than the flow through comparable nonlinear networks. In all networks, the flow decreases with the distance between the inflow and outflow boundary species, with Watts-Strogatz networks showing a significantly smaller slope compared to the three other network types. The distribution of entropy production of the individual reactions inside the network follows a power law in the intermediate region with an exponent of circa -1.5 for linear and -1.66 for nonlinear networks. An elevated entropy production rate is found in reactions associated with weakly connected species. This effect is stronger in nonlinear networks than in the linear ones. Increasing the flow through the nonlinear networks also increases the number of cycles and leads to a narrower distribution of chemical potentials. We conclude that the relation between distribution of dissipation, network topology and strength of disequilibrium is nontrivial and can be studied systematically by artificial reaction networks.

  9. Networked Identities

    DEFF Research Database (Denmark)

    Ryberg, Thomas; Larsen, Malene Charlotte

    2008-01-01

    of CoPs we shall argue that the metaphor or theory of networked learning is itself confronted with some central tensions and challenges that need to be addressed. We then explore these theoretical and analytic challenges to the network metaphor, through an analysis of a Danish social networking site. We......In this article we take up a critique of the concept of Communities of Practice (CoP) voiced by several authors, who suggest that networks may provide a better metaphor to understand social forms of organisation and learning. Through a discussion of the notion of networked learning and the critique...... argue that understanding meaning-making and ‘networked identities’ may be relevant analytic entry points in navigating the challenges....

  10. Network and adaptive sampling

    CERN Document Server

    Chaudhuri, Arijit

    2014-01-01

    Combining the two statistical techniques of network sampling and adaptive sampling, this book illustrates the advantages of using them in tandem to effectively capture sparsely located elements in unknown pockets. It shows how network sampling is a reliable guide in capturing inaccessible entities through linked auxiliaries. The text also explores how adaptive sampling is strengthened in information content through subsidiary sampling with devices to mitigate unmanageable expanding sample sizes. Empirical data illustrates the applicability of both methods.

  11. Gossip algorithms in quantum networks

    Science.gov (United States)

    Siomau, Michael

    2017-01-01

    Gossip algorithms is a common term to describe protocols for unreliable information dissemination in natural networks, which are not optimally designed for efficient communication between network entities. We consider application of gossip algorithms to quantum networks and show that any quantum network can be updated to optimal configuration with local operations and classical communication. This allows to speed-up - in the best case exponentially - the quantum information dissemination. Irrespective of the initial configuration of the quantum network, the update requiters at most polynomial number of local operations and classical communication.

  12. The dimensionality of ecological networks

    DEFF Research Database (Denmark)

    Eklöf, Anna; Jacob, Ute; Kopp, Jason

    2013-01-01

    How many dimensions (trait-axes) are required to predict whether two species interact? This unanswered question originated with the idea of ecological niches, and yet bears relevance today for understanding what determines network structure. Here, we analyse a set of 200 ecological networks......, including food webs, antagonistic and mutualistic networks, and find that the number of dimensions needed to completely explain all interactions is small (... the most to explaining network structure. We show that accounting for a few traits dramatically improves our understanding of the structure of ecological networks. Matching traits for resources and consumers, for example, fruit size and bill gape, are the most successful combinations. These results link...

  13. Evolution of hybrid defect networks

    International Nuclear Information System (INIS)

    Martins, C. J. A. P.

    2009-01-01

    We apply a recently developed analytic model for the evolution of monopole networks to the case of monopoles attached to one string, usually known as hybrid networks. We discuss scaling solutions for both local and global hybrid networks, and also find an interesting application for the case of vortons. Our quantitative results agree with previous estimates in indicating that the hybrid networks will usually annihilate soon after the string-forming phase transition. However, we also show that in some specific circumstances these networks can survive considerably more than a Hubble time.

  14. Assessment of general public exposure to lte signals compared to other cellular networks present in Thessaloniki, Greece

    International Nuclear Information System (INIS)

    Gkonis, Fotios; Boursianis, Achilles; Samaras, Theodoros

    2017-01-01

    To assess general public exposure to electromagnetic fields from Long Term Evolution (LTE) base stations, measurements at 10 sites in Thessaloniki, Greece were performed. Results are compared with other mobile cellular networks currently in use. All exposure values satisfy the guidelines for general public exposure of the International Commission on Non-Ionizing Radiation Protection (ICNIRP), as well as the reference levels by the Greek legislation at all sites. LTE electric field measurements were recorded up to 0.645 V/m. By applying the ICNIRP guidelines, the exposure ratio for all LTE signals is between 2.9 x 10"-"5 and 2.8 x 10"-"2. From the measurements results it is concluded that the average and maximum power density contribution of LTE down-link signals to the overall cellular networks signals are 7.8% and 36.7%, respectively. (authors)

  15. Weighted Scale-Free Network Properties of Ecological Network

    International Nuclear Information System (INIS)

    Lee, Jae Woo; Maeng, Seong Eun

    2013-01-01

    We investigate the scale-free network properties of the bipartite ecological network, in particular, the plant-pollinator network. In plant-pollinator network, the pollinators visit the plant to get the nectars. In contrast to the other complex network, the plant-pollinator network has not only the trophic relationships among the interacting partners but also the complexities of the coevolutionary effects. The interactions between the plant and pollinators are beneficial relations. The plant-pollinator network is a bipartite and weighted network. The networks have two types of the nodes: plant and pollinator. We consider the visiting frequency of a pollinator to a plant as the weighting value of the link. We defined the strength of a node as the sum of the weighting value of the links. We reported the cumulative distribution function (CDF) of the degree and the strength of the plant-pollinator network. The CDF of the plants followed stretched exponential functions for both degree and strength, but the CDF of the pollinators showed the power law for both degree and strength. The average strength of the links showed the nonlinear dependence on the degree of the networks.

  16. Network security

    CERN Document Server

    Perez, André

    2014-01-01

    This book introduces the security mechanisms deployed in Ethernet, Wireless-Fidelity (Wi-Fi), Internet Protocol (IP) and MultiProtocol Label Switching (MPLS) networks. These mechanisms are grouped throughout the book according to the following four functions: data protection, access control, network isolation, and data monitoring. Data protection is supplied by data confidentiality and integrity control services. Access control is provided by a third-party authentication service. Network isolation is supplied by the Virtual Private Network (VPN) service. Data monitoring consists of applying

  17. Technical Network

    CERN Multimedia

    2007-01-01

    In order to optimize the management of the Technical Network (TN), to ease the understanding and purpose of devices connected to the TN, and to improve security incident handling, the Technical Network Administrators and the CNIC WG have asked IT/CS to verify the "description" and "tag" fields of devices connected to the TN. Therefore, persons responsible for systems connected to the TN will receive email notifications from IT/CS asking them to add the corresponding information in the network database. Thank you very much for your cooperation. The Technical Network Administrators & the CNIC WG

  18. Research on Evolutionary Mechanism of Agile Supply Chain Network via Complex Network Theory

    Directory of Open Access Journals (Sweden)

    Nai-Ru Xu

    2016-01-01

    Full Text Available The paper establishes the evolutionary mechanism model of agile supply chain network by means of complex network theory which can be used to describe the growth process of the agile supply chain network and analyze the complexity of the agile supply chain network. After introducing the process and the suitability of taking complex network theory into supply chain network research, the paper applies complex network theory into the agile supply chain network research, analyzes the complexity of agile supply chain network, presents the evolutionary mechanism of agile supply chain network based on complex network theory, and uses Matlab to simulate degree distribution, average path length, clustering coefficient, and node betweenness. Simulation results show that the evolution result displays the scale-free property. It lays the foundations of further research on agile supply chain network based on complex network theory.

  19. Comparison analysis on vulnerability of metro networks based on complex network

    Science.gov (United States)

    Zhang, Jianhua; Wang, Shuliang; Wang, Xiaoyuan

    2018-04-01

    This paper analyzes the networked characteristics of three metro networks, and two malicious attacks are employed to investigate the vulnerability of metro networks based on connectivity vulnerability and functionality vulnerability. Meanwhile, the networked characteristics and vulnerability of three metro networks are compared with each other. The results show that Shanghai metro network has the largest transport capacity, Beijing metro network has the best local connectivity and Guangzhou metro network has the best global connectivity, moreover Beijing metro network has the best homogeneous degree distribution. Furthermore, we find that metro networks are very vulnerable subjected to malicious attacks, and Guangzhou metro network has the best topological structure and reliability among three metro networks. The results indicate that the proposed methodology is feasible and effective to investigate the vulnerability and to explore better topological structure of metro networks.

  20. Investigation of the network delay on Profibus-DP based network

    OpenAIRE

    Yılmaz, C.; Gürdal, O.; Sayan, H.H.

    2008-01-01

    The mathematical model of the network-induced delay control systems (NDCS) is given. Also the role of the NDCS’s components such as controller, sensor and network environment on the network-induced delay are included in the mathematical model of the system. The network delay is investigated on Profibus-DP based network application and experimental results obtained are presented graphically. The experimental results obtained show that the network induced delay is randomly changed according to ...

  1. Metabolic and molecular analyses of white mutant Vaccinium berries show down-regulation of MYBPA1-type R2R3 MYB regulatory factor.

    Science.gov (United States)

    Primetta, Anja K; Karppinen, Katja; Riihinen, Kaisu R; Jaakola, Laura

    2015-09-01

    MYBPA1-type R2R3 MYB transcription factor shows down-regulation in white mutant berries of Vaccinium uliginosum deficient in anthocyanins but not proanthocyanidins suggesting a role in the regulation of anthocyanin biosynthesis. Berries of the genus Vaccinium are among the best natural sources of flavonoids. In this study, the expression of structural and regulatory flavonoid biosynthetic genes and the accumulation of flavonoids in white mutant and blue-colored wild-type bog bilberry (V. uliginosum) fruits were measured at different stages of berry development. In contrast to high contents of anthocyanins in ripe blue-colored berries, only traces were detected by HPLC-ESI-MS in ripe white mutant berries. However, similar profile and high levels of flavonol glycosides and proanthocyanidins were quantified in both ripe white and ripe wild-type berries. Analysis with qRT-PCR showed strong down-regulation of structural genes chalcone synthase (VuCHS), dihydroflavonol 4-reductase (VuDFR) and anthocyanidin synthase (VuANS) as well as MYBPA1-type transcription factor VuMYBPA1 in white berries during ripening compared to wild-type berries. The profiles of transcript accumulation of chalcone isomerase (VuCHI), anthocyanidin reductase (VuANR), leucoanthocyanidin reductase (VuLAR) and flavonoid 3'5' hydroxylase (VuF3'5'H) were more similar between the white and the wild-type berries during fruit development, while expression of UDP-glucose: flavonoid 3-O-glucosyltransferase (VuUFGT) showed similar trend but fourfold lower level in white mutant. VuMYBPA1, the R2R3 MYB family member, is a homologue of VmMYB2 of V. myrtillus and VcMYBPA1 of V. corymbosum and belongs to MYBPA1-type MYB family which members are shown in some species to be related with proanthocyanidin biosynthesis in fruits. Our results combined with earlier data of the role of VmMYB2 in white mutant berries of V. myrtillus suggest that the regulation of anthocyanin biosynthesis in Vaccinium species could differ

  2. Overlay networks toward information networking

    CERN Document Server

    Tarkoma, Sasu

    2010-01-01

    With their ability to solve problems in massive information distribution and processing, while keeping scaling costs low, overlay systems represent a rapidly growing area of R&D with important implications for the evolution of Internet architecture. Inspired by the author's articles on content based routing, Overlay Networks: Toward Information Networking provides a complete introduction to overlay networks. Examining what they are and what kind of structures they require, the text covers the key structures, protocols, and algorithms used in overlay networks. It reviews the current state of th

  3. Parallel consensual neural networks.

    Science.gov (United States)

    Benediktsson, J A; Sveinsson, J R; Ersoy, O K; Swain, P H

    1997-01-01

    A new type of a neural-network architecture, the parallel consensual neural network (PCNN), is introduced and applied in classification/data fusion of multisource remote sensing and geographic data. The PCNN architecture is based on statistical consensus theory and involves using stage neural networks with transformed input data. The input data are transformed several times and the different transformed data are used as if they were independent inputs. The independent inputs are first classified using the stage neural networks. The output responses from the stage networks are then weighted and combined to make a consensual decision. In this paper, optimization methods are used in order to weight the outputs from the stage networks. Two approaches are proposed to compute the data transforms for the PCNN, one for binary data and another for analog data. The analog approach uses wavelet packets. The experimental results obtained with the proposed approach show that the PCNN outperforms both a conjugate-gradient backpropagation neural network and conventional statistical methods in terms of overall classification accuracy of test data.

  4. Markets on Networks

    Science.gov (United States)

    Toroczkai, Zoltan; Anghel, Marian; Bassler, Kevin; Korniss, Gyorgy

    2003-03-01

    The dynamics of human, and most biological populations is characterized by competition for resources. By its own nature, this dynamics creates the group of "elites", formed by those agents who have strategies that are the most successful in the given situation, and therefore the rest of the agents will tend to follow, imitate, or interact with them, creating a social structure of leadership in the agent society. These inter-agent communications generate a complex social network with small-world character which itself forms the substrate for a second network, the action network. The latter is a highly dynamic, adaptive, directed network, defined by those inter-agent communication links on the substrate along which the passed information /prediction is acted upon by the other agents. By using the minority game for competition dynamics, here we show that when the substrate network is highly connected, the action network spontaneously develops hubs with a broad distribution of out-degrees, defining a robust leadership structure that is scale-free. Furthermore, in certain, realistic parameter ranges, facilitated by information passing on the action network, agents can spontaneously generate a high degree of cooperation making the collective almost maximally efficient.

  5. Probabilistic Networks

    DEFF Research Database (Denmark)

    Jensen, Finn Verner; Lauritzen, Steffen Lilholt

    2001-01-01

    This article describes the basic ideas and algorithms behind specification and inference in probabilistic networks based on directed acyclic graphs, undirected graphs, and chain graphs.......This article describes the basic ideas and algorithms behind specification and inference in probabilistic networks based on directed acyclic graphs, undirected graphs, and chain graphs....

  6. Bipartite Networks

    NARCIS (Netherlands)

    Agneessens, F.; Moser, C.; Barnett, G.A.

    2011-01-01

    Bipartite networks refer to a specific kind of network in which the nodes (or actors) can be partitioned into two subsets based on the fact that no links exist between actors within each subset, but only between the two subsets. Due to the partition of actors in two sets and the absence of relations

  7. Expression of the Components of the Renin-Angiotensin System in Venous Malformation

    Directory of Open Access Journals (Sweden)

    Sam eSiljee

    2016-05-01

    Full Text Available Background Venous malformation (VM is the most common form of vascular malformation, consisting of a network of thin-walled ectatic venous channels with deficient or absent media. This study investigated the expression of the components of the renin-angiotensin system (RAS, namely (prorenin receptor (PRR, angiotensin converting enzyme (ACE, angiotensin II receptor 1 (ATIIR1 and angiotensin II receptor 2 (AIITR2 in subcutaneous (SC and intramuscular (IM VM. Materials and Methods SC (n=7 and IM (n=7 VM were analyzed for the expression of PRR, ACE, ATIIR1, and ATIIR2 using 3,3-diaminobenzidine (DAB and immunofluorescent (IF immunohistochemical (IHC staining and NanoString gene expression analysis. Results IHC staining showed expression of PRR, ACE, ATIIR1 and faint expression of ATIIR2 in the endothelium of SC and IM VM. Furthermore, ATIIR2 was expressed by cells away from the endothelium in both SC and IM VM lesions examined. NanoString analysis demonstrated the presence of PRR, ACE and ATIIR1 but not ATIIR2.Conclusions The presence of PRR, ACE, ATIIR1 and potentially ATIIR2, in both SC and IM VM suggests a role for the RAS in the biology of VM. This novel finding may lead to a mechanism-based therapy for VM.

  8. Temporal networks

    Science.gov (United States)

    Holme, Petter; Saramäki, Jari

    2012-10-01

    A great variety of systems in nature, society and technology-from the web of sexual contacts to the Internet, from the nervous system to power grids-can be modeled as graphs of vertices coupled by edges. The network structure, describing how the graph is wired, helps us understand, predict and optimize the behavior of dynamical systems. In many cases, however, the edges are not continuously active. As an example, in networks of communication via e-mail, text messages, or phone calls, edges represent sequences of instantaneous or practically instantaneous contacts. In some cases, edges are active for non-negligible periods of time: e.g., the proximity patterns of inpatients at hospitals can be represented by a graph where an edge between two individuals is on throughout the time they are at the same ward. Like network topology, the temporal structure of edge activations can affect dynamics of systems interacting through the network, from disease contagion on the network of patients to information diffusion over an e-mail network. In this review, we present the emergent field of temporal networks, and discuss methods for analyzing topological and temporal structure and models for elucidating their relation to the behavior of dynamical systems. In the light of traditional network theory, one can see this framework as moving the information of when things happen from the dynamical system on the network, to the network itself. Since fundamental properties, such as the transitivity of edges, do not necessarily hold in temporal networks, many of these methods need to be quite different from those for static networks. The study of temporal networks is very interdisciplinary in nature. Reflecting this, even the object of study has many names-temporal graphs, evolving graphs, time-varying graphs, time-aggregated graphs, time-stamped graphs, dynamic networks, dynamic graphs, dynamical graphs, and so on. This review covers different fields where temporal graphs are considered

  9. Network chemistry, network toxicology, network informatics, and network behavioristics: A scientific outline

    OpenAIRE

    WenJun Zhang

    2016-01-01

    In present study, I proposed some new sciences: network chemistry, network toxicology, network informatics, and network behavioristics. The aims, scope and scientific foundation of these sciences are outlined.

  10. From Networks to Time Series

    Science.gov (United States)

    Shimada, Yutaka; Ikeguchi, Tohru; Shigehara, Takaomi

    2012-10-01

    In this Letter, we propose a framework to transform a complex network to a time series. The transformation from complex networks to time series is realized by the classical multidimensional scaling. Applying the transformation method to a model proposed by Watts and Strogatz [Nature (London) 393, 440 (1998)], we show that ring lattices are transformed to periodic time series, small-world networks to noisy periodic time series, and random networks to random time series. We also show that these relationships are analytically held by using the circulant-matrix theory and the perturbation theory of linear operators. The results are generalized to several high-dimensional lattices.

  11. Show Horse Welfare: Horse Show Competitors' Understanding, Awareness, and Perceptions of Equine Welfare.

    Science.gov (United States)

    Voigt, Melissa A; Hiney, Kristina; Richardson, Jennifer C; Waite, Karen; Borron, Abigail; Brady, Colleen M

    2016-01-01

    The purpose of this study was to gain a better understanding of stock-type horse show competitors' understanding of welfare and level of concern for stock-type show horses' welfare. Data were collected through an online questionnaire that included questions relating to (a) interest and general understanding of horse welfare, (b) welfare concerns of the horse show industry and specifically the stock-type horse show industry, (c) decision-making influences, and (d) level of empathic characteristics. The majority of respondents indicated they agree or strongly agree that physical metrics should be a factor when assessing horse welfare, while fewer agreed that behavioral and mental metrics should be a factor. Respondent empathy levels were moderate to high and were positively correlated with the belief that mental and behavioral metrics should be a factor in assessing horse welfare. Respondents indicated the inhumane practices that most often occur at stock-type shows include excessive jerking on reins, excessive spurring, and induced excessive unnatural movement. Additionally, respondents indicated association rules, hired trainers, and hired riding instructors are the most influential regarding the decisions they make related to their horses' care and treatment.

  12. Managing collaborative innovation networks

    DEFF Research Database (Denmark)

    Stevens, Vidar; Agger, Annika

    2017-01-01

    Collaborative innovation networks are increasingly used as vehicles for fostering innovative policy solutions. However, scholars have noted that the extent to which collaborative networks can actually contribute to the development of innovative policy solutions depends on how they are managed...... a Flemish administrative network to develop a radical new Spatial Planning Policy Plan. This study shows that the best way to manage collaborative innovation networks is not to press directly for results, but take the time to invest in relationship-building and together agree on a planning and clear process...... steps. Such a management approach allows actors to get to know each other and from thereon expand, with more background and appreciation for the others’ goals, behaviors, and intentions, their group activities concerning the formulation of a radical and innovative policy plan....

  13. Urban networks of tomorrow

    International Nuclear Information System (INIS)

    Bothe, D; Kaufmann, T.

    2016-01-01

    The requirements for urban utility grids are subject to a considerable change. The diversification of the energy supply and the changing feed-in structure (central -> decentral) also influence the operation of the existing networks considerably. Therefore, the focus of future studies will be on the flexibility of energy supply and the energy-carrier-wide network analysis or planning. These aspects are addressed, among other things, within the URBEM project, with a focus on a holistic, interdisciplinary approach. On the basis of separately performed thermal and electrical network calculations an optimization task is defined (for example, minimization of operating resources, minimization of CO2 emissions) and solved under technical conditions. The scenarios for the period 2030 and 2050 developed in the URBEM project serve as the basis for the optimization. The results of the calculations show current utilization or bottlenecks in the supply networks as well as optimum future supply structures for development areas in urban areas. (rössner) [de

  14. Recurrent Spatial Transformer Networks

    DEFF Research Database (Denmark)

    Sønderby, Søren Kaae; Sønderby, Casper Kaae; Maaløe, Lars

    2015-01-01

    We integrate the recently proposed spatial transformer network (SPN) [Jaderberg et. al 2015] into a recurrent neural network (RNN) to form an RNN-SPN model. We use the RNN-SPN to classify digits in cluttered MNIST sequences. The proposed model achieves a single digit error of 1.5% compared to 2.......9% for a convolutional networks and 2.0% for convolutional networks with SPN layers. The SPN outputs a zoomed, rotated and skewed version of the input image. We investigate different down-sampling factors (ratio of pixel in input and output) for the SPN and show that the RNN-SPN model is able to down-sample the input...

  15. Transforming phylogenetic networks: Moving beyond tree space

    OpenAIRE

    Huber, Katharina T.; Moulton, Vincent; Wu, Taoyang

    2016-01-01

    Phylogenetic networks are a generalization of phylogenetic trees that are used to represent reticulate evolution. Unrooted phylogenetic networks form a special class of such networks, which naturally generalize unrooted phylogenetic trees. In this paper we define two operations on unrooted phylogenetic networks, one of which is a generalization of the well-known nearest-neighbor interchange (NNI) operation on phylogenetic trees. We show that any unrooted phylogenetic network can be transforme...

  16. Undermining and Strengthening Social Networks through Network Modification

    Science.gov (United States)

    Mellon, Jonathan; Yoder, Jordan; Evans, Daniel

    2016-10-01

    Social networks have well documented effects at the individual and aggregate level. Consequently it is often useful to understand how an attempt to influence a network will change its structure and consequently achieve other goals. We develop a framework for network modification that allows for arbitrary objective functions, types of modification (e.g. edge weight addition, edge weight removal, node removal, and covariate value change), and recovery mechanisms (i.e. how a network responds to interventions). The framework outlined in this paper helps both to situate the existing work on network interventions but also opens up many new possibilities for intervening in networks. In particular use two case studies to highlight the potential impact of empirically calibrating the objective function and network recovery mechanisms as well as showing how interventions beyond node removal can be optimised. First, we simulate an optimal removal of nodes from the Noordin terrorist network in order to reduce the expected number of attacks (based on empirically predicting the terrorist collaboration network from multiple types of network ties). Second, we simulate optimally strengthening ties within entrepreneurial ecosystems in six developing countries. In both cases we estimate ERGM models to simulate how a network will endogenously evolve after intervention.

  17. Best in show but not best shape: a photographic assessment of show dog body condition.

    Science.gov (United States)

    Such, Z R; German, A J

    2015-08-01

    Previous studies suggest that owners often wrongly perceive overweight dogs to be in normal condition. The body shape of dogs attending shows might influence owners' perceptions, with online images of overweight show winners having a negative effect. This was an observational in silico study of canine body condition. 14 obese-prone breeds and 14 matched non-obese-probe breeds were first selected, and one operator then used an online search engine to identify 40 images, per breed, of dogs that had appeared at a major national UK show (Crufts). After images were anonymised and coded, a second observer subjectively assessed body condition, in a single sitting, using a previously validated method. Of 1120 photographs initially identified, 960 were suitable for assessing body condition, with all unsuitable images being from longhaired breeds. None of the dogs (0 per cent) were underweight, 708 (74 per cent) were in ideal condition and 252 (26 per cent) were overweight. Pugs, basset hounds and Labrador retrievers were most likely to be overweight, while standard poodles, Rhodesian ridgebacks, Hungarian vizslas and Dobermanns were least likely to be overweight. Given the proportion of show dogs from some breeds that are overweight, breed standards should be redefined to be consistent with a dog in optimal body condition. British Veterinary Association.

  18. The complex network reliability and influential nodes

    Science.gov (United States)

    Li, Kai; He, Yongfeng

    2017-08-01

    In order to study the complex network node important degree and reliability, considering semi-local centrality, betweenness centrality and PageRank algorithm, through the simulation method to gradually remove nodes and recalculate the importance in the random network, small world network and scale-free network. Study the relationship between the largest connected component and node removed proportion, the research results show that betweenness centrality and PageRank algorithm based on the global information network are more effective for evaluating the importance of nodes, and the reliability of the network is related to the network topology.

  19. Accelerating networks

    International Nuclear Information System (INIS)

    Smith, David M D; Onnela, Jukka-Pekka; Johnson, Neil F

    2007-01-01

    Evolving out-of-equilibrium networks have been under intense scrutiny recently. In many real-world settings the number of links added per new node is not constant but depends on the time at which the node is introduced in the system. This simple idea gives rise to the concept of accelerating networks, for which we review an existing definition and-after finding it somewhat constrictive-offer a new definition. The new definition provided here views network acceleration as a time dependent property of a given system as opposed to being a property of the specific algorithm applied to grow the network. The definition also covers both unweighted and weighted networks. As time-stamped network data becomes increasingly available, the proposed measures may be easily applied to such empirical datasets. As a simple case study we apply the concepts to study the evolution of three different instances of Wikipedia, namely, those in English, German, and Japanese, and find that the networks undergo different acceleration regimes in their evolution

  20. Social networks

    CERN Document Server

    Etaner-Uyar, A Sima

    2014-01-01

    The present volume provides a comprehensive resource for practitioners and researchers alike-both those new to the field as well as those who already have some experience. The work covers Social Network Analysis theory and methods with a focus on current applications and case studies applied in various domains such as mobile networks, security, machine learning and health. With the increasing popularity of Web 2.0, social media has become a widely used communication platform. Parallel to this development, Social Network Analysis gained in importance as a research field, while opening up many

  1. Network Warrior

    CERN Document Server

    Donahue, Gary

    2011-01-01

    Pick up where certification exams leave off. With this practical, in-depth guide to the entire network infrastructure, you'll learn how to deal with real Cisco networks, rather than the hypothetical situations presented on exams like the CCNA. Network Warrior takes you step by step through the world of routers, switches, firewalls, and other technologies based on the author's extensive field experience. You'll find new content for MPLS, IPv6, VoIP, and wireless in this completely revised second edition, along with examples of Cisco Nexus 5000 and 7000 switches throughout. Topics include: An

  2. Thin Watts-Strogatz networks.

    Science.gov (United States)

    de Moura, Alessandro P S

    2006-01-01

    A modified version of the Watts-Strogatz (WS) network model is proposed, in which the number of shortcuts scales with the network size N as Nalpha, with alpha infinity, whereas in the original WS model, this ratio is constant. We call such networks "thin Watts-Strogatz networks." We show that even though the fraction of shortcuts becomes vanishingly small for large networks, they still cause a kind of small-world effect, in the sense that the length L of the network increases sublinearly with the size. We develop a mean-field theory for these networks, which predicts that the length scales as N1-alpha ln N for large N. We also study how a search using only local information works in thin WS networks. We find that the search performance is enhanced compared to the regular network, and we predict that the search time tau scales as N1-alpha/2. These theoretical results are tested using numerical simulations. We comment on the possible relevance of thin WS networks for the design of high-performance low-cost communication networks.

  3. Latent geometry of bipartite networks

    Science.gov (United States)

    Kitsak, Maksim; Papadopoulos, Fragkiskos; Krioukov, Dmitri

    2017-03-01

    Despite the abundance of bipartite networked systems, their organizing principles are less studied compared to unipartite networks. Bipartite networks are often analyzed after projecting them onto one of the two sets of nodes. As a result of the projection, nodes of the same set are linked together if they have at least one neighbor in common in the bipartite network. Even though these projections allow one to study bipartite networks using tools developed for unipartite networks, one-mode projections lead to significant loss of information and artificial inflation of the projected network with fully connected subgraphs. Here we pursue a different approach for analyzing bipartite systems that is based on the observation that such systems have a latent metric structure: network nodes are points in a latent metric space, while connections are more likely to form between nodes separated by shorter distances. This approach has been developed for unipartite networks, and relatively little is known about its applicability to bipartite systems. Here, we fully analyze a simple latent-geometric model of bipartite networks and show that this model explains the peculiar structural properties of many real bipartite systems, including the distributions of common neighbors and bipartite clustering. We also analyze the geometric information loss in one-mode projections in this model and propose an efficient method to infer the latent pairwise distances between nodes. Uncovering the latent geometry underlying real bipartite networks can find applications in diverse domains, ranging from constructing efficient recommender systems to understanding cell metabolism.

  4. Unified broadcast in sensor networks

    DEFF Research Database (Denmark)

    Hansen, Morten Tranberg; Jurdak, Raja; Kusy, Branislav

    2011-01-01

    of the network stack. UB is implemented as a transparent layer between the link and network layers, where it delays, schedules, and combines broadcasts from upper layer protocols before transmission on the wireless channel. Our empirical results in simulation and on a testbed show that UB can decrease...... the overall packet transmissions in the network by more than 60%, corresponding to more than 40% energy savings, without requiring new interfaces or affecting the correctness of the upper layer protocols....

  5. The Effectiveness of Transgovernmental Networks

    DEFF Research Database (Denmark)

    Martinsen, Dorte Sindbjerg; Hobolth, Mogens

    2016-01-01

    participating in Solvit, an internal market problem-solving network, this paper investigates the role of transgovernmental networks in enforcing and managing the daily application of EU legislation by national authorities. We show that informal conflict resolution has become an important and effective tool...... for addressing misapplication of EU law. Anchored in national public administrations yet working under the ‘shadow of hierarchy’ (namely the Commission) transgovermental networks are in fact able to improve the compliance of domestic authorities....

  6. On the Design of Energy Efficient Optical Networks with Software Defined Networking Control Across Core and Access Networks

    DEFF Research Database (Denmark)

    Wang, Jiayuan; Yan, Ying; Dittmann, Lars

    2013-01-01

    This paper presents a Software Defined Networking (SDN) control plane based on an overlay GMPLS control model. The SDN control platform manages optical core networks (WDM/DWDM networks) and the associated access networks (GPON networks), which makes it possible to gather global information...... and enable wider areas' energy efficiency networking. The energy related information of the networks and the types of the traffic flows are collected and utilized for the end-to-end QoS provision. Dynamic network simulation results show that by applying different routing algorithms according to the type...... of traffic in the core networks, the energy efficiency of the network is improved without compromising the quality of service....

  7. Functional Module Analysis for Gene Coexpression Networks with Network Integration.

    Science.gov (United States)

    Zhang, Shuqin; Zhao, Hongyu; Ng, Michael K

    2015-01-01

    Network has been a general tool for studying the complex interactions between different genes, proteins, and other small molecules. Module as a fundamental property of many biological networks has been widely studied and many computational methods have been proposed to identify the modules in an individual network. However, in many cases, a single network is insufficient for module analysis due to the noise in the data or the tuning of parameters when building the biological network. The availability of a large amount of biological networks makes network integration study possible. By integrating such networks, more informative modules for some specific disease can be derived from the networks constructed from different tissues, and consistent factors for different diseases can be inferred. In this paper, we have developed an effective method for module identification from multiple networks under different conditions. The problem is formulated as an optimization model, which combines the module identification in each individual network and alignment of the modules from different networks together. An approximation algorithm based on eigenvector computation is proposed. Our method outperforms the existing methods, especially when the underlying modules in multiple networks are different in simulation studies. We also applied our method to two groups of gene coexpression networks for humans, which include one for three different cancers, and one for three tissues from the morbidly obese patients. We identified 13 modules with three complete subgraphs, and 11 modules with two complete subgraphs, respectively. The modules were validated through Gene Ontology enrichment and KEGG pathway enrichment analysis. We also showed that the main functions of most modules for the corresponding disease have been addressed by other researchers, which may provide the theoretical basis for further studying the modules experimentally.

  8. Patterned basal seismicity shows sub-ice stream bedforms

    Science.gov (United States)

    Barcheck, C. G.; Tulaczyk, S. M.; Schwartz, S. Y.

    2017-12-01

    Patterns in seismicity emanating from the bottom of fast-moving ice streams and glaciers may indicate localized patches of higher basal resistance— sometimes called 'sticky spots', or otherwise varying basal properties. These seismogenic basal areas resist an unknown portion of the total driving stress of the Whillans Ice Plain (WIP), in West Antarctica, but may play an important role in the WIP stick-slip cycle and ice stream slowdown. To better understand the mechanism and importance of basal seismicity beneath the WIP, we analyze seismic data collected by a small aperture (micro-earthquakes in Dec 2014, and we compare the resulting map of seismicity to ice bottom depth measured by airborne radar. The number of basal earthquakes per area within the network is spatially heterogeneous, but a pattern of two 400m wide streaks of high seismicity rates is evident, with >50-500 earthquakes detected per 50x50m grid cell in 2 weeks. These seismically active streaks are elongated approximately in the ice flow direction with a spacing of 750m. Independent airborne radar measurements of ice bottom depth from Jan 2013 show a low-amplitude ( 5m) undulation in the basal topography superposed on a regional gradient in ice bottom depth. The flow-perpendicular wavelength of these low-amplitude undulations is comparable to the spacing of the high seismicity bands, and the streaks of high seismicity intersect local lows in the undulating basal topography. We interpret these seismic and radar observations as showing seismically active sub-ice stream bedforms that are low amplitude and elongated in the direction of ice flow, comparable to the morphology of mega scale glacial lineations (MSGLs), with high basal seismicity rates observed in the MSGL troughs. These results have implications for understanding the formation mechanism of MSGLS and well as understanding the interplay between basal topographic roughness, spatially varying basal till and hydrologic properties, basal

  9. Heterodox networks

    DEFF Research Database (Denmark)

    Lala, Purnima; Kumar, Ambuj

    2016-01-01

    It is imperative for the service providers to bring innovation in the network design to meet the exponential growth of mobile subscribers for multi-technology future wireless networks. As a matter of research, studies on providing services to moving subscriber groups aka ‘Place Time Capacity (PTC......)’ have not been considered much in the literature. In this article we present Heterodox networks as an innovative and alternate approach to handle the PTC congestion. We describe two different approaches to combat the PTC congestion where the traditional terrestrial infrastructure fails to provide......-Configurable Intelligent Distributed Antenna System (SCIDAS)’ that overlays intelligence over the conventional DAS architecture and latter is in the form of a swarm of intelligent hovering base stations working in a team to cooperatively resolve the PTC congestion at the Area of Event (AoE). A suitable network...

  10. Networking Japan

    DEFF Research Database (Denmark)

    Hansen, Annette Skovsted

    Human Resource Development was the first and remains an important pillar in Japanese foreign aid. I will argue that Japan has access to a global network of alumni who will co-define Japanese foreign aid in the future, because Japan has encouraged alumni societies and networking since 1965. A total...... of more than a million people in more than 100 countries have attended courses in Japan funded fully or partly by Japanese ODA since the inception of the technical assistance programs in 1954 through the Colombo Plan and since 1959 through the Association of Overseas Technical Scholarships (AOTS from 2009...... HIDA). Many of these alumni have and will in the future exchange ideas and keep contact not only to Japan, but also to fellow alumni around the globe and, thereby, practice south-south exchanges, which are made possible and traceable by their established alumni network and the World Network of Friends...

  11. Sentinel Network

    Science.gov (United States)

    The Sentinel Network is an integrated, electronic, national medical product safety initiative that compiles information about the safe and effective use of medical products accessible to patients and healthcare practitioners.

  12. Exchange Network

    Science.gov (United States)

    The Environmental Information Exchange Network (EN) is an Internet-based system used by state, tribal and territorial partners to securely share environmental and health information with one another and EPA.

  13. Diversity Networks

    Science.gov (United States)

    and professional growth of women through networking, mentoring and training. We strive to ensure that will be used. National Processing Center Seniors Leader: Jo Anne Hankins Champion: Eric Milliner NO

  14. Nepal Networking

    DEFF Research Database (Denmark)

    Hansen, Annette Skovsted

    , as a Danida fellow. Today, the older sister works in Nepal and the younger in Seattle, where they still make use of their personal networks including connections to their fellow alumni of technical assistance courses. Inspired by work on social remittances in combination with network theory , I argue......Technical Assistance courses have many functions apart from disseminating knowledge and information, one such function is to engender networks. During the course period, participants meet and establish contact and some of these contacts remain connections between alumni for many years after...... the courses are finished. The alumni networks depend on the uses they are put to by the individual alumni and the support they get from alumni and host countries. The United Nations initiated technical assistance courses in the late 1940s in order to train nationals from developing countries as a means...

  15. computer networks

    Directory of Open Access Journals (Sweden)

    N. U. Ahmed

    2002-01-01

    Full Text Available In this paper, we construct a new dynamic model for the Token Bucket (TB algorithm used in computer networks and use systems approach for its analysis. This model is then augmented by adding a dynamic model for a multiplexor at an access node where the TB exercises a policing function. In the model, traffic policing, multiplexing and network utilization are formally defined. Based on the model, we study such issues as (quality of service QoS, traffic sizing and network dimensioning. Also we propose an algorithm using feedback control to improve QoS and network utilization. Applying MPEG video traces as the input traffic to the model, we verify the usefulness and effectiveness of our model.

  16. Neural networks

    International Nuclear Information System (INIS)

    Denby, Bruce; Lindsey, Clark; Lyons, Louis

    1992-01-01

    The 1980s saw a tremendous renewal of interest in 'neural' information processing systems, or 'artificial neural networks', among computer scientists and computational biologists studying cognition. Since then, the growth of interest in neural networks in high energy physics, fueled by the need for new information processing technologies for the next generation of high energy proton colliders, can only be described as explosive

  17. Pintadas network

    OpenAIRE

    Cruz, Maria do Carmo Meirelles T.

    2006-01-01

    The Pintadas Network has been organized in Pintadas, a small municipality (11.254 inhabitants) in Bahia, located in the semi-arid region. It has been composed by civil society organizacions (social, productive, cultural and religious organizations and a credit cooperative), with support from the local town hall and from national and international institutions. The Network is a space for articulation, which intends to formulate, execute, follow-up, inspect and evaluate the municipal public pol...

  18. Organizational Networks

    DEFF Research Database (Denmark)

    Grande, Bård; Sørensen, Ole Henning

    1998-01-01

    The paper focuses on the concept of organizational networks. Four different uses of the concept of organizational network are identified and critically discussed. Special focus is placed on how information and communication technologies as communication mediators and cognitive pictures influence...... the organizational forms discussed in the paper. It is asserted that the underlying organizational phenomena are not changing but that the manifestations and representations are shifting due to technological developments....

  19. Complex Networks

    CERN Document Server

    Evsukoff, Alexandre; González, Marta

    2013-01-01

    In the last decade we have seen the emergence of a new inter-disciplinary field focusing on the understanding of networks which are dynamic, large, open, and have a structure sometimes called random-biased. The field of Complex Networks is helping us better understand many complex phenomena such as the spread of  deseases, protein interactions, social relationships, to name but a few. Studies in Complex Networks are gaining attention due to some major scientific breakthroughs proposed by network scientists helping us understand and model interactions contained in large datasets. In fact, if we could point to one event leading to the widespread use of complex network analysis is the availability of online databases. Theories of Random Graphs from Erdös and Rényi from the late 1950s led us to believe that most networks had random characteristics. The work on large online datasets told us otherwise. Starting with the work of Barabási and Albert as well as Watts and Strogatz in the late 1990s, we now know th...

  20. Tomato Fruits Show Wide Phenomic Diversity but Fruit Developmental Genes Show Low Genomic Diversity.

    Directory of Open Access Journals (Sweden)

    Vijee Mohan

    Full Text Available Domestication of tomato has resulted in large diversity in fruit phenotypes. An intensive phenotyping of 127 tomato accessions from 20 countries revealed extensive morphological diversity in fruit traits. The diversity in fruit traits clustered the accessions into nine classes and identified certain promising lines having desirable traits pertaining to total soluble salts (TSS, carotenoids, ripening index, weight and shape. Factor analysis of the morphometric data from Tomato Analyzer showed that the fruit shape is a complex trait shared by several factors. The 100% variance between round and flat fruit shapes was explained by one discriminant function having a canonical correlation of 0.874 by stepwise discriminant analysis. A set of 10 genes (ACS2, COP1, CYC-B, RIN, MSH2, NAC-NOR, PHOT1, PHYA, PHYB and PSY1 involved in various plant developmental processes were screened for SNP polymorphism by EcoTILLING. The genetic diversity in these genes revealed a total of 36 non-synonymous and 18 synonymous changes leading to the identification of 28 haplotypes. The average frequency of polymorphism across the genes was 0.038/Kb. Significant negative Tajima'D statistic in two of the genes, ACS2 and PHOT1 indicated the presence of rare alleles in low frequency. Our study indicates that while there is low polymorphic diversity in the genes regulating plant development, the population shows wider phenotype diversity. Nonetheless, morphological and genetic diversity of the present collection can be further exploited as potential resources in future.

  1. Contagion on complex networks with persuasion

    Science.gov (United States)

    Huang, Wei-Min; Zhang, Li-Jie; Xu, Xin-Jian; Fu, Xinchu

    2016-03-01

    The threshold model has been widely adopted as a classic model for studying contagion processes on social networks. We consider asymmetric individual interactions in social networks and introduce a persuasion mechanism into the threshold model. Specifically, we study a combination of adoption and persuasion in cascading processes on complex networks. It is found that with the introduction of the persuasion mechanism, the system may become more vulnerable to global cascades, and the effects of persuasion tend to be more significant in heterogeneous networks than those in homogeneous networks: a comparison between heterogeneous and homogeneous networks shows that under weak persuasion, heterogeneous networks tend to be more robust against random shocks than homogeneous networks; whereas under strong persuasion, homogeneous networks are more stable. Finally, we study the effects of adoption and persuasion threshold heterogeneity on systemic stability. Though both heterogeneities give rise to global cascades, the adoption heterogeneity has an overwhelmingly stronger impact than the persuasion heterogeneity when the network connectivity is sufficiently dense.

  2. Breakdown of interdependent directed networks.

    Science.gov (United States)

    Liu, Xueming; Stanley, H Eugene; Gao, Jianxi

    2016-02-02

    Increasing evidence shows that real-world systems interact with one another via dependency connectivities. Failing connectivities are the mechanism behind the breakdown of interacting complex systems, e.g., blackouts caused by the interdependence of power grids and communication networks. Previous research analyzing the robustness of interdependent networks has been limited to undirected networks. However, most real-world networks are directed, their in-degrees and out-degrees may be correlated, and they are often coupled to one another as interdependent directed networks. To understand the breakdown and robustness of interdependent directed networks, we develop a theoretical framework based on generating functions and percolation theory. We find that for interdependent Erdős-Rényi networks the directionality within each network increases their vulnerability and exhibits hybrid phase transitions. We also find that the percolation behavior of interdependent directed scale-free networks with and without degree correlations is so complex that two criteria are needed to quantify and compare their robustness: the percolation threshold and the integrated size of the giant component during an entire attack process. Interestingly, we find that the in-degree and out-degree correlations in each network layer increase the robustness of interdependent degree heterogeneous networks that most real networks are, but decrease the robustness of interdependent networks with homogeneous degree distribution and with strong coupling strengths. Moreover, by applying our theoretical analysis to real interdependent international trade networks, we find that the robustness of these real-world systems increases with the in-degree and out-degree correlations, confirming our theoretical analysis.

  3. Network structure exploration in networks with node attributes

    Science.gov (United States)

    Chen, Yi; Wang, Xiaolong; Bu, Junzhao; Tang, Buzhou; Xiang, Xin

    2016-05-01

    Complex networks provide a powerful way to represent complex systems and have been widely studied during the past several years. One of the most important tasks of network analysis is to detect structures (also called structural regularities) embedded in networks by determining group number and group partition. Most of network structure exploration models only consider network links. However, in real world networks, nodes may have attributes that are useful for network structure exploration. In this paper, we propose a novel Bayesian nonparametric (BNP) model to explore structural regularities in networks with node attributes, called Bayesian nonparametric attribute (BNPA) model. This model does not only take full advantage of both links between nodes and node attributes for group partition via shared hidden variables, but also determine group number automatically via the Bayesian nonparametric theory. Experiments conducted on a number of real and synthetic networks show that our BNPA model is able to automatically explore structural regularities in networks with node attributes and is competitive with other state-of-the-art models.

  4. Applying Physical-Layer Network Coding in Wireless Networks

    Directory of Open Access Journals (Sweden)

    Liew SoungChang

    2010-01-01

    Full Text Available A main distinguishing feature of a wireless network compared with a wired network is its broadcast nature, in which the signal transmitted by a node may reach several other nodes, and a node may receive signals from several other nodes, simultaneously. Rather than a blessing, this feature is treated more as an interference-inducing nuisance in most wireless networks today (e.g., IEEE 802.11. This paper shows that the concept of network coding can be applied at the physical layer to turn the broadcast property into a capacity-boosting advantage in wireless ad hoc networks. Specifically, we propose a physical-layer network coding (PNC scheme to coordinate transmissions among nodes. In contrast to "straightforward" network coding which performs coding arithmetic on digital bit streams after they have been received, PNC makes use of the additive nature of simultaneously arriving electromagnetic (EM waves for equivalent coding operation. And in doing so, PNC can potentially achieve 100% and 50% throughput increases compared with traditional transmission and straightforward network coding, respectively, in 1D regular linear networks with multiple random flows. The throughput improvements are even larger in 2D regular networks: 200% and 100%, respectively.

  5. Statistical Mechanics of Temporal and Interacting Networks

    Science.gov (United States)

    Zhao, Kun

    a new framework to quantify the information encoded in these networks and to answer a fundamental problem in network science: how complex are temporal and growing networks. Finally, we consider two examples of critical phenomena in interacting networks. In particular, on one side we investigate the percolation of interacting networks by introducing antagonistic interactions. On the other side, we investigate a model of political election based on the percolation of antagonistic networks. The aim of this research is to show how antagonistic interactions change the physics of critical phenomena on interacting networks. We believe that the work presented in these thesis offers the possibility to appreciate the large variability of problems that can be addressed in the new framework of temporal and interacting networks.

  6. Modular networks with hierarchical organization

    Indian Academy of Sciences (India)

    Several networks occurring in real life have modular structures that are arranged in a hierarchical fashion. In this paper, we have proposed a model for such networks, using a stochastic generation method. Using this model we show that, the scaling relation between the clustering and degree of the nodes is not a necessary ...

  7. Networks and informal contract law

    NARCIS (Netherlands)

    Tjong Tjin Tai, Eric; Brownsword, Roger; van Gestel, Rob A.J.; Micklitz, Hans-W.

    2017-01-01

    It is often argued that formal contract law cannot treat networks correctly. An analysis of networks in an informal contract law system shows that informal contract law is no panacea. Remaining problems require a different approach to legal regulation and contract practice.

  8. Dynamic and interacting complex networks

    Science.gov (United States)

    Dickison, Mark E.

    This thesis employs methods of statistical mechanics and numerical simulations to study some aspects of dynamic and interacting complex networks. The mapping of various social and physical phenomena to complex networks has been a rich field in the past few decades. Subjects as broad as petroleum engineering, scientific collaborations, and the structure of the internet have all been analyzed in a network physics context, with useful and universal results. In the first chapter we introduce basic concepts in networks, including the two types of network configurations that are studied and the statistical physics and epidemiological models that form the framework of the network research, as well as covering various previously-derived results in network theory that are used in the work in the following chapters. In the second chapter we introduce a model for dynamic networks, where the links or the strengths of the links change over time. We solve the model by mapping dynamic networks to the problem of directed percolation, where the direction corresponds to the time evolution of the network. We show that the dynamic network undergoes a percolation phase transition at a critical concentration pc, that decreases with the rate r at which the network links are changed. The behavior near criticality is universal and independent of r. We find that for dynamic random networks fundamental laws are changed: i) The size of the giant component at criticality scales with the network size N for all values of r, rather than as N2/3 in static network, ii) In the presence of a broad distribution of disorder, the optimal path length between two nodes in a dynamic network scales as N1/2, compared to N1/3 in a static network. The third chapter consists of a study of the effect of quarantine on the propagation of epidemics on an adaptive network of social contacts. For this purpose, we analyze the susceptible-infected-recovered model in the presence of quarantine, where susceptible

  9. Neural Networks

    International Nuclear Information System (INIS)

    Smith, Patrick I.

    2003-01-01

    Physicists use large detectors to measure particles created in high-energy collisions at particle accelerators. These detectors typically produce signals indicating either where ionization occurs along the path of the particle, or where energy is deposited by the particle. The data produced by these signals is fed into pattern recognition programs to try to identify what particles were produced, and to measure the energy and direction of these particles. Ideally, there are many techniques used in this pattern recognition software. One technique, neural networks, is particularly suitable for identifying what type of particle caused by a set of energy deposits. Neural networks can derive meaning from complicated or imprecise data, extract patterns, and detect trends that are too complex to be noticed by either humans or other computer related processes. To assist in the advancement of this technology, Physicists use a tool kit to experiment with several neural network techniques. The goal of this research is interface a neural network tool kit into Java Analysis Studio (JAS3), an application that allows data to be analyzed from any experiment. As the final result, a physicist will have the ability to train, test, and implement a neural network with the desired output while using JAS3 to analyze the results or output. Before an implementation of a neural network can take place, a firm understanding of what a neural network is and how it works is beneficial. A neural network is an artificial representation of the human brain that tries to simulate the learning process [5]. It is also important to think of the word artificial in that definition as computer programs that use calculations during the learning process. In short, a neural network learns by representative examples. Perhaps the easiest way to describe the way neural networks learn is to explain how the human brain functions. The human brain contains billions of neural cells that are responsible for processing

  10. New research shows how social media, crowdsourced data ...

    International Development Research Centre (IDRC) Digital Library (Canada)

    2016-06-07

    Jun 7, 2016 ... Spanning six months, the research used the 2013 Kenya general elections as a ... the Kenyan election found that "passive crowdsourcing" was indeed a valuable ... and the extent and culture of social media networks usage.

  11. Simulating synchronization in neuronal networks

    Science.gov (United States)

    Fink, Christian G.

    2016-06-01

    We discuss several techniques used in simulating neuronal networks by exploring how a network's connectivity structure affects its propensity for synchronous spiking. Network connectivity is generated using the Watts-Strogatz small-world algorithm, and two key measures of network structure are described. These measures quantify structural characteristics that influence collective neuronal spiking, which is simulated using the leaky integrate-and-fire model. Simulations show that adding a small number of random connections to an otherwise lattice-like connectivity structure leads to a dramatic increase in neuronal synchronization.

  12. Managing Network Partitions in Structured P2P Networks

    Science.gov (United States)

    Shafaat, Tallat M.; Ghodsi, Ali; Haridi, Seif

    Structured overlay networks form a major class of peer-to-peer systems, which are touted for their abilities to scale, tolerate failures, and self-manage. Any long-lived Internet-scale distributed system is destined to face network partitions. Consequently, the problem of network partitions and mergers is highly related to fault-tolerance and self-management in large-scale systems. This makes it a crucial requirement for building any structured peer-to-peer systems to be resilient to network partitions. Although the problem of network partitions and mergers is highly related to fault-tolerance and self-management in large-scale systems, it has hardly been studied in the context of structured peer-to-peer systems. Structured overlays have mainly been studied under churn (frequent joins/failures), which as a side effect solves the problem of network partitions, as it is similar to massive node failures. Yet, the crucial aspect of network mergers has been ignored. In fact, it has been claimed that ring-based structured overlay networks, which constitute the majority of the structured overlays, are intrinsically ill-suited for merging rings. In this chapter, we motivate the problem of network partitions and mergers in structured overlays. We discuss how a structured overlay can automatically detect a network partition and merger. We present an algorithm for merging multiple similar ring-based overlays when the underlying network merges. We examine the solution in dynamic conditions, showing how our solution is resilient to churn during the merger, something widely believed to be difficult or impossible. We evaluate the algorithm for various scenarios and show that even when falsely detecting a merger, the algorithm quickly terminates and does not clutter the network with many messages. The algorithm is flexible as the tradeoff between message complexity and time complexity can be adjusted by a parameter.

  13. Network Analysis on Attitudes: A Brief Tutorial.

    Science.gov (United States)

    Dalege, Jonas; Borsboom, Denny; van Harreveld, Frenk; van der Maas, Han L J

    2017-07-01

    In this article, we provide a brief tutorial on the estimation, analysis, and simulation on attitude networks using the programming language R. We first discuss what a network is and subsequently show how one can estimate a regularized network on typical attitude data. For this, we use open-access data on the attitudes toward Barack Obama during the 2012 American presidential election. Second, we show how one can calculate standard network measures such as community structure, centrality, and connectivity on this estimated attitude network. Third, we show how one can simulate from an estimated attitude network to derive predictions from attitude networks. By this, we highlight that network theory provides a framework for both testing and developing formalized hypotheses on attitudes and related core social psychological constructs.

  14. Exploring biological network structure with clustered random networks

    Directory of Open Access Journals (Sweden)

    Bansal Shweta

    2009-12-01

    Full Text Available Abstract Background Complex biological systems are often modeled as networks of interacting units. Networks of biochemical interactions among proteins, epidemiological contacts among hosts, and trophic interactions in ecosystems, to name a few, have provided useful insights into the dynamical processes that shape and traverse these systems. The degrees of nodes (numbers of interactions and the extent of clustering (the tendency for a set of three nodes to be interconnected are two of many well-studied network properties that can fundamentally shape a system. Disentangling the interdependent effects of the various network properties, however, can be difficult. Simple network models can help us quantify the structure of empirical networked systems and understand the impact of various topological properties on dynamics. Results Here we develop and implement a new Markov chain simulation algorithm to generate simple, connected random graphs that have a specified degree sequence and level of clustering, but are random in all other respects. The implementation of the algorithm (ClustRNet: Clustered Random Networks provides the generation of random graphs optimized according to a local or global, and relative or absolute measure of clustering. We compare our algorithm to other similar methods and show that ours more successfully produces desired network characteristics. Finding appropriate null models is crucial in bioinformatics research, and is often difficult, particularly for biological networks. As we demonstrate, the networks generated by ClustRNet can serve as random controls when investigating the impacts of complex network features beyond the byproduct of degree and clustering in empirical networks. Conclusion ClustRNet generates ensembles of graphs of specified edge structure and clustering. These graphs allow for systematic study of the impacts of connectivity and redundancies on network function and dynamics. This process is a key step in

  15. Networks as Drivers for Innovation – Experiences from Food Networks in Canada and New Zealand

    Directory of Open Access Journals (Sweden)

    Karen Hamann

    2013-02-01

    Full Text Available A common feature among networks is the focus on innovation but the approach to driving innovation and to supporting companies’ innovation work differs widely between networks. Some networks strive to be THE forum of an industry, andthese networks generally focus on promoting innovations that are market‐ready. Networks with a defined objective of promoting research‐driven innovation must have different network organisations from the forum‐oriented networks. Research shows that networks promoting research‐driven innovation also lead to patent applications and should have activities towards commercialisation support. This paper compares four networks from Canada and New Zealand in order to identify examples of how networks with different structures and objectives can support innovation in agri‐food companies. The paper is an empirical contribution to the research area of networks and innovation.

  16. Gossip algorithms in quantum networks

    International Nuclear Information System (INIS)

    Siomau, Michael

    2017-01-01

    Gossip algorithms is a common term to describe protocols for unreliable information dissemination in natural networks, which are not optimally designed for efficient communication between network entities. We consider application of gossip algorithms to quantum networks and show that any quantum network can be updated to optimal configuration with local operations and classical communication. This allows to speed-up – in the best case exponentially – the quantum information dissemination. Irrespective of the initial configuration of the quantum network, the update requiters at most polynomial number of local operations and classical communication. - Highlights: • We analyze the performance of gossip algorithms in quantum networks. • Local operations and classical communication (LOCC) can speed the performance up. • The speed-up is exponential in the best case; the number of LOCC is polynomial.

  17. Gossip algorithms in quantum networks

    Energy Technology Data Exchange (ETDEWEB)

    Siomau, Michael, E-mail: siomau@nld.ds.mpg.de [Physics Department, Jazan University, P.O. Box 114, 45142 Jazan (Saudi Arabia); Network Dynamics, Max Planck Institute for Dynamics and Self-Organization (MPIDS), 37077 Göttingen (Germany)

    2017-01-23

    Gossip algorithms is a common term to describe protocols for unreliable information dissemination in natural networks, which are not optimally designed for efficient communication between network entities. We consider application of gossip algorithms to quantum networks and show that any quantum network can be updated to optimal configuration with local operations and classical communication. This allows to speed-up – in the best case exponentially – the quantum information dissemination. Irrespective of the initial configuration of the quantum network, the update requiters at most polynomial number of local operations and classical communication. - Highlights: • We analyze the performance of gossip algorithms in quantum networks. • Local operations and classical communication (LOCC) can speed the performance up. • The speed-up is exponential in the best case; the number of LOCC is polynomial.

  18. Vulnerability of complex networks

    Science.gov (United States)

    Mishkovski, Igor; Biey, Mario; Kocarev, Ljupco

    2011-01-01

    We consider normalized average edge betweenness of a network as a metric of network vulnerability. We suggest that normalized average edge betweenness together with is relative difference when certain number of nodes and/or edges are removed from the network is a measure of network vulnerability, called vulnerability index. Vulnerability index is calculated for four synthetic networks: Erdős-Rényi (ER) random networks, Barabási-Albert (BA) model of scale-free networks, Watts-Strogatz (WS) model of small-world networks, and geometric random networks. Real-world networks for which vulnerability index is calculated include: two human brain networks, three urban networks, one collaboration network, and two power grid networks. We find that WS model of small-world networks and biological networks (human brain networks) are the most robust networks among all networks studied in the paper.

  19. Networks amid multiple logics

    DEFF Research Database (Denmark)

    Bergenholtz, Carsten; Bjerregaard, Toke

    The present study investigates how a high-tech-small-firm (HTSF) can carry out an inter-organizational search of actors located at universities. Responding to calls to study how firms navigate multiple institutional norms, this research examines the different strategies used by a HTSF to balance...... adopted academic norm-sets, commercial imperatives and formal regulations to support formation of networks and collaborations with universities. The findings show how the significance of weak and strong ties for the formation of collaborations and networks with universities is relative...

  20. Network Survivability

    DEFF Research Database (Denmark)

    Marzo, José L.; Stidsen, Thomas Riis; Ruepp, Sarah Renée

    2010-01-01

    – are vital to modern services such as mobile telephony, online banking and VoIP. This book examines communication networking from a mathematical viewpoint. The contributing authors took part in the European COST action 293 – a four-year program of multidisciplinary research on this subject. In this book...... they offer introductory overviews and state-of-the-art assessments of current and future research in the fields of broadband, optical, wireless and ad hoc networks. Particular topics of interest are design, optimization, robustness and energy consumption. The book will be of interest to graduate students......, researchers and practitioners in the areas of networking, theoretical computer science, operations research, distributed computing and mathematics....

  1. Nuclear networking.

    Science.gov (United States)

    Xie, Wei; Burke, Brian

    2017-07-04

    Nuclear lamins are intermediate filament proteins that represent important structural components of metazoan nuclear envelopes (NEs). By combining proteomics and superresolution microscopy, we recently reported that both A- and B-type nuclear lamins form spatially distinct filament networks at the nuclear periphery of mouse fibroblasts. In particular, A-type lamins exhibit differential association with nuclear pore complexes (NPCs). Our studies reveal that the nuclear lamina network in mammalian somatic cells is less ordered and more complex than that of amphibian oocytes, the only other system in which the lamina has been visualized at high resolution. In addition, the NPC component Tpr likely links NPCs to the A-type lamin network, an association that appears to be regulated by C-terminal modification of various A-type lamin isoforms. Many questions remain, however, concerning the structure and assembly of lamin filaments, as well as with their mode of association with other nuclear components such as peripheral chromatin.

  2. Telecommunication Networks

    DEFF Research Database (Denmark)

    Olsen, Rasmus Løvenstein; Balachandran, Kartheepan; Hald, Sara Ligaard

    2014-01-01

    In this chapter, we look into the role of telecommunication networks and their capability of supporting critical infrastructure systems and applications. The focus is on smart grids as the key driving example, bearing in mind that other such systems do exist, e.g., water management, traffic control......, etc. First, the role of basic communication is examined with a focus on critical infrastructures. We look at heterogenic networks and standards for smart grids, to give some insight into what has been done to ensure inter-operability in this direction. We then go to the physical network, and look...... threats to the critical infrastructure. Finally, before our conclusions and outlook, we give a brief overview of some key activities in the field and what research directions are currently investigated....

  3. Network interruptions

    CERN Multimedia

    2005-01-01

    On Sunday 12 June 2005, a site-wide security software upgrade will be performed on all CERN network equipment. This maintenance operation will cause at least 2 short network interruptions of 2 minutes on each equipment item. There are hundreds of such items across the CERN site (Meyrin, Prévessin and all SPS and LHC pits), and it will thus take the whole day to treat them all. All network users and services will be affected. Central batch computing services will be interrupted during this period, expected to last from 8 a.m. until late evening. Job submission will still be possible but no jobs will actually be run. It is hoped to complete the computer centre upgrades in the morning so that stable access can be restored to lxplus, afs and nice services as soon as possible; this cannot be guaranteed, however. The opportunity will be used to interrupt and perform upgrades on the CERN Document Servers.

  4. Basketball Teams as Strategic Networks

    Science.gov (United States)

    Fewell, Jennifer H.; Armbruster, Dieter; Ingraham, John; Petersen, Alexander; Waters, James S.

    2012-01-01

    We asked how team dynamics can be captured in relation to function by considering games in the first round of the NBA 2010 play-offs as networks. Defining players as nodes and ball movements as links, we analyzed the network properties of degree centrality, clustering, entropy and flow centrality across teams and positions, to characterize the game from a network perspective and to determine whether we can assess differences in team offensive strategy by their network properties. The compiled network structure across teams reflected a fundamental attribute of basketball strategy. They primarily showed a centralized ball distribution pattern with the point guard in a leadership role. However, individual play-off teams showed variation in their relative involvement of other players/positions in ball distribution, reflected quantitatively by differences in clustering and degree centrality. We also characterized two potential alternate offensive strategies by associated variation in network structure: (1) whether teams consistently moved the ball towards their shooting specialists, measured as “uphill/downhill” flux, and (2) whether they distributed the ball in a way that reduced predictability, measured as team entropy. These network metrics quantified different aspects of team strategy, with no single metric wholly predictive of success. However, in the context of the 2010 play-offs, the values of clustering (connectedness across players) and network entropy (unpredictability of ball movement) had the most consistent association with team advancement. Our analyses demonstrate the utility of network approaches in quantifying team strategy and show that testable hypotheses can be evaluated using this approach. These analyses also highlight the richness of basketball networks as a dataset for exploring the relationships between network structure and dynamics with team organization and effectiveness. PMID:23139744

  5. Basketball teams as strategic networks.

    Science.gov (United States)

    Fewell, Jennifer H; Armbruster, Dieter; Ingraham, John; Petersen, Alexander; Waters, James S

    2012-01-01

    We asked how team dynamics can be captured in relation to function by considering games in the first round of the NBA 2010 play-offs as networks. Defining players as nodes and ball movements as links, we analyzed the network properties of degree centrality, clustering, entropy and flow centrality across teams and positions, to characterize the game from a network perspective and to determine whether we can assess differences in team offensive strategy by their network properties. The compiled network structure across teams reflected a fundamental attribute of basketball strategy. They primarily showed a centralized ball distribution pattern with the point guard in a leadership role. However, individual play-off teams showed variation in their relative involvement of other players/positions in ball distribution, reflected quantitatively by differences in clustering and degree centrality. We also characterized two potential alternate offensive strategies by associated variation in network structure: (1) whether teams consistently moved the ball towards their shooting specialists, measured as "uphill/downhill" flux, and (2) whether they distributed the ball in a way that reduced predictability, measured as team entropy. These network metrics quantified different aspects of team strategy, with no single metric wholly predictive of success. However, in the context of the 2010 play-offs, the values of clustering (connectedness across players) and network entropy (unpredictability of ball movement) had the most consistent association with team advancement. Our analyses demonstrate the utility of network approaches in quantifying team strategy and show that testable hypotheses can be evaluated using this approach. These analyses also highlight the richness of basketball networks as a dataset for exploring the relationships between network structure and dynamics with team organization and effectiveness.

  6. Basketball teams as strategic networks.

    Directory of Open Access Journals (Sweden)

    Jennifer H Fewell

    Full Text Available We asked how team dynamics can be captured in relation to function by considering games in the first round of the NBA 2010 play-offs as networks. Defining players as nodes and ball movements as links, we analyzed the network properties of degree centrality, clustering, entropy and flow centrality across teams and positions, to characterize the game from a network perspective and to determine whether we can assess differences in team offensive strategy by their network properties. The compiled network structure across teams reflected a fundamental attribute of basketball strategy. They primarily showed a centralized ball distribution pattern with the point guard in a leadership role. However, individual play-off teams showed variation in their relative involvement of other players/positions in ball distribution, reflected quantitatively by differences in clustering and degree centrality. We also characterized two potential alternate offensive strategies by associated variation in network structure: (1 whether teams consistently moved the ball towards their shooting specialists, measured as "uphill/downhill" flux, and (2 whether they distributed the ball in a way that reduced predictability, measured as team entropy. These network metrics quantified different aspects of team strategy, with no single metric wholly predictive of success. However, in the context of the 2010 play-offs, the values of clustering (connectedness across players and network entropy (unpredictability of ball movement had the most consistent association with team advancement. Our analyses demonstrate the utility of network approaches in quantifying team strategy and show that testable hypotheses can be evaluated using this approach. These analyses also highlight the richness of basketball networks as a dataset for exploring the relationships between network structure and dynamics with team organization and effectiveness.

  7. Fractal and multifractal analyses of bipartite networks

    Science.gov (United States)

    Liu, Jin-Long; Wang, Jian; Yu, Zu-Guo; Xie, Xian-Hua

    2017-03-01

    Bipartite networks have attracted considerable interest in various fields. Fractality and multifractality of unipartite (classical) networks have been studied in recent years, but there is no work to study these properties of bipartite networks. In this paper, we try to unfold the self-similarity structure of bipartite networks by performing the fractal and multifractal analyses for a variety of real-world bipartite network data sets and models. First, we find the fractality in some bipartite networks, including the CiteULike, Netflix, MovieLens (ml-20m), Delicious data sets and (u, v)-flower model. Meanwhile, we observe the shifted power-law or exponential behavior in other several networks. We then focus on the multifractal properties of bipartite networks. Our results indicate that the multifractality exists in those bipartite networks possessing fractality. To capture the inherent attribute of bipartite network with two types different nodes, we give the different weights for the nodes of different classes, and show the existence of multifractality in these node-weighted bipartite networks. In addition, for the data sets with ratings, we modify the two existing algorithms for fractal and multifractal analyses of edge-weighted unipartite networks to study the self-similarity of the corresponding edge-weighted bipartite networks. The results show that our modified algorithms are feasible and can effectively uncover the self-similarity structure of these edge-weighted bipartite networks and their corresponding node-weighted versions.

  8. Managing Networks

    DEFF Research Database (Denmark)

    Jørgensen, Heidi; Vintergaard, Christian

    Logically it seems that companies pursuing different business strategies wouldalso manage their relationships with other firms accordingly. Nevertheless, due tothe lack of research in the field of network strategies, this link still remainsinadequately examined. Based on the well-known framework...... isprovided, that the relation between a company's strategy, structure and processesin fact have a considerable influence on its pattern of network behaviour. Threecase studies from the Danish biotech industry exemplify and illustrate how acompany's strategy is directly correlated with how it manages its...... of networkbehaviour, knowing how to manage this relation becomes essential, especiallyduring the development of new strategies....

  9. Ad hoc laser networks component technology for modular spacecraft

    Science.gov (United States)

    Huang, Xiujun; Shi, Dele; Shen, Jingshi

    2017-10-01

    Distributed reconfigurable satellite is a new kind of spacecraft system, which is based on a flexible platform of modularization and standardization. Based on the module data flow analysis of the spacecraft, this paper proposes a network component of ad hoc Laser networks architecture. Low speed control network with high speed load network of Microwave-Laser communication mode, no mesh network mode, to improve the flexibility of the network. Ad hoc Laser networks component technology was developed, and carried out the related performance testing and experiment. The results showed that ad hoc Laser networks components can meet the demand of future networking between the module of spacecraft.

  10. Control of collective network chaos.

    Science.gov (United States)

    Wagemakers, Alexandre; Barreto, Ernest; Sanjuán, Miguel A F; So, Paul

    2014-06-01

    Under certain conditions, the collective behavior of a large globally-coupled heterogeneous network of coupled oscillators, as quantified by the macroscopic mean field or order parameter, can exhibit low-dimensional chaotic behavior. Recent advances describe how a small set of "reduced" ordinary differential equations can be derived that captures this mean field behavior. Here, we show that chaos control algorithms designed using the reduced equations can be successfully applied to imperfect realizations of the full network. To systematically study the effectiveness of this technique, we measure the quality of control as we relax conditions that are required for the strict accuracy of the reduced equations, and hence, the controller. Although the effects are network-dependent, we show that the method is effective for surprisingly small networks, for modest departures from global coupling, and even with mild inaccuracy in the estimate of network heterogeneity.

  11. A model of coauthorship networks

    Science.gov (United States)

    Zhou, Guochang; Li, Jianping; Xie, Zonglin

    2017-10-01

    A natural way of representing the coauthorship of authors is to use a generalization of graphs known as hypergraphs. A random geometric hypergraph model is proposed here to model coauthorship networks, which is generated by placing nodes on a region of Euclidean space randomly and uniformly, and connecting some nodes if the nodes satisfy particular geometric conditions. Two kinds of geometric conditions are designed to model the collaboration patterns of academic authorities and basic researches respectively. The conditions give geometric expressions of two causes of coauthorship: the authority and similarity of authors. By simulation and calculus, we show that the forepart of the degree distribution of the network generated by the model is mixture Poissonian, and the tail is power-law, which are similar to these of some coauthorship networks. Further, we show more similarities between the generated network and real coauthorship networks: the distribution of cardinalities of hyperedges, high clustering coefficient, assortativity, and small-world property

  12. Task control signals in pediatric Tourette syndrome show evidence of immature and anomalous functional activity

    Directory of Open Access Journals (Sweden)

    Jessica A Church

    2009-11-01

    Full Text Available Tourette Syndrome (TS is a pediatric movement disorder that may affect control signaling in the brain. Previous work has proposed a dual-networks architecture of control processing involving a task-maintenance network and an adaptive control network (Dosenbach et al., 2008. A prior resting-state functional connectivity MRI (rs-fcMRI analysis in TS has revealed functional immaturity in both putative control networks, with “anomalous” correlations (i.e. correlations outside the typical developmental range limited to the adaptive control network (Church et al., 2009. The present study used functional MRI (fMRI to study brain activity related to adaptive control (by studying start-cues signals, and to task-maintenance (by studying signals sustained across a task set. Two hypotheses from the previous rs-fcMRI results were tested. First, adaptive control (i.e., start-cue activity will be altered in TS, including activity inconsistent with typical development (“anomalous”. Second, group differences found in task maintenance (i.e., sustained activity will be consistent with functional immaturity in TS. We examined regions found through a direct comparison of adolescents with and without TS, as well as regions derived from a previous investigation that showed differences between unaffected children and adults. The TS group showed decreased start-cue signal magnitude in regions where start-cue activity is unchanged over typical development, consistent with anomalous adaptive control. The TS group also had higher magnitude sustained signals in frontal cortex regions that overlapped with regions showing differences over typical development, consistent with immature task maintenance in TS. The results demonstrate task-related fMRI signal differences anticipated by the atypical functional connectivity found previously in adolescents with TS, strengthening the evidence for functional immaturity and anomalous signaling in control networks in adolescents

  13. Probabilistic logics and probabilistic networks

    CERN Document Server

    Haenni, Rolf; Wheeler, Gregory; Williamson, Jon; Andrews, Jill

    2014-01-01

    Probabilistic Logic and Probabilistic Networks presents a groundbreaking framework within which various approaches to probabilistic logic naturally fit. Additionally, the text shows how to develop computationally feasible methods to mesh with this framework.

  14. Weighted network modules

    International Nuclear Information System (INIS)

    Farkas, Illes; Abel, Daniel; Palla, Gergely; Vicsek, Tamas

    2007-01-01

    The inclusion of link weights into the analysis of network properties allows a deeper insight into the (often overlapping) modular structure of real-world webs. We introduce a clustering algorithm clique percolation method with weights (CPMw) for weighted networks based on the concept of percolating k-cliques with high enough intensity. The algorithm allows overlaps between the modules. First, we give detailed analytical and numerical results about the critical point of weighted k-clique percolation on (weighted) Erdos-Renyi graphs. Then, for a scientist collaboration web and a stock correlation graph we compute three-link weight correlations and with the CPMw the weighted modules. After reshuffling link weights in both networks and computing the same quantities for the randomized control graphs as well, we show that groups of three or more strong links prefer to cluster together in both original graphs

  15. Gossip in Random Networks

    Science.gov (United States)

    Malarz, K.; Szvetelszky, Z.; Szekf, B.; Kulakowski, K.

    2006-11-01

    We consider the average probability X of being informed on a gossip in a given social network. The network is modeled within the random graph theory of Erd{õ}s and Rényi. In this theory, a network is characterized by two parameters: the size N and the link probability p. Our experimental data suggest three levels of social inclusion of friendship. The critical value pc, for which half of agents are informed, scales with the system size as N-gamma with gamma approx 0.68. Computer simulations show that the probability X varies with p as a sigmoidal curve. Influence of the correlations between neighbors is also evaluated: with increasing clustering coefficient C, X decreases.

  16. Networks of Learning

    Science.gov (United States)

    Bettencourt, Luis; Kaiser, David

    2004-03-01

    Based on an a historically documented example of scientific discovery - Feynman diagrams as the main calculational tool of theoretical high energy Physics - we map the time evolution of the social network of early adopters through in the US, UK, Japan and the USSR. The spread of the technique for total number of users in each region is then modelled in terms of epidemic models, highlighting parallel and divergent aspects of this analogy. We also show that transient social arrangements develop as the idea is introduced and learned, which later disappear as the technique becomes common knowledge. Such early transient is characterized by abnormally low connectivity distribution powers and by high clustering. This interesting early non-equilibrium stage of network evolution is captured by a new dynamical model for network evolution, which coincides in its long time limit with familiar preferential aggregation dynamics.

  17. Python passive network mapping P2NMAP

    CERN Document Server

    Hosmer, Chet

    2015-01-01

    Python Passive Network Mapping: P2NMAP is the first book to reveal a revolutionary and open source method for exposing nefarious network activity. The ""Heartbleed"" vulnerability has revealed significant weaknesses within enterprise environments related to the lack of a definitive mapping of network assets. In Python Passive Network Mapping, Chet Hosmer shows you how to effectively and definitively passively map networks. Active or probing methods to network mapping have traditionally been used, but they have many drawbacks - they can disrupt operations, crash systems, and - most important

  18. A Quantum Cryptography Communication Network Based on Software Defined Network

    Directory of Open Access Journals (Sweden)

    Zhang Hongliang

    2018-01-01

    Full Text Available With the development of the Internet, information security has attracted great attention in today’s society, and quantum cryptography communication network based on quantum key distribution (QKD is a very important part of this field, since the quantum key distribution combined with one-time-pad encryption scheme can guarantee the unconditional security of the information. The secret key generated by quantum key distribution protocols is a very valuable resource, so making full use of key resources is particularly important. Software definition network (SDN is a new type of network architecture, and it separates the control plane and the data plane of network devices through OpenFlow technology, thus it realizes the flexible control of the network resources. In this paper, a quantum cryptography communication network model based on SDN is proposed to realize the flexible control of quantum key resources in the whole cryptography communication network. Moreover, we propose a routing algorithm which takes into account both the hops and the end-to-end availible keys, so that the secret key generated by QKD can be used effectively. We also simulate this quantum cryptography communication network, and the result shows that based on SDN and the proposed routing algorithm the performance of this network is improved since the effective use of the quantum key resources.

  19. NETWORK, HOW? Perceptions of business people on networking practices

    Directory of Open Access Journals (Sweden)

    Saskia De Klerk

    2010-12-01

    Full Text Available Purpose: The purpose of this paper was to contribute to literature on networking from a South African perspective. Literature on networking is mainly concentrated on the European and American contexts with homogeneous groups and traditional divisions. The business landscape of South Africa thus requires more investigation. Problem investigated: Literature regarding networking in an South African context with its dynamic business environment is limited. This article addresses the concerns of how South African business owners and managers perceive networking in their businesses and specifically focus on the South African perspective. Therefore, the focus is on the perceptions of business owners and managers on current networking practices in South Africa. Methodology: A qualitative research design to uncover the rich underlying feelings of business owners and managers was used. The qualitative enquiry consisted of five focus group discussions (n=41 participants among prominent business owners and managers in the Gauteng Province, South Africa. The Gauteng Province was selected since it is the economic and innovation hub of South Africa. Findings and implications: The main findings showed the following main themes of networking that emerged from the data, and included (1 networking as a skill versus a natural ability; (2 the motivation behind networking; (3 the loci of networking; (4 the type of relationships that determine the character of the network; and (5 the relationship characteristics of successful networking. The main contribution of this is that there seems to be different networking situations and applications for different circumstances. According to the participants, it seems that networking in the South African landscape appears to be either relationship or business based. Originality and value of the research: The value of these findings lies in the fact that they contribute to networking literature from a South African perspective

  20. Percolation of interdependent network of networks

    International Nuclear Information System (INIS)

    Havlin, Shlomo; Stanley, H. Eugene; Bashan, Amir; Gao, Jianxi; Kenett, Dror Y.

    2015-01-01

    Complex networks appear in almost every aspect of science and technology. Previous work in network theory has focused primarily on analyzing single networks that do not interact with other networks, despite the fact that many real-world networks interact with and depend on each other. Very recently an analytical framework for studying the percolation properties of interacting networks has been introduced. Here we review the analytical framework and the results for percolation laws for a Network Of Networks (NONs) formed by n interdependent random networks. The percolation properties of a network of networks differ greatly from those of single isolated networks. In particular, because the constituent networks of a NON are connected by node dependencies, a NON is subject to cascading failure. When there is strong interdependent coupling between networks, the percolation transition is discontinuous (first-order) phase transition, unlike the well-known continuous second-order transition in single isolated networks. Moreover, although networks with broader degree distributions, e.g., scale-free networks, are more robust when analyzed as single networks, they become more vulnerable in a NON. We also review the effect of space embedding on network vulnerability. It is shown that for spatially embedded networks any finite fraction of dependency nodes will lead to abrupt transition

  1. Measurement methods on the complexity of network

    Institute of Scientific and Technical Information of China (English)

    LIN Lin; DING Gang; CHEN Guo-song

    2010-01-01

    Based on the size of network and the number of paths in the network,we proposed a model of topology complexity of a network to measure the topology complexity of the network.Based on the analyses of the effects of the number of the equipment,the types of equipment and the processing time of the node on the complexity of the network with the equipment-constrained,a complexity model of equipment-constrained network was constructed to measure the integrated complexity of the equipment-constrained network.The algorithms for the two models were also developed.An automatic generator of the random single label network was developed to test the models.The results show that the models can correctly evaluate the topology complexity and the integrated complexity of the networks.

  2. Thermoelectric properties of semiconductor nanowire networks

    Science.gov (United States)

    Roslyak, Oleksiy; Piryatinski, Andrei

    2016-03-01

    To examine the thermoelectric (TE) properties of a semiconductor nanowire (NW) network, we propose a theoretical approach mapping the TE network on a two-port network. In contrast to a conventional single-port (i.e., resistor) network model, our model allows for large scale calculations showing convergence of TE figure of merit, ZT, with an increasing number of junctions. Using this model, numerical simulations are performed for the Bi2Te3 branched nanowire (BNW) and Cayley tree NW (CTNW) network. We find that the phonon scattering at the network junctions plays a dominant role in enhancing the network ZT. Specifically, disordered BNW and CTNW demonstrate an order of magnitude higher ZT enhancement compared to their ordered counterparts. Formation of preferential TE pathways in CTNW makes the network effectively behave as its BNW counterpart. We provide formalism for simulating large scale nanowire networks hinged upon experimentally measurable TE parameters of a single T-junction.

  3. Capacity Analysis of Wireless Mesh Networks

    Directory of Open Access Journals (Sweden)

    M. I. Gumel

    2012-06-01

    Full Text Available The next generation wireless networks experienced a great development with emergence of wireless mesh networks (WMNs, which can be regarded as a realistic solution that provides wireless broadband access. The limited available bandwidth makes capacity analysis of the network very essential. While the network offers broadband wireless access to community and enterprise users, the problems that limit the network capacity must be addressed to exploit the optimum network performance. The wireless mesh network capacity analysis shows that the throughput of each mesh node degrades in order of l/n with increasing number of nodes (n in a linear topology. The degradation is found to be higher in a fully mesh network as a result of increase in interference and MAC layer contention in the network.

  4. Applications of Coding in Network Communications

    Science.gov (United States)

    Chang, Christopher SungWook

    2012-01-01

    This thesis uses the tool of network coding to investigate fast peer-to-peer file distribution, anonymous communication, robust network construction under uncertainty, and prioritized transmission. In a peer-to-peer file distribution system, we use a linear optimization approach to show that the network coding framework significantly simplifies…

  5. Secure Service Discovery in Home Networks

    NARCIS (Netherlands)

    Scholten, Johan; van Dijk, H.W.; De Cock, Danny; Preneel, Bart; Kung, Antonio; d'Hooge, Michel

    2006-01-01

    This paper presents an architecture for secure service discovery for use in home networks. We give an overview and rationale of a cluster-based home network architecture that bridges different, often vendor specific, network technologies. We show how it integrates security, communication, and

  6. Personalized Network-Based Treatments in Oncology

    DEFF Research Database (Denmark)

    Robin, Xavier; Creixell, Pau; Radetskaya, Oxana

    2013-01-01

    Network medicine aims at unraveling cell signaling networks to propose personalized treatments for patients suffering from complex diseases. In this short review, we show the relevance of network medicine to cancer treatment by outlining the potential convergence points of the most recent technol...

  7. Network Society

    DEFF Research Database (Denmark)

    Clausen, Lars; Tække, Jesper

    2017-01-01

    the five strands of theory on the network society. Each theoretical position has its specific implications for acting toward strategic goals. In its entirety, the five perspectives give a thorough understanding of the conditions for successful strategic communication in the 21st century....

  8. Network Society

    DEFF Research Database (Denmark)

    Clausen, Lars; Tække, Jesper

    2018-01-01

    the five strands of theory on the network society. Each theoretical position has its specific implications for acting toward strategic goals. In its entirety, the five perspectives give a thorough understanding of the conditions for successful strategic communication in the 21st century....

  9. Network Views

    Science.gov (United States)

    Alexander, Louis

    2010-01-01

    The world changed in 2008. The financial crisis brought with it a deepening sense of insecurity, and the desire to be connected to a network increased. Throughout the summer and fall of 2008, events were unfolding with alarming rapidity. The Massachusetts Institute of Technology (MIT) Alumni Association wanted to respond to this change in the…

  10. Network Coding

    Indian Academy of Sciences (India)

    Home; Journals; Resonance – Journal of Science Education; Volume 15; Issue 7. Network Coding. K V Rashmi Nihar B Shah P Vijay Kumar. General Article Volume 15 Issue 7 July 2010 pp 604-621. Fulltext. Click here to view fulltext PDF. Permanent link: https://www.ias.ac.in/article/fulltext/reso/015/07/0604-0621 ...

  11. Global Networking.

    Science.gov (United States)

    Lynch, Clifford

    1997-01-01

    Discusses the state of the Internet. Highlights include the magnitude of the infrastructure, costs, its increasing pace, constraints in international links, provision of network capacity to homes and small businesses, cable television modems, political and cultural problems, the digital library concept, search engines, the failure of personal…

  12. Nonbinary Tree-Based Phylogenetic Networks.

    Science.gov (United States)

    Jetten, Laura; van Iersel, Leo

    2018-01-01

    Rooted phylogenetic networks are used to describe evolutionary histories that contain non-treelike evolutionary events such as hybridization and horizontal gene transfer. In some cases, such histories can be described by a phylogenetic base-tree with additional linking arcs, which can, for example, represent gene transfer events. Such phylogenetic networks are called tree-based. Here, we consider two possible generalizations of this concept to nonbinary networks, which we call tree-based and strictly-tree-based nonbinary phylogenetic networks. We give simple graph-theoretic characterizations of tree-based and strictly-tree-based nonbinary phylogenetic networks. Moreover, we show for each of these two classes that it can be decided in polynomial time whether a given network is contained in the class. Our approach also provides a new view on tree-based binary phylogenetic networks. Finally, we discuss two examples of nonbinary phylogenetic networks in biology and show how our results can be applied to them.

  13. Power laws and fragility in flow networks.

    Science.gov (United States)

    Shore, Jesse; Chu, Catherine J; Bianchi, Matt T

    2013-01-01

    What makes economic and ecological networks so unlike other highly skewed networks in their tendency toward turbulence and collapse? Here, we explore the consequences of a defining feature of these networks: their nodes are tied together by flow. We show that flow networks tend to the power law degree distribution (PLDD) due to a self-reinforcing process involving position within the global network structure, and thus present the first random graph model for PLDDs that does not depend on a rich-get-richer function of nodal degree. We also show that in contrast to non-flow networks, PLDD flow networks are dramatically more vulnerable to catastrophic failure than non-PLDD flow networks, a finding with potential explanatory power in our age of resource- and financial-interdependence and turbulence.

  14. Wireless home networking for dummies

    CERN Document Server

    Briere, Danny; Ferris, Edward

    2010-01-01

    The perennial bestseller shows you how share your files and Internet connection across a wireless network. Fully updated for Windows 7 and Mac OS X Snow Leopard, this new edition of this bestseller returns with all the latest in wireless standards and security. This fun and friendly guide shows you how to integrate your iPhone, iPod touch, smartphone, or gaming system into your home network. Veteran authors escort you through the various financial and logisitical considerations that you need to take into account before building a wireless network at home.: Covers the basics of planning, instal

  15. Author's reply to 'Comment on 'Plutonium chemistry: a synthesis of experimental data and a quantitative model for plutonium oxide solubility' by J.M. Haschke and V.M. Oversby'

    International Nuclear Information System (INIS)

    Haschke, John M.

    2004-01-01

    In the accompanying letter, Newton and Hobart comment on a recent paper [J. Nucl. Mater. 305 (2002) 187] and conclude that a proposed alternative explanation for self-reduction of Pu(VI) is based on misinterpretation of data. Result of quantitative kinetic modeling contradicts this conclusion and the accepted explanation by showing that self-induced α-particle reduction of 239 Pu(VI) at pH 1.5 does not account for the observed reduction rate of Pu(VI) or for dependence of the rate on [Pu(VI)]. Similar modeling shows that kinetic behavior is consistent with a self-reduction process based on disproportionation of Pu(VI). Validity of the alternative concept is supported by close similarities in the kinetic behavior of Pu(V) and Pu(VI)

  16. Organization of excitable dynamics in hierarchical biological networks.

    Directory of Open Access Journals (Sweden)

    Mark Müller-Linow

    Full Text Available This study investigates the contributions of network topology features to the dynamic behavior of hierarchically organized excitable networks. Representatives of different types of hierarchical networks as well as two biological neural networks are explored with a three-state model of node activation for systematically varying levels of random background network stimulation. The results demonstrate that two principal topological aspects of hierarchical networks, node centrality and network modularity, correlate with the network activity patterns at different levels of spontaneous network activation. The approach also shows that the dynamic behavior of the cerebral cortical systems network in the cat is dominated by the network's modular organization, while the activation behavior of the cellular neuronal network of Caenorhabditis elegans is strongly influenced by hub nodes. These findings indicate the interaction of multiple topological features and dynamic states in the function of complex biological networks.

  17. Network-based identification of biomarkers coexpressed with multiple pathways.

    Science.gov (United States)

    Guo, Nancy Lan; Wan, Ying-Wooi

    2014-01-01

    Unraveling complex molecular interactions and networks and incorporating clinical information in modeling will present a paradigm shift in molecular medicine. Embedding biological relevance via modeling molecular networks and pathways has become increasingly important for biomarker identification in cancer susceptibility and metastasis studies. Here, we give a comprehensive overview of computational methods used for biomarker identification, and provide a performance comparison of several network models used in studies of cancer susceptibility, disease progression, and prognostication. Specifically, we evaluated implication networks, Boolean networks, Bayesian networks, and Pearson's correlation networks in constructing gene coexpression networks for identifying lung cancer diagnostic and prognostic biomarkers. The results show that implication networks, implemented in Genet package, identified sets of biomarkers that generated an accurate prediction of lung cancer risk and metastases; meanwhile, implication networks revealed more biologically relevant molecular interactions than Boolean networks, Bayesian networks, and Pearson's correlation networks when evaluated with MSigDB database.

  18. Entropy of dynamical social networks

    Science.gov (United States)

    Zhao, Kun; Karsai, Marton; Bianconi, Ginestra

    2012-02-01

    Dynamical social networks are evolving rapidly and are highly adaptive. Characterizing the information encoded in social networks is essential to gain insight into the structure, evolution, adaptability and dynamics. Recently entropy measures have been used to quantify the information in email correspondence, static networks and mobility patterns. Nevertheless, we still lack methods to quantify the information encoded in time-varying dynamical social networks. In this talk we present a model to quantify the entropy of dynamical social networks and use this model to analyze the data of phone-call communication. We show evidence that the entropy of the phone-call interaction network changes according to circadian rhythms. Moreover we show that social networks are extremely adaptive and are modified by the use of technologies such as mobile phone communication. Indeed the statistics of duration of phone-call is described by a Weibull distribution and is significantly different from the distribution of duration of face-to-face interactions in a conference. Finally we investigate how much the entropy of dynamical social networks changes in realistic models of phone-call or face-to face interactions characterizing in this way different type human social behavior.

  19. Modular architectures for quantum networks

    Science.gov (United States)

    Pirker, A.; Wallnöfer, J.; Dür, W.

    2018-05-01

    We consider the problem of generating multipartite entangled states in a quantum network upon request. We follow a top-down approach, where the required entanglement is initially present in the network in form of network states shared between network devices, and then manipulated in such a way that the desired target state is generated. This minimizes generation times, and allows for network structures that are in principle independent of physical links. We present a modular and flexible architecture, where a multi-layer network consists of devices of varying complexity, including quantum network routers, switches and clients, that share certain resource states. We concentrate on the generation of graph states among clients, which are resources for numerous distributed quantum tasks. We assume minimal functionality for clients, i.e. they do not participate in the complex and distributed generation process of the target state. We present architectures based on shared multipartite entangled Greenberger–Horne–Zeilinger states of different size, and fully connected decorated graph states, respectively. We compare the features of these architectures to an approach that is based on bipartite entanglement, and identify advantages of the multipartite approach in terms of memory requirements and complexity of state manipulation. The architectures can handle parallel requests, and are designed in such a way that the network state can be dynamically extended if new clients or devices join the network. For generation or dynamical extension of the network states, we propose a quantum network configuration protocol, where entanglement purification is used to establish high fidelity states. The latter also allows one to show that the entanglement generated among clients is private, i.e. the network is secure.

  20. Fitness for synchronization of network motifs

    DEFF Research Database (Denmark)

    Vega, Y.M.; Vázquez-Prada, M.; Pacheco, A.F.

    2004-01-01

    We study the synchronization of Kuramoto's oscillators in small parts of networks known as motifs. We first report on the system dynamics for the case of a scale-free network and show the existence of a non-trivial critical point. We compute the probability that network motifs synchronize, and fi...... that the fitness for synchronization correlates well with motifs interconnectedness and structural complexity. Possible implications for present debates about network evolution in biological and other systems are discussed....

  1. Associative memory in phasing neuron networks

    Energy Technology Data Exchange (ETDEWEB)

    Nair, Niketh S [ORNL; Bochove, Erik J. [United States Air Force Research Laboratory, Kirtland Air Force Base; Braiman, Yehuda [ORNL

    2014-01-01

    We studied pattern formation in a network of coupled Hindmarsh-Rose model neurons and introduced a new model for associative memory retrieval using networks of Kuramoto oscillators. Hindmarsh-Rose Neural Networks can exhibit a rich set of collective dynamics that can be controlled by their connectivity. Specifically, we showed an instance of Hebb's rule where spiking was correlated with network topology. Based on this, we presented a simple model of associative memory in coupled phase oscillators.

  2. Self-Interested Routing in Queueing Networks

    OpenAIRE

    Ali K. Parlaktürk; Sunil Kumar

    2004-01-01

    We study self-interested routing in stochastic networks, taking into account the discrete stochastic dynamics of such networks. We analyze a two-station multiclass queueing network in which the system manager chooses the scheduling rule and individual customers choose routes in a self-interested manner. We show that this network can be unstable in Nash equilibrium under some scheduling rules. We also design a nontrivial scheduling rule that negates the performance degradation resulting from s...

  3. Percolation of secret correlations in a network

    OpenAIRE

    Leverrier, Anthony; García-Patrón, Raúl

    2011-01-01

    In this work, we explore the analogy between entanglement and secret classical correlations in the context of large networks, more precisely the question of percolation of secret correlations in a network. It is known that entanglement percolation in quantum networks can display a highly nontrivial behavior depending on the topology of the network and on the presence of entanglement between the nodes. Here we show that this behavior, thought to be of a genuine quantum nature, also occurs in a...

  4. Percolation of secret correlations in a network

    Energy Technology Data Exchange (ETDEWEB)

    Leverrier, Anthony; Garcia-Patron, Raul [ICFO-Institut de Ciencies Fotoniques, 08860 Castelldefels (Barcelona) (Spain); Research Laboratory of Electronics, MIT, Cambridge, MA 02139 (United States) and Max-Planck Institut fur Quantenoptik, Hans-Kopfermann Str. 1, D-85748 Garching (Germany)

    2011-09-15

    In this work, we explore the analogy between entanglement and secret classical correlations in the context of large networks--more precisely, the question of percolation of secret correlations in a network. It is known that entanglement percolation in quantum networks can display a highly nontrivial behavior depending on the topology of the network and on the presence of entanglement between the nodes. Here we show that this behavior, thought to be of a genuine quantum nature, also occurs in a classical context.

  5. Percolation of secret correlations in a network

    International Nuclear Information System (INIS)

    Leverrier, Anthony; Garcia-Patron, Raul

    2011-01-01

    In this work, we explore the analogy between entanglement and secret classical correlations in the context of large networks--more precisely, the question of percolation of secret correlations in a network. It is known that entanglement percolation in quantum networks can display a highly nontrivial behavior depending on the topology of the network and on the presence of entanglement between the nodes. Here we show that this behavior, thought to be of a genuine quantum nature, also occurs in a classical context.

  6. Survey of network and information security technology

    International Nuclear Information System (INIS)

    Liu Baoxu; Wang Xiaozhen

    2007-01-01

    With the rapidly development of the computer network technology and informationize working of our Country, Network and Information Security issues becomes the focal point problem that people shows solicitude for. On the basis analysing security threat and challenge of network information and their developing trend. This paper briefly analyses and discusses the main relatively study direction and content about the theory, technology and practice of Network and Information Security. (authors)

  7. Distance metric learning for complex networks: Towards size-independent comparison of network structures

    Science.gov (United States)

    Aliakbary, Sadegh; Motallebi, Sadegh; Rashidian, Sina; Habibi, Jafar; Movaghar, Ali

    2015-02-01

    Real networks show nontrivial topological properties such as community structure and long-tail degree distribution. Moreover, many network analysis applications are based on topological comparison of complex networks. Classification and clustering of networks, model selection, and anomaly detection are just some applications of network comparison. In these applications, an effective similarity metric is needed which, given two complex networks of possibly different sizes, evaluates the amount of similarity between the structural features of the two networks. Traditional graph comparison approaches, such as isomorphism-based methods, are not only too time consuming but also inappropriate to compare networks with different sizes. In this paper, we propose an intelligent method based on the genetic algorithms for integrating, selecting, and weighting the network features in order to develop an effective similarity measure for complex networks. The proposed similarity metric outperforms state of the art methods with respect to different evaluation criteria.

  8. Social networks in primates: smart and tolerant species have more efficient networks.

    Science.gov (United States)

    Pasquaretta, Cristian; Levé, Marine; Claidière, Nicolas; van de Waal, Erica; Whiten, Andrew; MacIntosh, Andrew J J; Pelé, Marie; Bergstrom, Mackenzie L; Borgeaud, Christèle; Brosnan, Sarah F; Crofoot, Margaret C; Fedigan, Linda M; Fichtel, Claudia; Hopper, Lydia M; Mareno, Mary Catherine; Petit, Odile; Schnoell, Anna Viktoria; di Sorrentino, Eugenia Polizzi; Thierry, Bernard; Tiddi, Barbara; Sueur, Cédric

    2014-12-23

    Network optimality has been described in genes, proteins and human communicative networks. In the latter, optimality leads to the efficient transmission of information with a minimum number of connections. Whilst studies show that differences in centrality exist in animal networks with central individuals having higher fitness, network efficiency has never been studied in animal groups. Here we studied 78 groups of primates (24 species). We found that group size and neocortex ratio were correlated with network efficiency. Centralisation (whether several individuals are central in the group) and modularity (how a group is clustered) had opposing effects on network efficiency, showing that tolerant species have more efficient networks. Such network properties affecting individual fitness could be shaped by natural selection. Our results are in accordance with the social brain and cultural intelligence hypotheses, which suggest that the importance of network efficiency and information flow through social learning relates to cognitive abilities.

  9. Social networks in primates: smart and tolerant species have more efficient networks

    Science.gov (United States)

    Pasquaretta, Cristian; Levé, Marine; Claidière, Nicolas; van de Waal, Erica; Whiten, Andrew; MacIntosh, Andrew J. J.; Pelé, Marie; Bergstrom, Mackenzie L.; Borgeaud, Christèle; Brosnan, Sarah F.; Crofoot, Margaret C.; Fedigan, Linda M.; Fichtel, Claudia; Hopper, Lydia M.; Mareno, Mary Catherine; Petit, Odile; Schnoell, Anna Viktoria; di Sorrentino, Eugenia Polizzi; Thierry, Bernard; Tiddi, Barbara; Sueur, Cédric

    2014-01-01

    Network optimality has been described in genes, proteins and human communicative networks. In the latter, optimality leads to the efficient transmission of information with a minimum number of connections. Whilst studies show that differences in centrality exist in animal networks with central individuals having higher fitness, network efficiency has never been studied in animal groups. Here we studied 78 groups of primates (24 species). We found that group size and neocortex ratio were correlated with network efficiency. Centralisation (whether several individuals are central in the group) and modularity (how a group is clustered) had opposing effects on network efficiency, showing that tolerant species have more efficient networks. Such network properties affecting individual fitness could be shaped by natural selection. Our results are in accordance with the social brain and cultural intelligence hypotheses, which suggest that the importance of network efficiency and information flow through social learning relates to cognitive abilities. PMID:25534964

  10. Measuring the evolutionary rewiring of biological networks.

    Directory of Open Access Journals (Sweden)

    Chong Shou

    Full Text Available We have accumulated a large amount of biological network data and expect even more to come. Soon, we anticipate being able to compare many different biological networks as we commonly do for molecular sequences. It has long been believed that many of these networks change, or "rewire", at different rates. It is therefore important to develop a framework to quantify the differences between networks in a unified fashion. We developed such a formalism based on analogy to simple models of sequence evolution, and used it to conduct a systematic study of network rewiring on all the currently available biological networks. We found that, similar to sequences, biological networks show a decreased rate of change at large time divergences, because of saturation in potential substitutions. However, different types of biological networks consistently rewire at different rates. Using comparative genomics and proteomics data, we found a consistent ordering of the rewiring rates: transcription regulatory, phosphorylation regulatory, genetic interaction, miRNA regulatory, protein interaction, and metabolic pathway network, from fast to slow. This ordering was found in all comparisons we did of matched networks between organisms. To gain further intuition on network rewiring, we compared our observed rewirings with those obtained from simulation. We also investigated how readily our formalism could be mapped to other network contexts; in particular, we showed how it could be applied to analyze changes in a range of "commonplace" networks such as family trees, co-authorships and linux-kernel function dependencies.

  11. Ecological network analysis: network construction

    NARCIS (Netherlands)

    Fath, B.D.; Scharler, U.M.; Ulanowicz, R.E.; Hannon, B.

    2007-01-01

    Ecological network analysis (ENA) is a systems-oriented methodology to analyze within system interactions used to identify holistic properties that are otherwise not evident from the direct observations. Like any analysis technique, the accuracy of the results is as good as the data available, but

  12. Network Bandwidth Utilization Forecast Model on High Bandwidth Network

    Energy Technology Data Exchange (ETDEWEB)

    Yoo, Wucherl; Sim, Alex

    2014-07-07

    With the increasing number of geographically distributed scientific collaborations and the scale of the data size growth, it has become more challenging for users to achieve the best possible network performance on a shared network. We have developed a forecast model to predict expected bandwidth utilization for high-bandwidth wide area network. The forecast model can improve the efficiency of resource utilization and scheduling data movements on high-bandwidth network to accommodate ever increasing data volume for large-scale scientific data applications. Univariate model is developed with STL and ARIMA on SNMP path utilization data. Compared with traditional approach such as Box-Jenkins methodology, our forecast model reduces computation time by 83.2percent. It also shows resilience against abrupt network usage change. The accuracy of the forecast model is within the standard deviation of the monitored measurements.

  13. Network bandwidth utilization forecast model on high bandwidth networks

    Energy Technology Data Exchange (ETDEWEB)

    Yoo, Wuchert (William) [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Sim, Alex [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)

    2015-03-30

    With the increasing number of geographically distributed scientific collaborations and the scale of the data size growth, it has become more challenging for users to achieve the best possible network performance on a shared network. We have developed a forecast model to predict expected bandwidth utilization for high-bandwidth wide area network. The forecast model can improve the efficiency of resource utilization and scheduling data movements on high-bandwidth network to accommodate ever increasing data volume for large-scale scientific data applications. Univariate model is developed with STL and ARIMA on SNMP path utilization data. Compared with traditional approach such as Box-Jenkins methodology, our forecast model reduces computation time by 83.2%. It also shows resilience against abrupt network usage change. The accuracy of the forecast model is within the standard deviation of the monitored measurements.

  14. Optical network control plane for multi-domain networking

    DEFF Research Database (Denmark)

    Manolova, Anna Vasileva

    This thesis focuses on multi-domain routing for traffice engineering and survivability support in optical transport networks under the Generalized Multi-Protocol Label Switching (GMPLS) control framework. First, different extensions to the Border Gateway Protocol for multi-domain Traffic...... process are not enough for efficient TE in mesh multi-domain networks. Enhancing the protocol with multi-path dissemination capability, combined with the employment of an end-to-end TE metric proves to be a highly efficient solution. Simulation results show good performance characteristics of the proposed...... is not as essential for improved network performance as the length of the provided paths. Second, the issue of multi-domain survivability support is analyzed. An AS-disjoint paths is beneficial not only for resilience support, but also for facilitating adequate network reactions to changes in the network, which...

  15. Robustness and structure of complex networks

    Science.gov (United States)

    Shao, Shuai

    This dissertation covers the two major parts of my PhD research on statistical physics and complex networks: i) modeling a new type of attack -- localized attack, and investigating robustness of complex networks under this type of attack; ii) discovering the clustering structure in complex networks and its influence on the robustness of coupled networks. Complex networks appear in every aspect of our daily life and are widely studied in Physics, Mathematics, Biology, and Computer Science. One important property of complex networks is their robustness under attacks, which depends crucially on the nature of attacks and the structure of the networks themselves. Previous studies have focused on two types of attack: random attack and targeted attack, which, however, are insufficient to describe many real-world damages. Here we propose a new type of attack -- localized attack, and study the robustness of complex networks under this type of attack, both analytically and via simulation. On the other hand, we also study the clustering structure in the network, and its influence on the robustness of a complex network system. In the first part, we propose a theoretical framework to study the robustness of complex networks under localized attack based on percolation theory and generating function method. We investigate the percolation properties, including the critical threshold of the phase transition pc and the size of the giant component Pinfinity. We compare localized attack with random attack and find that while random regular (RR) networks are more robust against localized attack, Erdoḧs-Renyi (ER) networks are equally robust under both types of attacks. As for scale-free (SF) networks, their robustness depends crucially on the degree exponent lambda. The simulation results show perfect agreement with theoretical predictions. We also test our model on two real-world networks: a peer-to-peer computer network and an airline network, and find that the real-world networks

  16. Neural Networks

    Directory of Open Access Journals (Sweden)

    Schwindling Jerome

    2010-04-01

    Full Text Available This course presents an overview of the concepts of the neural networks and their aplication in the framework of High energy physics analyses. After a brief introduction on the concept of neural networks, the concept is explained in the frame of neuro-biology, introducing the concept of multi-layer perceptron, learning and their use as data classifer. The concept is then presented in a second part using in more details the mathematical approach focussing on typical use cases faced in particle physics. Finally, the last part presents the best way to use such statistical tools in view of event classifers, putting the emphasis on the setup of the multi-layer perceptron. The full article (15 p. corresponding to this lecture is written in french and is provided in the proceedings of the book SOS 2008.

  17. A random network based, node attraction facilitated network evolution method

    Directory of Open Access Journals (Sweden)

    WenJun Zhang

    2016-03-01

    Full Text Available In present study, I present a method of network evolution that based on random network, and facilitated by node attraction. In this method, I assume that the initial network is a random network, or a given initial network. When a node is ready to connect, it tends to link to the node already owning the most connections, which coincides with the general rule (Barabasi and Albert, 1999 of node connecting. In addition, a node may randomly disconnect a connection i.e., the addition of connections in the network is accompanied by the pruning of some connections. The dynamics of network evolution is determined of the attraction factor Lamda of nodes, the probability of node connection, the probability of node disconnection, and the expected initial connectance. The attraction factor of nodes, the probability of node connection, and the probability of node disconnection are time and node varying. Various dynamics can be achieved by adjusting these parameters. Effects of simplified parameters on network evolution are analyzed. The changes of attraction factor Lamda can reflect various effects of the node degree on connection mechanism. Even the changes of Lamda only will generate various networks from the random to the complex. Therefore, the present algorithm can be treated as a general model for network evolution. Modeling results show that to generate a power-law type of network, the likelihood of a node attracting connections is dependent upon the power function of the node's degree with a higher-order power. Matlab codes for simplified version of the method are provided.

  18. Network-based functional enrichment

    Directory of Open Access Journals (Sweden)

    Poirel Christopher L

    2011-11-01

    Full Text Available Abstract Background Many methods have been developed to infer and reason about molecular interaction networks. These approaches often yield networks with hundreds or thousands of nodes and up to an order of magnitude more edges. It is often desirable to summarize the biological information in such networks. A very common approach is to use gene function enrichment analysis for this task. A major drawback of this method is that it ignores information about the edges in the network being analyzed, i.e., it treats the network simply as a set of genes. In this paper, we introduce a novel method for functional enrichment that explicitly takes network interactions into account. Results Our approach naturally generalizes Fisher’s exact test, a gene set-based technique. Given a function of interest, we compute the subgraph of the network induced by genes annotated to this function. We use the sequence of sizes of the connected components of this sub-network to estimate its connectivity. We estimate the statistical significance of the connectivity empirically by a permutation test. We present three applications of our method: i determine which functions are enriched in a given network, ii given a network and an interesting sub-network of genes within that network, determine which functions are enriched in the sub-network, and iii given two networks, determine the functions for which the connectivity improves when we merge the second network into the first. Through these applications, we show that our approach is a natural alternative to network clustering algorithms. Conclusions We presented a novel approach to functional enrichment that takes into account the pairwise relationships among genes annotated by a particular function. Each of the three applications discovers highly relevant functions. We used our methods to study biological data from three different organisms. Our results demonstrate the wide applicability of our methods. Our algorithms are

  19. Feedback Networks

    OpenAIRE

    Zamir, Amir R.; Wu, Te-Lin; Sun, Lin; Shen, William; Malik, Jitendra; Savarese, Silvio

    2016-01-01

    Currently, the most successful learning models in computer vision are based on learning successive representations followed by a decision layer. This is usually actualized through feedforward multilayer neural networks, e.g. ConvNets, where each layer forms one of such successive representations. However, an alternative that can achieve the same goal is a feedback based approach in which the representation is formed in an iterative manner based on a feedback received from previous iteration's...

  20. Linear network theory

    CERN Document Server

    Sander, K F

    1964-01-01

    Linear Network Theory covers the significant algebraic aspect of network theory, with minimal reference to practical circuits. The book begins the presentation of network analysis with the exposition of networks containing resistances only, and follows it up with a discussion of networks involving inductance and capacity by way of the differential equations. Classification and description of certain networks, equivalent networks, filter circuits, and network functions are also covered. Electrical engineers, technicians, electronics engineers, electricians, and students learning the intricacies

  1. An RTT-Aware Virtual Machine Placement Method

    Directory of Open Access Journals (Sweden)

    Li Quan

    2017-12-01

    Full Text Available Virtualization is a key technology for mobile cloud computing (MCC and the virtual machine (VM is a core component of virtualization. VM provides a relatively independent running environment for different applications. Therefore, the VM placement problem focuses on how to place VMs on optimal physical machines, which ensures efficient use of resources and the quality of service, etc. Most previous work focuses on energy consumption, network traffic between VMs and so on and rarely consider the delay for end users’ requests. In contrast, the latency between requests and VMs is considered in this paper for the scenario of optimal VM placement in MCC. In order to minimize average RTT for all requests, the round-trip time (RTT is first used as the metric for the latency of requests. Based on our proposed RTT metric, an RTT-Aware VM placement algorithm is then proposed to minimize the average RTT. Furthermore, the case in which one of the core switches does not work is considered. A VM rescheduling algorithm is proposed to keep the average RTT lower and reduce the fluctuation of the average RTT. Finally, in the simulation study, our algorithm shows its advantage over existing methods, including random placement, the traffic-aware VM placement algorithm and the remaining utilization-aware algorithm.

  2. Is my network module preserved and reproducible?

    Directory of Open Access Journals (Sweden)

    Peter Langfelder

    2011-01-01

    Full Text Available In many applications, one is interested in determining which of the properties of a network module change across conditions. For example, to validate the existence of a module, it is desirable to show that it is reproducible (or preserved in an independent test network. Here we study several types of network preservation statistics that do not require a module assignment in the test network. We distinguish network preservation statistics by the type of the underlying network. Some preservation statistics are defined for a general network (defined by an adjacency matrix while others are only defined for a correlation network (constructed on the basis of pairwise correlations between numeric variables. Our applications show that the correlation structure facilitates the definition of particularly powerful module preservation statistics. We illustrate that evaluating module preservation is in general different from evaluating cluster preservation. We find that it is advantageous to aggregate multiple preservation statistics into summary preservation statistics. We illustrate the use of these methods in six gene co-expression network applications including 1 preservation of cholesterol biosynthesis pathway in mouse tissues, 2 comparison of human and chimpanzee brain networks, 3 preservation of selected KEGG pathways between human and chimpanzee brain networks, 4 sex differences in human cortical networks, 5 sex differences in mouse liver networks. While we find no evidence for sex specific modules in human cortical networks, we find that several human cortical modules are less preserved in chimpanzees. In particular, apoptosis genes are differentially co-expressed between humans and chimpanzees. Our simulation studies and applications show that module preservation statistics are useful for studying differences between the modular structure of networks. Data, R software and accompanying tutorials can be downloaded from the following webpage: http

  3. The modularity of pollination networks

    DEFF Research Database (Denmark)

    Olesen, Jens Mogens; Bascompte, J.; Dupont, Yoko

    2007-01-01

    In natural communities, species and their interactions are often organized as nonrandom networks, showing distinct and repeated complex patterns. A prevalent, but poorly explored pattern is ecological modularity, with weakly interlinked subsets of species (modules), which, however, internally...... consist of strongly connected species. The importance of modularity has been discussed for a long time, but no consensus on its prevalence in ecological networks has yet been reached. Progress is hampered by inadequate methods and a lack of large datasets. We analyzed 51 pollination networks including...... almost 10,000 species and 20,000 links and tested for modularity by using a recently developed simulated annealing algorithm. All networks with >150 plant and pollinator species were modular, whereas networks with

  4. Network Dynamics of Innovation Processes

    Science.gov (United States)

    Iacopini, Iacopo; Milojević, Staša; Latora, Vito

    2018-01-01

    We introduce a model for the emergence of innovations, in which cognitive processes are described as random walks on the network of links among ideas or concepts, and an innovation corresponds to the first visit of a node. The transition matrix of the random walk depends on the network weights, while in turn the weight of an edge is reinforced by the passage of a walker. The presence of the network naturally accounts for the mechanism of the "adjacent possible," and the model reproduces both the rate at which novelties emerge and the correlations among them observed empirically. We show this by using synthetic networks and by studying real data sets on the growth of knowledge in different scientific disciplines. Edge-reinforced random walks on complex topologies offer a new modeling framework for the dynamics of correlated novelties and are another example of coevolution of processes and networks.

  5. Modeling the citation network by network cosmology.

    Science.gov (United States)

    Xie, Zheng; Ouyang, Zhenzheng; Zhang, Pengyuan; Yi, Dongyun; Kong, Dexing

    2015-01-01

    Citation between papers can be treated as a causal relationship. In addition, some citation networks have a number of similarities to the causal networks in network cosmology, e.g., the similar in-and out-degree distributions. Hence, it is possible to model the citation network using network cosmology. The casual network models built on homogenous spacetimes have some restrictions when describing some phenomena in citation networks, e.g., the hot papers receive more citations than other simultaneously published papers. We propose an inhomogenous causal network model to model the citation network, the connection mechanism of which well expresses some features of citation. The node growth trend and degree distributions of the generated networks also fit those of some citation networks well.

  6. Analyzing Multimode Wireless Sensor Networks Using the Network Calculus

    Directory of Open Access Journals (Sweden)

    Xi Jin

    2015-01-01

    Full Text Available The network calculus is a powerful tool to analyze the performance of wireless sensor networks. But the original network calculus can only model the single-mode wireless sensor network. In this paper, we combine the original network calculus with the multimode model to analyze the maximum delay bound of the flow of interest in the multimode wireless sensor network. There are two combined methods A-MM and N-MM. The method A-MM models the whole network as a multimode component, and the method N-MM models each node as a multimode component. We prove that the maximum delay bound computed by the method A-MM is tighter than or equal to that computed by the method N-MM. Experiments show that our proposed methods can significantly decrease the analytical delay bound comparing with the separate flow analysis method. For the large-scale wireless sensor network with 32 thousands of sensor nodes, our proposed methods can decrease about 70% of the analytical delay bound.

  7. Networks of networks – An introduction

    International Nuclear Information System (INIS)

    Kenett, Dror Y.; Perc, Matjaž; Boccaletti, Stefano

    2015-01-01

    Graphical abstract: Interdependent network reciprocity. Only those blue cooperative domains that are initially present on both networks survive. Abstract: This is an introduction to the special issue titled “Networks of networks” that is in the making at Chaos, Solitons & Fractals. Recent research and reviews attest to the fact that networks of networks are the next frontier in network science [1–7]. Not only are interactions limited and thus inadequately described by well-mixed models, it is also a fact that the networks that should be an integral part of such models are often interconnected, thus making the processes that are unfolding on them interdependent. From the World economy and transportation systems to social media, it is clear that processes taking place in one network might significantly affect what is happening in many other networks. Within an interdependent system, each type of interaction has a certain relevance and meaning, so that treating all the links identically inevitably leads to information loss. Networks of networks, interdependent networks, or multilayer networks are therefore a much better and realistic description of such systems, and this Special Issue is devoted to their structure, dynamics and evolution, as well as to the study of emergent properties in multi-layered systems in general. Topics of interest include but are not limited to the spread of epidemics and information, percolation, diffusion, synchronization, collective behavior, and evolutionary games on networks of networks. Interdisciplinary work on all aspects of networks of networks, regardless of background and motivation, is very welcome.

  8. How to construct the statistic network? An association network of herbaceous

    Directory of Open Access Journals (Sweden)

    WenJun Zhang

    2012-06-01

    Full Text Available In present study I defined a new type of network, the statistic network. The statistic network is a weighted and non-deterministic network. In the statistic network, a connection value, i.e., connection weight, represents connection strength and connection likelihood between two nodes and its absolute value falls in the interval (0,1]. The connection value is expressed as a statistical measure such as correlation coefficient, association coefficient, or Jaccard coefficient, etc. In addition, all connections of the statistic network can be statistically tested for their validity. A connection is true if the connection value is statistically significant. If all connection values of a node are not statistically significant, it is an isolated node. An isolated node has not any connection to other nodes in the statistic network. Positive and negative connection values denote distinct connectiontypes (positive or negative association or interaction. In the statistic network, two nodes with the greater connection value will show more similar trend in the change of their states. At any time we can obtain a sample network of the statistic network. A sample network is a non-weighted and deterministic network. Thestatistic network, in particular the plant association network that constructed from field sampling, is mostly an information network. Most of the interspecific relationships in plant community are competition and cooperation. Therefore in comparison to animal networks, the methodology of statistic network is moresuitable to construct plant association networks. Some conclusions were drawn from this study: (1 in the plant association network, most connections are weak and positive interactions. The association network constructed from Spearman rank correlation has most connections and isolated taxa are fewer. From net linear correlation,linear correlation, to Spearman rank correlation, the practical number of connections and connectance in the

  9. SOCIAL NETWORK EFFECTS ON ROMANTIC RELATIONSHIP

    Directory of Open Access Journals (Sweden)

    Fatma CAN

    2015-06-01

    Full Text Available The main objective of the study was to obtain information about social network variables in order to predict the relational commitment of married individuals and people having dating relationships. For this purpose, social network analysis has been carried out on 134 people having dating relationship and 154 married individuals and then Relationship Stability Scale, Subjective Norm Scale and Social Network Feature Survey prepared by the researcher were used. The results indicated that the approval of the closest social network member and the level of enjoyment of each other’s social network members had the best predictive value for relationship satisfaction and the investment to the relationship. The results also demonstrated that, approval of the social network had a negative impact on the level of the quality of alternatives and it showed that social networks were seen as a barrier function to have alternative relationships. Furthermore, by dividing social network members into two groups, for the dating group, the approval of the social network was the most significant variable for commitment but in the married group, the need for social network approval was not an important criteria because of having their relatioship already confirmed legally. When social network members were categorised and examined, the closest social network members did not differ by sex, but were varied in terms of relationship types. In the flirt group, one of their friends among his/her social network and their partners’ social network was specified as the closest social network member whereas in the married group, the closest social network member among his/her social network was their mother while it was their sibling among partner’s social network.

  10. Stability indicators in network reconstruction.

    Directory of Open Access Journals (Sweden)

    Michele Filosi

    Full Text Available The number of available algorithms to infer a biological network from a dataset of high-throughput measurements is overwhelming and keeps growing. However, evaluating their performance is unfeasible unless a 'gold standard' is available to measure how close the reconstructed network is to the ground truth. One measure of this is the stability of these predictions to data resampling approaches. We introduce NetSI, a family of Network Stability Indicators, to assess quantitatively the stability of a reconstructed network in terms of inference variability due to data subsampling. In order to evaluate network stability, the main NetSI methods use a global/local network metric in combination with a resampling (bootstrap or cross-validation procedure. In addition, we provide two normalized variability scores over data resampling to measure edge weight stability and node degree stability, and then introduce a stability ranking for edges and nodes. A complete implementation of the NetSI indicators, including the Hamming-Ipsen-Mikhailov (HIM network distance adopted in this paper is available with the R package nettools. We demonstrate the use of the NetSI family by measuring network stability on four datasets against alternative network reconstruction methods. First, the effect of sample size on stability of inferred networks is studied in a gold standard framework on yeast-like data from the Gene Net Weaver simulator. We also consider the impact of varying modularity on a set of structurally different networks (50 nodes, from 2 to 10 modules, and then of complex feature covariance structure, showing the different behaviours of standard reconstruction methods based on Pearson correlation, Maximum Information Coefficient (MIC and False Discovery Rate (FDR strategy. Finally, we demonstrate a strong combined effect of different reconstruction methods and phenotype subgroups on a hepatocellular carcinoma miRNA microarray dataset (240 subjects, and we

  11. Community detection using preference networks

    Science.gov (United States)

    Tasgin, Mursel; Bingol, Haluk O.

    2018-04-01

    Community detection is the task of identifying clusters or groups of nodes in a network where nodes within the same group are more connected with each other than with nodes in different groups. It has practical uses in identifying similar functions or roles of nodes in many biological, social and computer networks. With the availability of very large networks in recent years, performance and scalability of community detection algorithms become crucial, i.e. if time complexity of an algorithm is high, it cannot run on large networks. In this paper, we propose a new community detection algorithm, which has a local approach and is able to run on large networks. It has a simple and effective method; given a network, algorithm constructs a preference network of nodes where each node has a single outgoing edge showing its preferred node to be in the same community with. In such a preference network, each connected component is a community. Selection of the preferred node is performed using similarity based metrics of nodes. We use two alternatives for this purpose which can be calculated in 1-neighborhood of nodes, i.e. number of common neighbors of selector node and its neighbors and, the spread capability of neighbors around the selector node which is calculated by the gossip algorithm of Lind et.al. Our algorithm is tested on both computer generated LFR networks and real-life networks with ground-truth community structure. It can identify communities accurately in a fast way. It is local, scalable and suitable for distributed execution on large networks.

  12. Networks of myelin covariance.

    Science.gov (United States)

    Melie-Garcia, Lester; Slater, David; Ruef, Anne; Sanabria-Diaz, Gretel; Preisig, Martin; Kherif, Ferath; Draganski, Bogdan; Lutti, Antoine

    2018-04-01

    Networks of anatomical covariance have been widely used to study connectivity patterns in both normal and pathological brains based on the concurrent changes of morphometric measures (i.e., cortical thickness) between brain structures across subjects (Evans, ). However, the existence of networks of microstructural changes within brain tissue has been largely unexplored so far. In this article, we studied in vivo the concurrent myelination processes among brain anatomical structures that gathered together emerge to form nonrandom networks. We name these "networks of myelin covariance" (Myelin-Nets). The Myelin-Nets were built from quantitative Magnetization Transfer data-an in-vivo magnetic resonance imaging (MRI) marker of myelin content. The synchronicity of the variations in myelin content between anatomical regions was measured by computing the Pearson's correlation coefficient. We were especially interested in elucidating the effect of age on the topological organization of the Myelin-Nets. We therefore selected two age groups: Young-Age (20-31 years old) and Old-Age (60-71 years old) and a pool of participants from 48 to 87 years old for a Myelin-Nets aging trajectory study. We found that the topological organization of the Myelin-Nets is strongly shaped by aging processes. The global myelin correlation strength, between homologous regions and locally in different brain lobes, showed a significant dependence on age. Interestingly, we also showed that the aging process modulates the resilience of the Myelin-Nets to damage of principal network structures. In summary, this work sheds light on the organizational principles driving myelination and myelin degeneration in brain gray matter and how such patterns are modulated by aging. © 2017 The Authors Human Brain Mapping Published by Wiley Periodicals, Inc.

  13. Networks of myelin covariance

    Science.gov (United States)

    Slater, David; Ruef, Anne; Sanabria‐Diaz, Gretel; Preisig, Martin; Kherif, Ferath; Draganski, Bogdan; Lutti, Antoine

    2017-01-01

    Abstract Networks of anatomical covariance have been widely used to study connectivity patterns in both normal and pathological brains based on the concurrent changes of morphometric measures (i.e., cortical thickness) between brain structures across subjects (Evans, 2013). However, the existence of networks of microstructural changes within brain tissue has been largely unexplored so far. In this article, we studied in vivo the concurrent myelination processes among brain anatomical structures that gathered together emerge to form nonrandom networks. We name these “networks of myelin covariance” (Myelin‐Nets). The Myelin‐Nets were built from quantitative Magnetization Transfer data—an in‐vivo magnetic resonance imaging (MRI) marker of myelin content. The synchronicity of the variations in myelin content between anatomical regions was measured by computing the Pearson's correlation coefficient. We were especially interested in elucidating the effect of age on the topological organization of the Myelin‐Nets. We therefore selected two age groups: Young‐Age (20–31 years old) and Old‐Age (60–71 years old) and a pool of participants from 48 to 87 years old for a Myelin‐Nets aging trajectory study. We found that the topological organization of the Myelin‐Nets is strongly shaped by aging processes. The global myelin correlation strength, between homologous regions and locally in different brain lobes, showed a significant dependence on age. Interestingly, we also showed that the aging process modulates the resilience of the Myelin‐Nets to damage of principal network structures. In summary, this work sheds light on the organizational principles driving myelination and myelin degeneration in brain gray matter and how such patterns are modulated by aging. PMID:29271053

  14. Training Recurrent Networks

    DEFF Research Database (Denmark)

    Pedersen, Morten With

    1997-01-01

    Training recurrent networks is generally believed to be a difficult task. Excessive training times and lack of convergence to an acceptable solution are frequently reported. In this paper we seek to explain the reason for this from a numerical point of view and show how to avoid problems when...... training. In particular we investigate ill-conditioning, the need for and effect of regularization and illustrate the superiority of second-order methods for training...

  15. Auctions and energy networks

    International Nuclear Information System (INIS)

    Helm, D.

    2003-01-01

    This article compares and contrasts the traditional planning approach to network investment, the regulatory treatment of capital expenditure within RPI-X price-cap regulation, and the use of auctions. It shows why auctions may be helpful in allocating existing capacity, but can only play a limited role in identifying future investment needs. Auctions cannot determine optimal investment. The application of auctions in the 2001 Transco price review is criticised and an alternative approach proposed. (Author)

  16. Brain anatomical network and intelligence.

    Directory of Open Access Journals (Sweden)

    Yonghui Li

    2009-05-01

    Full Text Available Intuitively, higher intelligence might be assumed to correspond to more efficient information transfer in the brain, but no direct evidence has been reported from the perspective of brain networks. In this study, we performed extensive analyses to test the hypothesis that individual differences in intelligence are associated with brain structural organization, and in particular that higher scores on intelligence tests are related to greater global efficiency of the brain anatomical network. We constructed binary and weighted brain anatomical networks in each of 79 healthy young adults utilizing diffusion tensor tractography and calculated topological properties of the networks using a graph theoretical method. Based on their IQ test scores, all subjects were divided into general and high intelligence groups and significantly higher global efficiencies were found in the networks of the latter group. Moreover, we showed significant correlations between IQ scores and network properties across all subjects while controlling for age and gender. Specifically, higher intelligence scores corresponded to a shorter characteristic path length and a higher global efficiency of the networks, indicating a more efficient parallel information transfer in the brain. The results were consistently observed not only in the binary but also in the weighted networks, which together provide convergent evidence for our hypothesis. Our findings suggest that the efficiency of brain structural organization may be an important biological basis for intelligence.

  17. Jamming in complex networks with degree correlation

    International Nuclear Information System (INIS)

    Pastore y Piontti, Ana L.; Braunstein, Lidia A.; Macri, Pablo A.

    2010-01-01

    We study the effects of the degree-degree correlations on the pressure congestion J when we apply a dynamical process on scale free complex networks using the gradient network approach. We find that the pressure congestion for disassortative (assortative) networks is lower (bigger) than the one for uncorrelated networks which allow us to affirm that disassortative networks enhance transport through them. This result agree with the fact that many real world transportation networks naturally evolve to this kind of correlation. We explain our results showing that for the disassortative case the clusters in the gradient network turn out to be as much elongated as possible, reducing the pressure congestion J and observing the opposite behavior for the assortative case. Finally we apply our model to real world networks, and the results agree with our theoretical model.

  18. A new information dimension of complex networks

    International Nuclear Information System (INIS)

    Wei, Daijun; Wei, Bo; Hu, Yong; Zhang, Haixin; Deng, Yong

    2014-01-01

    Highlights: •The proposed measure is more practical than the classical information dimension. •The difference of information for box in the box-covering algorithm is considered. •Results indicate the measure can capture the fractal property of complex networks. -- Abstract: The fractal and self-similarity properties are revealed in many complex networks. The classical information dimension is an important method to study fractal and self-similarity properties of planar networks. However, it is not practical for real complex networks. In this Letter, a new information dimension of complex networks is proposed. The nodes number in each box is considered by using the box-covering algorithm of complex networks. The proposed method is applied to calculate the fractal dimensions of some real networks. Our results show that the proposed method is efficient when dealing with the fractal dimension problem of complex networks.

  19. A new information dimension of complex networks

    Energy Technology Data Exchange (ETDEWEB)

    Wei, Daijun [School of Computer and Information Science, Southwest University, Chongqing 400715 (China); School of Science, Hubei University for Nationalities, Enshi 445000 (China); Wei, Bo [School of Computer and Information Science, Southwest University, Chongqing 400715 (China); Hu, Yong [Institute of Business Intelligence and Knowledge Discovery, Guangdong University of Foreign Studies, Guangzhou 510006 (China); Zhang, Haixin [School of Computer and Information Science, Southwest University, Chongqing 400715 (China); Deng, Yong, E-mail: ydeng@swu.edu.cn [School of Computer and Information Science, Southwest University, Chongqing 400715 (China); School of Engineering, Vanderbilt University, TN 37235 (United States)

    2014-03-01

    Highlights: •The proposed measure is more practical than the classical information dimension. •The difference of information for box in the box-covering algorithm is considered. •Results indicate the measure can capture the fractal property of complex networks. -- Abstract: The fractal and self-similarity properties are revealed in many complex networks. The classical information dimension is an important method to study fractal and self-similarity properties of planar networks. However, it is not practical for real complex networks. In this Letter, a new information dimension of complex networks is proposed. The nodes number in each box is considered by using the box-covering algorithm of complex networks. The proposed method is applied to calculate the fractal dimensions of some real networks. Our results show that the proposed method is efficient when dealing with the fractal dimension problem of complex networks.

  20. Statistical properties of random clique networks

    Science.gov (United States)

    Ding, Yi-Min; Meng, Jun; Fan, Jing-Fang; Ye, Fang-Fu; Chen, Xiao-Song

    2017-10-01

    In this paper, a random clique network model to mimic the large clustering coefficient and the modular structure that exist in many real complex networks, such as social networks, artificial networks, and protein interaction networks, is introduced by combining the random selection rule of the Erdös and Rényi (ER) model and the concept of cliques. We find that random clique networks having a small average degree differ from the ER network in that they have a large clustering coefficient and a power law clustering spectrum, while networks having a high average degree have similar properties as the ER model. In addition, we find that the relation between the clustering coefficient and the average degree shows a non-monotonic behavior and that the degree distributions can be fit by multiple Poisson curves; we explain the origin of such novel behaviors and degree distributions.

  1. IM (Integrity Management) software must show flexibility to local codes

    Energy Technology Data Exchange (ETDEWEB)

    Brors, Markus [ROSEN Technology and Research Center GmbH (Germany); Diggory, Ian [Macaw Engineering Ltd., Northumberland (United Kingdom)

    2009-07-01

    There are many internationally recognized codes and standards, such as API 1160 and ASME B31.8S, which help pipeline operators to manage and maintain the integrity of their pipeline networks. However, operators in many countries still use local codes that often reflect the history of pipeline developments in their region and are based on direct experience and research on their pipelines. As pipeline companies come under increasing regulatory and financial pressures to maintain the integrity of their networks, it is important that operators using regional codes are able to benchmark their integrity management schemes against these international standards. Any comprehensive Pipeline Integrity Management System (PIMS) software package should therefore not only incorporate industry standards for pipeline integrity assessment but also be capable of implementing regional codes for comparison purposes. This paper describes the challenges and benefits of incorporating one such set of regional pipeline standards into ROSEN Asset Integrity Management Software (ROAIMS). (author)

  2. Maximum Parsimony on Phylogenetic networks

    Science.gov (United States)

    2012-01-01

    Background Phylogenetic networks are generalizations of phylogenetic trees, that are used to model evolutionary events in various contexts. Several different methods and criteria have been introduced for reconstructing phylogenetic trees. Maximum Parsimony is a character-based approach that infers a phylogenetic tree by minimizing the total number of evolutionary steps required to explain a given set of data assigned on the leaves. Exact solutions for optimizing parsimony scores on phylogenetic trees have been introduced in the past. Results In this paper, we define the parsimony score on networks as the sum of the substitution costs along all the edges of the network; and show that certain well-known algorithms that calculate the optimum parsimony score on trees, such as Sankoff and Fitch algorithms extend naturally for networks, barring conflicting assignments at the reticulate vertices. We provide heuristics for finding the optimum parsimony scores on networks. Our algorithms can be applied for any cost matrix that may contain unequal substitution costs of transforming between different characters along different edges of the network. We analyzed this for experimental data on 10 leaves or fewer with at most 2 reticulations and found that for almost all networks, the bounds returned by the heuristics matched with the exhaustively determined optimum parsimony scores. Conclusion The parsimony score we define here does not directly reflect the cost of the best tree in the network that displays the evolution of the character. However, when searching for the most parsimonious network that describes a collection of characters, it becomes necessary to add additional cost considerations to prefer simpler structures, such as trees over networks. The parsimony score on a network that we describe here takes into account the substitution costs along the additional edges incident on each reticulate vertex, in addition to the substitution costs along the other edges which are

  3. Communicability across evolving networks.

    Science.gov (United States)

    Grindrod, Peter; Parsons, Mark C; Higham, Desmond J; Estrada, Ernesto

    2011-04-01

    Many natural and technological applications generate time-ordered sequences of networks, defined over a fixed set of nodes; for example, time-stamped information about "who phoned who" or "who came into contact with who" arise naturally in studies of communication and the spread of disease. Concepts and algorithms for static networks do not immediately carry through to this dynamic setting. For example, suppose A and B interact in the morning, and then B and C interact in the afternoon. Information, or disease, may then pass from A to C, but not vice versa. This subtlety is lost if we simply summarize using the daily aggregate network given by the chain A-B-C. However, using a natural definition of a walk on an evolving network, we show that classic centrality measures from the static setting can be extended in a computationally convenient manner. In particular, communicability indices can be computed to summarize the ability of each node to broadcast and receive information. The computations involve basic operations in linear algebra, and the asymmetry caused by time's arrow is captured naturally through the noncommutativity of matrix-matrix multiplication. Illustrative examples are given for both synthetic and real-world communication data sets. We also discuss the use of the new centrality measures for real-time monitoring and prediction.

  4. Green mobile networks a networking perspective

    CERN Document Server

    Ansari, Nirwan

    2016-01-01

    Combines the hot topics of energy efficiency and next generation mobile networking, examining techniques and solutions. Green communications is a very hot topic. Ever increasing mobile network bandwidth rates significantly impacts on operating costs due to aggregate network energy consumption. As such, design on 4G networks and beyond has increasingly started to focus on 'energy efficiency' or so-called 'green' networks. Many techniques and solutions have been proposed to enhance the energy efficiency of mobile networks, yet no book has provided an in-depth analysis of the energy consumption issues in mobile networks nor offers detailed theories, tools and solutions for solving the energy efficiency problems.

  5. A flood-based information flow analysis and network minimization method for gene regulatory networks.

    Science.gov (United States)

    Pavlogiannis, Andreas; Mozhayskiy, Vadim; Tagkopoulos, Ilias

    2013-04-24

    Biological networks tend to have high interconnectivity, complex topologies and multiple types of interactions. This renders difficult the identification of sub-networks that are involved in condition- specific responses. In addition, we generally lack scalable methods that can reveal the information flow in gene regulatory and biochemical pathways. Doing so will help us to identify key participants and paths under specific environmental and cellular context. This paper introduces the theory of network flooding, which aims to address the problem of network minimization and regulatory information flow in gene regulatory networks. Given a regulatory biological network, a set of source (input) nodes and optionally a set of sink (output) nodes, our task is to find (a) the minimal sub-network that encodes the regulatory program involving all input and output nodes and (b) the information flow from the source to the sink nodes of the network. Here, we describe a novel, scalable, network traversal algorithm and we assess its potential to achieve significant network size reduction in both synthetic and E. coli networks. Scalability and sensitivity analysis show that the proposed method scales well with the size of the network, and is robust to noise and missing data. The method of network flooding proves to be a useful, practical approach towards information flow analysis in gene regulatory networks. Further extension of the proposed theory has the potential to lead in a unifying framework for the simultaneous network minimization and information flow analysis across various "omics" levels.

  6. Surname complex network for Brazil and Portugal

    Science.gov (United States)

    Ferreira, G. D.; Viswanathan, G. M.; da Silva, L. R.; Herrmann, H. J.

    2018-06-01

    We present a study of social networks based on the analysis of Brazilian and Portuguese family names (surnames). We construct networks whose nodes are names of families and whose edges represent parental relations between two families. From these networks we extract the connectivity distribution, clustering coefficient, shortest path and centrality. We find that the connectivity distribution follows an approximate power law. We associate the number of hubs, centrality and entropy to the degree of miscegenation in the societies in both countries. Our results show that Portuguese society has a higher miscegenation degree than Brazilian society. All networks analyzed lead to approximate inverse square power laws in the degree distribution. We conclude that the thermodynamic limit is reached for small networks (3 or 4 thousand nodes). The assortative mixing of all networks is negative, showing that the more connected vertices are connected to vertices with lower connectivity. Finally, the network of surnames presents some small world characteristics.

  7. Influence of degree correlations on network structure and stability in protein-protein interaction networks

    Directory of Open Access Journals (Sweden)

    Zimmer Ralf

    2007-08-01

    Full Text Available Abstract Background The existence of negative correlations between degrees of interacting proteins is being discussed since such negative degree correlations were found for the large-scale yeast protein-protein interaction (PPI network of Ito et al. More recent studies observed no such negative correlations for high-confidence interaction sets. In this article, we analyzed a range of experimentally derived interaction networks to understand the role and prevalence of degree correlations in PPI networks. We investigated how degree correlations influence the structure of networks and their tolerance against perturbations such as the targeted deletion of hubs. Results For each PPI network, we simulated uncorrelated, positively and negatively correlated reference networks. Here, a simple model was developed which can create different types of degree correlations in a network without changing the degree distribution. Differences in static properties associated with degree correlations were compared by analyzing the network characteristics of the original PPI and reference networks. Dynamics were compared by simulating the effect of a selective deletion of hubs in all networks. Conclusion Considerable differences between the network types were found for the number of components in the original networks. Negatively correlated networks are fragmented into significantly less components than observed for positively correlated networks. On the other hand, the selective deletion of hubs showed an increased structural tolerance to these deletions for the positively correlated networks. This results in a lower rate of interaction loss in these networks compared to the negatively correlated networks and a decreased disintegration rate. Interestingly, real PPI networks are most similar to the randomly correlated references with respect to all properties analyzed. Thus, although structural properties of networks can be modified considerably by degree

  8. The Network Completion Problem: Inferring Missing Nodes and Edges in Networks

    Energy Technology Data Exchange (ETDEWEB)

    Kim, M; Leskovec, J

    2011-11-14

    Network structures, such as social networks, web graphs and networks from systems biology, play important roles in many areas of science and our everyday lives. In order to study the networks one needs to first collect reliable large scale network data. While the social and information networks have become ubiquitous, the challenge of collecting complete network data still persists. Many times the collected network data is incomplete with nodes and edges missing. Commonly, only a part of the network can be observed and we would like to infer the unobserved part of the network. We address this issue by studying the Network Completion Problem: Given a network with missing nodes and edges, can we complete the missing part? We cast the problem in the Expectation Maximization (EM) framework where we use the observed part of the network to fit a model of network structure, and then we estimate the missing part of the network using the model, re-estimate the parameters and so on. We combine the EM with the Kronecker graphs model and design a scalable Metropolized Gibbs sampling approach that allows for the estimation of the model parameters as well as the inference about missing nodes and edges of the network. Experiments on synthetic and several real-world networks show that our approach can effectively recover the network even when about half of the nodes in the network are missing. Our algorithm outperforms not only classical link-prediction approaches but also the state of the art Stochastic block modeling approach. Furthermore, our algorithm easily scales to networks with tens of thousands of nodes.

  9. CUFID-query: accurate network querying through random walk based network flow estimation.

    Science.gov (United States)

    Jeong, Hyundoo; Qian, Xiaoning; Yoon, Byung-Jun

    2017-12-28

    performance evaluation based on biological networks with known functional modules, we show that CUFID-query outperforms the existing state-of-the-art algorithms in terms of prediction accuracy and biological significance of the predictions.

  10. Networking activities in technology-based entrepreneurial teams

    DEFF Research Database (Denmark)

    Neergaard, Helle

    2005-01-01

    Based on social network theoy, this article investigates the distribution of networking roles and responsibilities in entrepreneurial founding teams. Its focus is on the team as a collection of individuals, thus allowing the research to address differences in networking patterns. It identifies six...... central networking activities and shows that not all founding team members are equally active 'networkers'. The analyses show that team members prioritize different networking activities and that one member in particular has extensive networking activities whereas other memebrs of the team are more...

  11. Trade networks in West Africa

    DEFF Research Database (Denmark)

    Walther, Olivier

    2014-01-01

    To date, most of the literature on trade networks in West Africa has considered networks in a metaphorical way. The aim of this paper is to go one step further by showing how social network analysis may be applied to the study of regional trade in West Africa. After a brief review of the literature......, this exploratory paper investigates two main issues related to regional trade. We start by discussing how recent developments in regional trade in West Africa have contributed to challenging the social structure of traders. We then discuss the changes that have affected the spatiality of regional trade by looking...

  12. Axelrod's metanorm games on networks.

    Directory of Open Access Journals (Sweden)

    José M Galán

    Full Text Available Metanorms is a mechanism proposed to promote cooperation in social dilemmas. Recent experimental results show that network structures that underlie social interactions influence the emergence of norms that promote cooperation. We generalize Axelrod's analysis of metanorms dynamics to interactions unfolding on networks through simulation and mathematical modeling. Network topology strongly influences the effectiveness of the metanorms mechanism in establishing cooperation. In particular, we find that average degree, clustering coefficient and the average number of triplets per node play key roles in sustaining or collapsing cooperation.

  13. Single-shot secure quantum network coding on butterfly network with free public communication

    Science.gov (United States)

    Owari, Masaki; Kato, Go; Hayashi, Masahito

    2018-01-01

    Quantum network coding on the butterfly network has been studied as a typical example of quantum multiple cast network. We propose a secure quantum network code for the butterfly network with free public classical communication in the multiple unicast setting under restricted eavesdropper’s power. This protocol certainly transmits quantum states when there is no attack. We also show the secrecy with shared randomness as additional resource when the eavesdropper wiretaps one of the channels in the butterfly network and also derives the information sending through public classical communication. Our protocol does not require verification process, which ensures single-shot security.

  14. ENLIGHT Network

    CERN Multimedia

    Ballantine, A; Dixon-Altaber, H; Dosanjh, M; Kuchina, L

    2011-01-01

    State-of-the-art techniques borrowed from particle accelerators and detectors are a key element in hadrontherapy and several European projects are actively fostering the collaboration amongst the various disciplines and countries. ENLIGHT was established in 2002 to coordinate these European efforts in hadron therapy. The ENLIGHT network is formed by the European hadrontherapy Community, with more than 300 participants from twenty European countries. A major achievement of ENLIGHT has been the blending of traditionally separate communities so that clinicians, physicists, biologists and engineers with experience and interest in particle therapy are working together.

  15. The Dynamic and Changing Development of EERA Networks

    Science.gov (United States)

    Figueiredo, Maria P.; Grosvenor, Ian; Hoveid, Marit Honerod; Macnab, Natasha

    2014-01-01

    In this article the authors use two EERA networks as a case for a discussion on the development of research networks within the European Educational Research Association (EERA). They contend that EERA networks through their way of working create a European research space. As their case shows, the development of networks is diverse. The emergence…

  16. Preferential Attachment in Online Networks: Measurement and Explanations

    NARCIS (Netherlands)

    Kunegis, J; Blattner, M; Moser, C.

    2013-01-01

    We perform an empirical study of the preferential attachment phenomenon in temporal networks and show that on the Web, networks follow a nonlinear preferential attachment model in which the exponent depends on the type of network considered. The classical preferential attachment model for networks

  17. Network Coding Applications and Implementations on Mobile Devices

    DEFF Research Database (Denmark)

    Fitzek, Frank; Pedersen, Morten Videbæk; Heide, Janus

    2010-01-01

    Network coding has attracted a lot of attention lately. The goal of this paper is to demonstrate that the implementation of network coding is feasible on mobile platforms. The paper will guide the reader through some examples and demonstrate uses for network coding. Furthermore the paper will also...... show that the implementation of network coding is feasible today on commercial mobile platforms....

  18. Application of genetic neural network in steam generator fault diagnosing

    International Nuclear Information System (INIS)

    Lin Xiaogong; Jiang Xingwei; Liu Tao; Shi Xiaocheng

    2005-01-01

    In the paper, a new algorithm which neural network and genetic algorithm are mixed is adopted, aiming at the problems of slow convergence rate and easily falling into part minimums in network studying of traditional BP neural network, and used in the fault diagnosis of steam generator. The result shows that this algorithm can solve the convergence problem in the network trains effectively. (author)

  19. Modeling the Effect of Bandwidth Allocation on Network Performance

    African Journals Online (AJOL)

    ... The proposed model showed improved performance for CDMA networks, but further increase in the bandwidth did not benefit the network; (iii) A reliability measure such as the spectral efficiency is therefore useful to redeem the limitation in (ii). Keywords: Coverage Capacity, CDMA, Mobile Network, Network Throughput ...

  20. Improving network management with Software Defined Networking

    International Nuclear Information System (INIS)

    Dzhunev, Pavel

    2013-01-01

    Software-defined networking (SDN) is developed as an alternative to closed networks in centers for data processing by providing a means to separate the control layer data layer switches, and routers. SDN introduces new possibilities for network management and configuration methods. In this article, we identify problems with the current state-of-the-art network configuration and management mechanisms and introduce mechanisms to improve various aspects of network management

  1. Energy-aware virtual network embedding in flexi-grid networks.

    Science.gov (United States)

    Lin, Rongping; Luo, Shan; Wang, Haoran; Wang, Sheng

    2017-11-27

    Network virtualization technology has been proposed to allow multiple heterogeneous virtual networks (VNs) to coexist on a shared substrate network, which increases the utilization of the substrate network. Efficiently mapping VNs on the substrate network is a major challenge on account of the VN embedding (VNE) problem. Meanwhile, energy efficiency has been widely considered in the network design in terms of operation expenses and the ecological awareness. In this paper, we aim to solve the energy-aware VNE problem in flexi-grid optical networks. We provide an integer linear programming (ILP) formulation to minimize the electricity cost of each arriving VN request. We also propose a polynomial-time heuristic algorithm where virtual links are embedded sequentially to keep a reasonable acceptance ratio and maintain a low electricity cost. Numerical results show that the heuristic algorithm performs closely to the ILP for a small size network, and we also demonstrate its applicability to larger networks.

  2. Resilience of networks to environmental stress: From regular to random networks

    Science.gov (United States)

    Eom, Young-Ho

    2018-04-01

    Despite the huge interest in network resilience to stress, most of the studies have concentrated on internal stress damaging network structure (e.g., node removals). Here we study how networks respond to environmental stress deteriorating their external conditions. We show that, when regular networks gradually disintegrate as environmental stress increases, disordered networks can suddenly collapse at critical stress with hysteresis and vulnerability to perturbations. We demonstrate that this difference results from a trade-off between node resilience and network resilience to environmental stress. The nodes in the disordered networks can suppress their collapses due to the small-world topology of the networks but eventually collapse all together in return. Our findings indicate that some real networks can be highly resilient against environmental stress to a threshold yet extremely vulnerable to the stress above the threshold because of their small-world topology.

  3. Shared protection based virtual network mapping in space division multiplexing optical networks

    Science.gov (United States)

    Zhang, Huibin; Wang, Wei; Zhao, Yongli; Zhang, Jie

    2018-05-01

    Space Division Multiplexing (SDM) has been introduced to improve the capacity of optical networks. In SDM optical networks, there are multiple cores/modes in each fiber link, and spectrum resources are multiplexed in both frequency and core/modes dimensions. Enabled by network virtualization technology, one SDM optical network substrate can be shared by several virtual networks operators. Similar with point-to-point connection services, virtual networks (VN) also need certain survivability to guard against network failures. Based on customers' heterogeneous requirements on the survivability of their virtual networks, this paper studies the shared protection based VN mapping problem and proposes a Minimum Free Frequency Slots (MFFS) mapping algorithm to improve spectrum efficiency. Simulation results show that the proposed algorithm can optimize SDM optical networks significantly in terms of blocking probability and spectrum utilization.

  4. A network of networks model to study phase synchronization using structural connection matrix of human brain

    Science.gov (United States)

    Ferrari, F. A. S.; Viana, R. L.; Reis, A. S.; Iarosz, K. C.; Caldas, I. L.; Batista, A. M.

    2018-04-01

    The cerebral cortex plays a key role in complex cortical functions. It can be divided into areas according to their function (motor, sensory and association areas). In this paper, the cerebral cortex is described as a network of networks (cortex network), we consider that each cortical area is composed of a network with small-world property (cortical network). The neurons are assumed to have bursting properties with the dynamics described by the Rulkov model. We study the phase synchronization of the cortex network and the cortical networks. In our simulations, we verify that synchronization in cortex network is not homogeneous. Besides, we focus on the suppression of neural phase synchronization. Synchronization can be related to undesired and pathological abnormal rhythms in the brain. For this reason, we consider the delayed feedback control to suppress the synchronization. We show that delayed feedback control is efficient to suppress synchronous behavior in our network model when an appropriate signal intensity and time delay are defined.

  5. Application of Butterfly Clos-Network in Network-on-Chip

    Directory of Open Access Journals (Sweden)

    Hui Liu

    2014-01-01

    Full Text Available This paper studied the topology of NoC (Network-on-Chip. By combining the characteristics of the Clos network and butterfly network, a new topology named BFC (Butterfly Clos-network network was proposed. This topology integrates several modules, which belongs to the same layer but different dimensions, into a new module. In the BFC network, a bidirectional link is used to complete information exchange, instead of information exchange between different layers in the original network. During the routing period, other nondestination nodes can be used as middle stages to transfer data packets to complete the routing mission. Therefore, this topology has the characteristic of multistage. Simulation analyses show that BFC inherits the rich path diversity of Clos network, and it has a better performance than butterfly network in throughput and delay in a quite congested traffic pattern.

  6. Direct lifts of coupled cell networks

    Science.gov (United States)

    Dias, A. P. S.; Moreira, C. S.

    2018-04-01

    In networks of dynamical systems, there are spaces defined in terms of equalities of cell coordinates which are flow-invariant under any dynamical system that has a form consistent with the given underlying network structure—the network synchrony subspaces. Given a network and one of its synchrony subspaces, any system with a form consistent with the network, restricted to the synchrony subspace, defines a new system which is consistent with a smaller network, called the quotient network of the original network by the synchrony subspace. Moreover, any system associated with the quotient can be interpreted as the restriction to the synchrony subspace of a system associated with the original network. We call the larger network a lift of the smaller network, and a lift can be interpreted as a result of the cellular splitting of the smaller network. In this paper, we address the question of the uniqueness in this lifting process in terms of the networks’ topologies. A lift G of a given network Q is said to be direct when there are no intermediate lifts of Q between them. We provide necessary and sufficient conditions for a lift of a general network to be direct. Our results characterize direct lifts using the subnetworks of all splitting cells of Q and of all split cells of G. We show that G is a direct lift of Q if and only if either the split subnetwork is a direct lift or consists of two copies of the splitting subnetwork. These results are then applied to the class of regular uniform networks and to the special classes of ring networks and acyclic networks. We also illustrate that one of the applications of our results is to the lifting bifurcation problem.

  7. Credal Networks under Maximum Entropy

    OpenAIRE

    Lukasiewicz, Thomas

    2013-01-01

    We apply the principle of maximum entropy to select a unique joint probability distribution from the set of all joint probability distributions specified by a credal network. In detail, we start by showing that the unique joint distribution of a Bayesian tree coincides with the maximum entropy model of its conditional distributions. This result, however, does not hold anymore for general Bayesian networks. We thus present a new kind of maximum entropy models, which are computed sequentially. ...

  8. Contingent factors affecting network learning

    OpenAIRE

    Peters, Linda D.; Pressey, Andrew D.; Johnston, Wesley J.

    2016-01-01

    To increase understanding of the impact of individuals on organizational learning processes, this paper explores the impact of individual cognition and action on the absorptive capacity process of the wider network. In particular this study shows how contingent factors such as social integration mechanisms and power relationships influence how network members engage in, and benefit from, learning. The use of cognitive consistency and sensemaking theory enables examination of how these conting...

  9. Secure positioning in wireless networks

    DEFF Research Database (Denmark)

    Capkun, Srdjan; Hubaux, Jean-Pierre

    2006-01-01

    So far, the problem of positioning in wireless networks has been studied mainly in a non-adversarial settings. In this work, we analyze the resistance of positioning techniques to position and distance spoofing attacks. We propose a mechanism for secure positioning of wireless devices, that we call...... Verifiable Multilateration. We then show how this mechanism can be used to secure positioning in sensor networks. We analyze our system through simulations....

  10. Complex quantum network geometries: Evolution and phase transitions

    Science.gov (United States)

    Bianconi, Ginestra; Rahmede, Christoph; Wu, Zhihao

    2015-08-01

    Networks are topological and geometric structures used to describe systems as different as the Internet, the brain, or the quantum structure of space-time. Here we define complex quantum network geometries, describing the underlying structure of growing simplicial 2-complexes, i.e., simplicial complexes formed by triangles. These networks are geometric networks with energies of the links that grow according to a nonequilibrium dynamics. The evolution in time of the geometric networks is a classical evolution describing a given path of a path integral defining the evolution of quantum network states. The quantum network states are characterized by quantum occupation numbers that can be mapped, respectively, to the nodes, links, and triangles incident to each link of the network. We call the geometric networks describing the evolution of quantum network states the quantum geometric networks. The quantum geometric networks have many properties common to complex networks, including small-world property, high clustering coefficient, high modularity, and scale-free degree distribution. Moreover, they can be distinguished between the Fermi-Dirac network and the Bose-Einstein network obeying, respectively, the Fermi-Dirac and Bose-Einstein statistics. We show that these networks can undergo structural phase transitions where the geometrical properties of the networks change drastically. Finally, we comment on the relation between quantum complex network geometries, spin networks, and triangulations.

  11. Mining social networks and security informatics

    CERN Document Server

    Özyer, Tansel; Rokne, Jon; Khoury, Suheil

    2013-01-01

    Crime, terrorism and security are in the forefront of current societal concerns. This edited volume presents research based on social network techniques showing how data from crime and terror networks can be analyzed and how information can be extracted. The topics covered include crime data mining and visualization; organized crime detection; crime network visualization; computational criminology; aspects of terror network analyses and threat prediction including cyberterrorism and the related area of dark web; privacy issues in social networks; security informatics; graph algorithms for soci

  12. Critical Fluctuations in Spatial Complex Networks

    Science.gov (United States)

    Bradde, Serena; Caccioli, Fabio; Dall'Asta, Luca; Bianconi, Ginestra

    2010-05-01

    An anomalous mean-field solution is known to capture the nontrivial phase diagram of the Ising model in annealed complex networks. Nevertheless, the critical fluctuations in random complex networks remain mean field. Here we show that a breakdown of this scenario can be obtained when complex networks are embedded in geometrical spaces. Through the analysis of the Ising model on annealed spatial networks, we reveal, in particular, the spectral properties of networks responsible for critical fluctuations and we generalize the Ginsburg criterion to complex topologies.

  13. Social Network Analysis and informal trade

    DEFF Research Database (Denmark)

    Walther, Olivier

    networks can be applied to better understand informal trade in developing countries, with a particular focus on Africa. The paper starts by discussing some of the fundamental concepts developed by social network analysis. Through a number of case studies, we show how social network analysis can...... illuminate the relevant causes of social patterns, the impact of social ties on economic performance, the diffusion of resources and information, and the exercise of power. The paper then examines some of the methodological challenges of social network analysis and how it can be combined with other...... approaches. The paper finally highlights some of the applications of social network analysis and their implications for trade policies....

  14. Soil Bacterial and Fungal Communities Show Distinct Recovery Patterns during Forest Ecosystem Restoration.

    Science.gov (United States)

    Sun, Shan; Li, Song; Avera, Bethany N; Strahm, Brian D; Badgley, Brian D

    2017-07-15

    Bacteria and fungi are important mediators of biogeochemical processes and play essential roles in the establishment of plant communities, which makes knowledge about their recovery after extreme disturbances valuable for understanding ecosystem development. However, broad ecological differences between bacterial and fungal organisms, such as growth rates, stress tolerance, and substrate utilization, suggest they could follow distinct trajectories and show contrasting dynamics during recovery. In this study, we analyzed both the intra-annual variability and decade-scale recovery of bacterial and fungal communities in a chronosequence of reclaimed mined soils using next-generation sequencing to quantify their abundance, richness, β-diversity, taxonomic composition, and cooccurrence network properties. Bacterial communities shifted gradually, with overlapping β-diversity patterns across chronosequence ages, while shifts in fungal communities were more distinct among different ages. In addition, the magnitude of intra-annual variability in bacterial β-diversity was comparable to the changes across decades of chronosequence age, while fungal communities changed minimally across months. Finally, the complexity of bacterial cooccurrence networks increased with chronosequence age, while fungal networks did not show clear age-related trends. We hypothesize that these contrasting dynamics of bacteria and fungi in the chronosequence result from (i) higher growth rates for bacteria, leading to higher intra-annual variability; (ii) higher tolerance to environmental changes for fungi; and (iii) stronger influence of vegetation on fungal communities. IMPORTANCE Both bacteria and fungi play essential roles in ecosystem functions, and information about their recovery after extreme disturbances is important for understanding whole-ecosystem development. Given their many differences in phenotype, phylogeny, and life history, a comparison of different bacterial and fungal recovery

  15. Shapley ratings in brain networks

    Directory of Open Access Journals (Sweden)

    Rolf Kötter

    2007-11-01

    Full Text Available Recent applications of network theory to brain networks as well as the expanding empirical databases of brain architecture spawn an interest in novel techniques for analyzing connectivity patterns in the brain. Treating individual brain structures as nodes in a directed graph model permits the application of graph theoretical concepts to the analysis of these structures within their large-scale connectivity networks. In this paper, we explore the application of concepts from graph and game theory toward this end. Specifically, we utilize the Shapley value principle, which assigns a rank to players in a coalition based upon their individual contributions to the collective profit of that coalition, to assess the contributions of individual brain structures to the graph derived from the global connectivity network. We report Shapley values for variations of a prefrontal network, as well as for a visual cortical network, which had both been extensively investigated previously. This analysis highlights particular nodes as strong or weak contributors to global connectivity. To understand the nature of their contribution, we compare the Shapley values obtained from these networks and appropriate controls to other previously described nodal measures of structural connectivity. We find a strong correlation between Shapley values and both betweenness centrality and connection density. Moreover, a stepwise multiple linear regression analysis indicates that approximately 79% of the variance in Shapley values obtained from random networks can be explained by betweenness centrality alone. Finally, we investigate the effects of local lesions on the Shapley ratings, showing that the present networks have an immense structural resistance to degradation. We discuss our results highlighting the use of such measures for characterizing the organization and functional role of brain networks.

  16. Cluster emergence and network evolution A longitudinal analysis of the inventor network in Sophia-Antipolis

    OpenAIRE

    Anne L. J. ter Wal

    2008-01-01

    Abstract It is increasingly acknowledged that clusters do not necessarily exhibit networks of local collective learning. This paper addresses the question under which conditions this is the case. Through a longitudinal case study of the business park Sophia-Antipolis it investigates how networks of collective learning emerged throughout the growth of the cluster. Network reconstruction with patent data shows that an innovation network emerged only in Information Technology, in whic...

  17. Inhibition of tumor vasculogenic mimicry and prolongation of host survival in highly aggressive gallbladder cancers by norcantharidin via blocking the ephrin type a receptor 2/focal adhesion kinase/paxillin signaling pathway.

    Directory of Open Access Journals (Sweden)

    Hui Wang

    Full Text Available Vasculogenic mimicry (VM is a newly-defined tumor microcirculation pattern in highly aggressive malignant tumors. We recently reported tumor growth and VM formation of gallbladder cancers through the contribution of the ephrin type a receptor 2 (EphA2/focal adhesion kinase (FAK/Paxillin signaling pathways. In this study, we further investigated the anti-VM activity of norcantharidin (NCTD as a VM inhibitor for gallbladder cancers and the underlying mechanisms. In vivo and in vitro experiments to determine the effects of NCTD on tumor growth, host survival, VM formation of GBC-SD nude mouse xenografts, and vasculogenic-like networks, malignant phenotypes i.e., proliferation, apoptosis, invasion and migration of GBC-SD cells. Expression of VM signaling-related markers EphA2, FAK and Paxillin in vivo and in vitro were examined by immunofluorescence, western blotting and real-time polymerase chain reaction (RT-PCR, respectively. The results showed that after treatment with NCTD, GBC-SD cells were unable to form VM structures when injecting into nude mouse, growth of the xenograft was inhibited and these observations were confirmed by facts that VM formation by three-dimensional (3-D matrix, proliferation, apoptosis, invasion, migration of GBC-SD cells were affected; and survival time of the xenograft mice was prolonged. Furthermore, expression of EphA2, FAK and Paxillin proteins/mRNAs of the xenografts was downregulated. Thus, we concluded that NCTD has potential anti-VM activity against human gallbladder cancers; one of the underlying mechanisms may be via blocking the EphA2/FAK/Paxillin signaling pathway.

  18. Correlations in star networks: from Bell inequalities to network inequalities

    International Nuclear Information System (INIS)

    Tavakoli, Armin; Renou, Marc Olivier; Gisin, Nicolas; Brunner, Nicolas

    2017-01-01

    The problem of characterizing classical and quantum correlations in networks is considered. Contrary to the usual Bell scenario, where distant observers share a physical system emitted by one common source, a network features several independent sources, each distributing a physical system to a subset of observers. In the quantum setting, the observers can perform joint measurements on initially independent systems, which may lead to strong correlations across the whole network. In this work, we introduce a technique to systematically map a Bell inequality to a family of Bell-type inequalities bounding classical correlations on networks in a star-configuration. Also, we show that whenever a given Bell inequality can be violated by some entangled state ρ , then all the corresponding network inequalities can be violated by considering many copies of ρ distributed in the star network. The relevance of these ideas is illustrated by applying our method to a specific multi-setting Bell inequality. We derive the corresponding network inequalities, and study their quantum violations. (paper)

  19. Unraveling spurious properties of interaction networks with tailored random networks.

    Directory of Open Access Journals (Sweden)

    Stephan Bialonski

    Full Text Available We investigate interaction networks that we derive from multivariate time series with methods frequently employed in diverse scientific fields such as biology, quantitative finance, physics, earth and climate sciences, and the neurosciences. Mimicking experimental situations, we generate time series with finite length and varying frequency content but from independent stochastic processes. Using the correlation coefficient and the maximum cross-correlation, we estimate interdependencies between these time series. With clustering coefficient and average shortest path length, we observe unweighted interaction networks, derived via thresholding the values of interdependence, to possess non-trivial topologies as compared to Erdös-Rényi networks, which would indicate small-world characteristics. These topologies reflect the mostly unavoidable finiteness of the data, which limits the reliability of typically used estimators of signal interdependence. We propose random networks that are tailored to the way interaction networks are derived from empirical data. Through an exemplary investigation of multichannel electroencephalographic recordings of epileptic seizures--known for their complex spatial and temporal dynamics--we show that such random networks help to distinguish network properties of interdependence structures related to seizure dynamics from those spuriously induced by the applied methods of analysis.

  20. Network traffic anomaly prediction using Artificial Neural Network

    Science.gov (United States)

    Ciptaningtyas, Hening Titi; Fatichah, Chastine; Sabila, Altea

    2017-03-01

    As the excessive increase of internet usage, the malicious software (malware) has also increase significantly. Malware is software developed by hacker for illegal purpose(s), such as stealing data and identity, causing computer damage, or denying service to other user[1]. Malware which attack computer or server often triggers network traffic anomaly phenomena. Based on Sophos's report[2], Indonesia is the riskiest country of malware attack and it also has high network traffic anomaly. This research uses Artificial Neural Network (ANN) to predict network traffic anomaly based on malware attack in Indonesia which is recorded by Id-SIRTII/CC (Indonesia Security Incident Response Team on Internet Infrastructure/Coordination Center). The case study is the highest malware attack (SQL injection) which has happened in three consecutive years: 2012, 2013, and 2014[4]. The data series is preprocessed first, then the network traffic anomaly is predicted using Artificial Neural Network and using two weight update algorithms: Gradient Descent and Momentum. Error of prediction is calculated using Mean Squared Error (MSE) [7]. The experimental result shows that MSE for SQL Injection is 0.03856. So, this approach can be used to predict network traffic anomaly.

  1. Effects of network node consolidation in optical access and aggregation networks on costs and power consumption

    Science.gov (United States)

    Lange, Christoph; Hülsermann, Ralf; Kosiankowski, Dirk; Geilhardt, Frank; Gladisch, Andreas

    2010-01-01

    The increasing demand for higher bit rates in access networks requires fiber deployment closer to the subscriber resulting in fiber-to-the-home (FTTH) access networks. Besides higher access bit rates optical access network infrastructure and related technologies enable the network operator to establish larger service areas resulting in a simplified network structure with a lower number of network nodes. By changing the network structure network operators want to benefit from a changed network cost structure by decreasing in short and mid term the upfront investments for network equipment due to concentration effects as well as by reducing the energy costs due to a higher energy efficiency of large network sites housing a high amount of network equipment. In long term also savings in operational expenditures (OpEx) due to the closing of central office (CO) sites are expected. In this paper different architectures for optical access networks basing on state-of-the-art technology are analyzed with respect to network installation costs and power consumption in the context of access node consolidation. Network planning and dimensioning results are calculated for a realistic network scenario of Germany. All node consolidation scenarios are compared against a gigabit capable passive optical network (GPON) based FTTH access network operated from the conventional CO sites. The results show that a moderate reduction of the number of access nodes may be beneficial since in that case the capital expenditures (CapEx) do not rise extraordinarily and savings in OpEx related to the access nodes are expected. The total power consumption does not change significantly with decreasing number of access nodes but clustering effects enable a more energyefficient network operation and optimized power purchase order quantities leading to benefits in energy costs.

  2. Dynamic VM provisioning for TORQUE in a cloud environment

    International Nuclear Information System (INIS)

    Zhang, S; Coddington, P; Boland, L; Sevior, M

    2014-01-01

    Cloud computing, also known as an Infrastructure-as-a-Service (IaaS), is attracting more interest from the commercial and educational sectors as a way to provide cost-effective computational infrastructure. It is an ideal platform for researchers who must share common resources but need to be able to scale up to massive computational requirements for specific periods of time. This paper presents the tools and techniques developed to allow the open source TORQUE distributed resource manager and Maui cluster scheduler to dynamically integrate OpenStack cloud resources into existing high throughput computing clusters.

  3. Dynamic VM Provisioning for TORQUE in a Cloud Environment

    Science.gov (United States)

    Zhang, S.; Boland, L.; Coddington, P.; Sevior, M.

    2014-06-01

    Cloud computing, also known as an Infrastructure-as-a-Service (IaaS), is attracting more interest from the commercial and educational sectors as a way to provide cost-effective computational infrastructure. It is an ideal platform for researchers who must share common resources but need to be able to scale up to massive computational requirements for specific periods of time. This paper presents the tools and techniques developed to allow the open source TORQUE distributed resource manager and Maui cluster scheduler to dynamically integrate OpenStack cloud resources into existing high throughput computing clusters.

  4. vm119_0601b-- Video mosaic segments

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — The Canadian ROPOS remotely operated vehicle (ROV) outfitted with video equipment (and other devices) was deployed from the NOAA Ship McAurthurII during May-June...

  5. A fusion networking model for smart grid power distribution backbone communication network based on PTN

    Directory of Open Access Journals (Sweden)

    Wang Hao

    2016-01-01

    Full Text Available In current communication network for distribution in Chinese power grid systems, the fiber communication backbone network for distribution and TD-LTE power private wireless backhaul network of power grid are both bearing by the SDH optical transmission network, which also carries the communication network of transformer substation and main electric. As the data traffic of the distribution communication and TD-LTE power private wireless network grow rapidly in recent years, it will have a big impact with the SDH network’s bearing capacity which is mainly used for main electric communication in high security level. This paper presents a fusion networking model which use a multiple-layer PTN network as the unified bearing of the TD-LTE power private wireless backhaul network and fiber communication backbone network for distribution. Network dataflow analysis shows that this model can greatly reduce the capacity pressure of the traditional SDH network as well as ensure the reliability of the transmission of the communication network for distribution and TD-LTE power private wireless network.

  6. Medical service provider networks.

    Science.gov (United States)

    Mougeot, Michel; Naegelen, Florence

    2018-05-17

    In many countries, health insurers or health plans choose to contract either with any willing providers or with preferred providers. We compare these mechanisms when two medical services are imperfect substitutes in demand and are supplied by two different firms. In both cases, the reimbursement is higher when patients select the in-network provider(s). We show that these mechanisms yield lower prices, lower providers' and insurer's profits, and lower expense than in the uniform-reimbursement case. Whatever the degree of product differentiation, a not-for-profit insurer should prefer selective contracting and select a reimbursement such that the out-of-pocket expense is null. Although all providers join the network under any-willing-provider contracting in the absence of third-party payment, an asymmetric equilibrium may exist when this billing arrangement is implemented. Copyright © 2018 John Wiley & Sons, Ltd.

  7. Fine Channel Networks

    Science.gov (United States)

    1997-01-01

    A color image of fine channel networks on Mars; north toward top. The scene shows heavily cratered highlands dissected by dendritic open channel networks that dissect steep slopes of impact crater walls. This image is a composite of Viking high-resolution images in black and white and low-resolution images in color. The image extends from latitude 9 degrees S. to 5 degrees S. and from longitude 312 degrees to 320 degrees; Mercator projection. The dendritic pattern of the fine channels and their location on steep slopes leads to the interpretation that these are runoff channels. The restriction of these types of channels to ancient highland rocks suggests that these channels are old and date from a time on Mars when conditions existed for precipitation to actively erode rocks. After the channels reach a low plain, they appear to end. Termination may have resulted from burial by younger deposits or perhaps the flows percolated into the surface materials and continued underground.

  8. Outlining the benefits of Strategic Networking

    Directory of Open Access Journals (Sweden)

    Eva Maria Eckenhofer

    2011-10-01

    Full Text Available Social Networks have attracted enormous interest in the scientific community in recent years. The characteristics, components and impacts of social networks have been studied through different kinds of aspects, such as sociological, geographical, ethnological, political and economical. In economics social network studies have been performed on intra- and inter-organizational levels, though rarely simultaneously. Furthermore the strategic aspects of fostering and controlling informal organizational networks as well as the outcomes of these managerial attempts on the network characteristics and the performance of the organization have not been sufficiently studied yet. However, the need to develop, foster and manage networks efficiently is given for preventing negative effects and provoking positive ones. Therefore this study contributes to scientific theory and practical business development by exploring the influence of Strategic Networking in inter- as well as intra-organizational business-fields. For study the author develops and defines Strategic Networking as the strategic and target-oriented analysis, development, fostering and control of (inter- as well as intra-organizational networks on the basis of trust, with the intention to reach certain (organizational goals and tests its applicability and effects in an extensive survey on three levels: intra-, inter-organizational and regional networks (cluster. The survey showed that Strategic Networking goes in line with favourable network characteristics as well as the success of a firm in terms of financial and non-financial performance measures.

  9. Soft matter: rubber and networks

    Science.gov (United States)

    McKenna, Gregory B.

    2018-06-01

    Rubber networks are important and form the basis for materials with properties ranging from rubber tires to super absorbents and contact lenses. The development of the entropy ideas of rubber deformation thermodynamics provides a powerful framework from which to understand and to use these materials. In addition, swelling of the rubber in the presence of small molecule liquids or solvents leads to materials that are very soft and ‘gel’ like in nature. The review covers the thermodynamics of polymer networks and gels from the perspective of the thermodynamics and mechanics of the strain energy density function. Important relationships are presented and experimental results show that the continuum ideas contained in the phenomenological thermodynamics are valid, but that the molecular bases for some of them remain to be fully elucidated. This is particularly so in the case of the entropic gels or swollen networks. The review is concluded with some perspectives on other networks, ranging from entropic polymer networks such as thermoplastic elastomers to physical gels in which cross-link points are formed by glassy or crystalline domains. A discussion is provided for other physical gels in which the network forms a spinodal-like decomposition, both in thermoplastic polymers that form a glassy network upon phase separation and for colloidal gels that seem to have a similar behavior.

  10. Pinning Control Strategy of Multicommunity Structure Networks

    Directory of Open Access Journals (Sweden)

    Chao Ding

    2017-01-01

    Full Text Available In order to investigate the effects of community structure on synchronization, a pinning control strategy is researched in a class of complex networks with community structure in this paper. A feedback control law is designed based on the network community structure information. The stability condition is given and proved by using Lyapunov stability theory. Our research shows that as to community structure networks, there being a threshold hT≈5, when coupling strength bellows this threshold, the stronger coupling strength corresponds to higher synchronizability; vice versa, the stronger coupling strength brings lower synchronizability. In addition the synchronizability of overlapping and nonoverlapping community structure networks was simulated and analyzed; while the nodes were controlled randomly and intensively, the results show that intensive control strategy is better than the random one. The network will reach synchronization easily when the node with largest betweenness was controlled. Furthermore, four difference networks’ synchronizability, such as Barabási-Albert network, Watts-Strogatz network, Erdös-Rényi network, and community structure network, are simulated; the research shows that the community structure network is more easily synchronized under the same control strength.

  11. Statistical physics of interacting neural networks

    Science.gov (United States)

    Kinzel, Wolfgang; Metzler, Richard; Kanter, Ido

    2001-12-01

    Recent results on the statistical physics of time series generation and prediction are presented. A neural network is trained on quasi-periodic and chaotic sequences and overlaps to the sequence generator as well as the prediction errors are calculated numerically. For each network there exists a sequence for which it completely fails to make predictions. Two interacting networks show a transition to perfect synchronization. A pool of interacting networks shows good coordination in the minority game-a model of competition in a closed market. Finally, as a demonstration, a perceptron predicts bit sequences produced by human beings.

  12. Statistical Network Analysis for Functional MRI: Mean Networks and Group Comparisons.

    Directory of Open Access Journals (Sweden)

    Cedric E Ginestet

    2014-05-01

    Full Text Available Comparing networks in neuroscience is hard, because the topological properties of a given network are necessarily dependent on the number of edges of that network. This problem arises in the analysis of both weighted and unweighted networks. The term density is often used in this context, in order to refer to the mean edge weight of a weighted network, or to the number of edges in an unweighted one. Comparing families of networks is therefore statistically difficult because differences in topology are necessarily associated with differences in density. In this review paper, we consider this problem from two different perspectives, which include (i the construction of summary networks, such as how to compute and visualize the mean network from a sample of network-valued data points; and (ii how to test for topological differences, when two families of networks also exhibit significant differences in density. In the first instance, we show that the issue of summarizing a family of networks can be conducted by either adopting a mass-univariate approach, which produces a statistical parametric network (SPN, or by directly computing the mean network, provided that a metric has been specified on the space of all networks with a given number of nodes. In the second part of this review, we then highlight the inherent problems associated with the comparison of topological functions of families of networks that differ in density. In particular, we show that a wide range of topological summaries, such as global efficiency and network modularity are highly sensitive to differences in density. Moreover, these problems are not restricted to unweighted metrics, as we demonstrate that the same issues remain present when considering the weighted versions of these metrics. We conclude by encouraging caution, when reporting such statistical comparisons, and by emphasizing the importance of constructing summary networks.

  13. Payload specialist Reinhard Furrer show evidence of previous blood sampling

    Science.gov (United States)

    1985-01-01

    Payload specialist Reinhard Furrer shows evidence of previous blood sampling while Wubbo J. Ockels, Dutch payload specialist (only partially visible), extends his right arm after a sample has been taken. Both men show bruises on their arms.

  14. Special issue on network coding

    Science.gov (United States)

    Monteiro, Francisco A.; Burr, Alister; Chatzigeorgiou, Ioannis; Hollanti, Camilla; Krikidis, Ioannis; Seferoglu, Hulya; Skachek, Vitaly

    2017-12-01

    Future networks are expected to depart from traditional routing schemes in order to embrace network coding (NC)-based schemes. These have created a lot of interest both in academia and industry in recent years. Under the NC paradigm, symbols are transported through the network by combining several information streams originating from the same or different sources. This special issue contains thirteen papers, some dealing with design aspects of NC and related concepts (e.g., fountain codes) and some showcasing the application of NC to new services and technologies, such as data multi-view streaming of video or underwater sensor networks. One can find papers that show how NC turns data transmission more robust to packet losses, faster to decode, and more resilient to network changes, such as dynamic topologies and different user options, and how NC can improve the overall throughput. This issue also includes papers showing that NC principles can be used at different layers of the networks (including the physical layer) and how the same fundamental principles can lead to new distributed storage systems. Some of the papers in this issue have a theoretical nature, including code design, while others describe hardware testbeds and prototypes.

  15. Contagion risk in endogenous financial networks

    International Nuclear Information System (INIS)

    Li, Shouwei; Sui, Xin

    2016-01-01

    Highlights: • We propose an endogenous financial network model. • Endogenous networks include interbank networks, inter-firm networks and bank-firm networks. • We investigate contagion risk in endogenous financial networks. - Abstract: In this paper, we investigate contagion risk in an endogenous financial network, which is characterized by credit relationships connecting downstream and upstream firms, interbank credit relationships and credit relationships connecting firms and banks. The findings suggest that: increasing the number of potential lenders randomly selected can lead to an increase in the number of bank bankruptcies, while the number of firm bankruptcies presents a trend of increase after the decrease; after the intensity of choice parameter rises beyond a threshold, the number of bankruptcies in three sectors (downstream firms, upstream firms and banks) shows a relatively large margin of increase, and keeps at a relatively high level; there exists different trends for bankruptcies in different sectors with the change of the parameter of credits’ interest rates.

  16. Deep hierarchical attention network for video description

    Science.gov (United States)

    Li, Shuohao; Tang, Min; Zhang, Jun

    2018-03-01

    Pairing video to natural language description remains a challenge in computer vision and machine translation. Inspired by image description, which uses an encoder-decoder model for reducing visual scene into a single sentence, we propose a deep hierarchical attention network for video description. The proposed model uses convolutional neural network (CNN) and bidirectional LSTM network as encoders while a hierarchical attention network is used as the decoder. Compared to encoder-decoder models used in video description, the bidirectional LSTM network can capture the temporal structure among video frames. Moreover, the hierarchical attention network has an advantage over single-layer attention network on global context modeling. To make a fair comparison with other methods, we evaluate the proposed architecture with different types of CNN structures and decoders. Experimental results on the standard datasets show that our model has a more superior performance than the state-of-the-art techniques.

  17. Application of Configurators in Networks

    DEFF Research Database (Denmark)

    Malis, Martin; Hvam, Lars

    2003-01-01

    Shorter lead-time, improved quality of product specifications and better communication with customers and suppliers are benefits derived from the application of configurators. Configurators are knowledge-based IT-systems that can be applied to deal with product knowledge and to support different...... processes in a company. Traditionally, configurators have been used as an internal tool. In this paper focus will be on the application of configurators in a network of companies, and a procedure for developing product configurators in a network of companies will be presented. The aim is to present...... a structured guideline, tools and methods on how to successfully develop configurators in a network perspective. Findings presented in this paper are supported by research in a case company. The results from the empirical work show a huge potential for the application of configurators in networks of companies....

  18. Neural Network for Sparse Reconstruction

    Directory of Open Access Journals (Sweden)

    Qingfa Li

    2014-01-01

    Full Text Available We construct a neural network based on smoothing approximation techniques and projected gradient method to solve a kind of sparse reconstruction problems. Neural network can be implemented by circuits and can be seen as an important method for solving optimization problems, especially large scale problems. Smoothing approximation is an efficient technique for solving nonsmooth optimization problems. We combine these two techniques to overcome the difficulties of the choices of the step size in discrete algorithms and the item in the set-valued map of differential inclusion. In theory, the proposed network can converge to the optimal solution set of the given problem. Furthermore, some numerical experiments show the effectiveness of the proposed network in this paper.

  19. Controlling centrality in complex networks

    Science.gov (United States)

    Nicosia, V.; Criado, R.; Romance, M.; Russo, G.; Latora, V.

    2012-01-01

    Spectral centrality measures allow to identify influential individuals in social groups, to rank Web pages by popularity, and even to determine the impact of scientific researches. The centrality score of a node within a network crucially depends on the entire pattern of connections, so that the usual approach is to compute node centralities once the network structure is assigned. We face here with the inverse problem, that is, we study how to modify the centrality scores of the nodes by acting on the structure of a given network. We show that there exist particular subsets of nodes, called controlling sets, which can assign any prescribed set of centrality values to all the nodes of a graph, by cooperatively tuning the weights of their out-going links. We found that many large networks from the real world have surprisingly small controlling sets, containing even less than 5 – 10% of the nodes. PMID:22355732

  20. Senior Managers’ Network Tie Use

    DEFF Research Database (Denmark)

    Zarzecka, Olga; Villeseche, Florence

    While the importance or even necessity to build and maintain resourceful social networks appears as a forthright fact, there is still a lack of certainty as to who benefits from the resources that can be accessed through senior managers’ networks, and under what conditions. In this paper, we...... contribute to answering this puzzle with a sample constituted of senior managers from Denmark and their network ties, and investigate both economic and sociological conditions of senior managers’ tie use. Our results show that the greater the distance between aspiration level and actual firm performance......, the more likely it is that senior managers will use their network ties to access resources that benefit chiefly the individual rather than the organization. In addition, we demonstrate that this rapport is moderated by senior managers’ social identity as a member of the corporate elite, so that a strong...

  1. Hierarchical Network Design

    DEFF Research Database (Denmark)

    Thomadsen, Tommy

    2005-01-01

    Communication networks are immensely important today, since both companies and individuals use numerous services that rely on them. This thesis considers the design of hierarchical (communication) networks. Hierarchical networks consist of layers of networks and are well-suited for coping...... with changing and increasing demands. Two-layer networks consist of one backbone network, which interconnects cluster networks. The clusters consist of nodes and links, which connect the nodes. One node in each cluster is a hub node, and the backbone interconnects the hub nodes of each cluster and thus...... the clusters. The design of hierarchical networks involves clustering of nodes, hub selection, and network design, i.e. selection of links and routing of ows. Hierarchical networks have been in use for decades, but integrated design of these networks has only been considered for very special types of networks...

  2. Synchronization of networks

    Indian Academy of Sciences (India)

    We study the synchronization of coupled dynamical systems on networks. The dynamics is .... Such a time-varying topology can occur in social networks, computer networks, WWW ... This has the effect of reducing the spread of the transverse ...

  3. Reconfigurable network processing platforms

    NARCIS (Netherlands)

    Kachris, C.

    2007-01-01

    This dissertation presents our investigation on how to efficiently exploit reconfigurable hardware to design flexible, high performance, and power efficient network devices capable to adapt to varying processing requirements of network applications and traffic. The proposed reconfigurable network

  4. Collaborative networks: Reference modeling

    NARCIS (Netherlands)

    Camarinha-Matos, L.M.; Afsarmanesh, H.

    2008-01-01

    Collaborative Networks: Reference Modeling works to establish a theoretical foundation for Collaborative Networks. Particular emphasis is put on modeling multiple facets of collaborative networks and establishing a comprehensive modeling framework that captures and structures diverse perspectives of

  5. Introduction to computer networking

    CERN Document Server

    Robertazzi, Thomas G

    2017-01-01

    This book gives a broad look at both fundamental networking technology and new areas that support it and use it. It is a concise introduction to the most prominent, recent technological topics in computer networking. Topics include network technology such as wired and wireless networks, enabling technologies such as data centers, software defined networking, cloud and grid computing and applications such as networks on chips, space networking and network security. The accessible writing style and non-mathematical treatment makes this a useful book for the student, network and communications engineer, computer scientist and IT professional. • Features a concise, accessible treatment of computer networking, focusing on new technological topics; • Provides non-mathematical introduction to networks in their most common forms today;< • Includes new developments in switching, optical networks, WiFi, Bluetooth, LTE, 5G, and quantum cryptography.

  6. Visualization of Social Networks

    NARCIS (Netherlands)

    Boertjes, E.M.; Kotterink, B.; Jager, E.J.

    2011-01-01

    Current visualizations of social networks are mostly some form of node-link diagram. Depending on the type of social network, this can be some treevisualization with a strict hierarchical structure or a more generic network visualization.

  7. Animal transportation networks

    Science.gov (United States)

    Perna, Andrea; Latty, Tanya

    2014-01-01

    Many group-living animals construct transportation networks of trails, galleries and burrows by modifying the environment to facilitate faster, safer or more efficient movement. Animal transportation networks can have direct influences on the fitness of individuals, whereas the shape and structure of transportation networks can influence community dynamics by facilitating contacts between different individuals and species. In this review, we discuss three key areas in the study of animal transportation networks: the topological properties of networks, network morphogenesis and growth, and the behaviour of network users. We present a brief primer on elements of network theory, and then discuss the different ways in which animal groups deal with the fundamental trade-off between the competing network properties of travel efficiency, robustness and infrastructure cost. We consider how the behaviour of network users can impact network efficiency, and call for studies that integrate both network topology and user behaviour. We finish with a prospectus for future research. PMID:25165598

  8. Network development plan 1995

    International Nuclear Information System (INIS)

    Anon.

    1995-11-01

    Network plan 1995 concerns several strategic problems, among others environmental policy of power transmission lines. Possibilities of restructuring aerial cable network are described. The state of the existing systems and plans for new network systems are presented. (EG)

  9. Research on the Prediction Model of CPU Utilization Based on ARIMA-BP Neural Network

    Directory of Open Access Journals (Sweden)

    Wang Jina

    2016-01-01

    Full Text Available The dynamic deployment technology of the virtual machine is one of the current cloud computing research focuses. The traditional methods mainly work after the degradation of the service performance that usually lag. To solve the problem a new prediction model based on the CPU utilization is constructed in this paper. A reference offered by the new prediction model of the CPU utilization is provided to the VM dynamic deployment process which will speed to finish the deployment process before the degradation of the service performance. By this method it not only ensure the quality of services but also improve the server performance and resource utilization. The new prediction method of the CPU utilization based on the ARIMA-BP neural network mainly include four parts: preprocess the collected data, build the predictive model of ARIMA-BP neural network, modify the nonlinear residuals of the time series by the BP prediction algorithm and obtain the prediction results by analyzing the above data comprehensively.

  10. Hierarchy Measure for Complex Networks

    Science.gov (United States)

    Mones, Enys; Vicsek, Lilla; Vicsek, Tamás

    2012-01-01

    Nature, technology and society are full of complexity arising from the intricate web of the interactions among the units of the related systems (e.g., proteins, computers, people). Consequently, one of the most successful recent approaches to capturing the fundamental features of the structure and dynamics of complex systems has been the investigation of the networks associated with the above units (nodes) together with their relations (edges). Most complex systems have an inherently hierarchical organization and, correspondingly, the networks behind them also exhibit hierarchical features. Indeed, several papers have been devoted to describing this essential aspect of networks, however, without resulting in a widely accepted, converging concept concerning the quantitative characterization of the level of their hierarchy. Here we develop an approach and propose a quantity (measure) which is simple enough to be widely applicable, reveals a number of universal features of the organization of real-world networks and, as we demonstrate, is capable of capturing the essential features of the structure and the degree of hierarchy in a complex network. The measure we introduce is based on a generalization of the m-reach centrality, which we first extend to directed/partially directed graphs. Then, we define the global reaching centrality (GRC), which is the difference between the maximum and the average value of the generalized reach centralities over the network. We investigate the behavior of the GRC considering both a synthetic model with an adjustable level of hierarchy and real networks. Results for real networks show that our hierarchy measure is related to the controllability of the given system. We also propose a visualization procedure for large complex networks that can be used to obtain an overall qualitative picture about the nature of their hierarchical structure. PMID:22470477

  11. Network evolution of body plans.

    Directory of Open Access Journals (Sweden)

    Koichi Fujimoto

    Full Text Available One of the major goals in evolutionary developmental biology is to understand the relationship between gene regulatory networks and the diverse morphologies and their functionalities. Are the diversities solely triggered by random events, or are they inevitable outcomes of an interplay between evolving gene networks and natural selection? Segmentation in arthropod embryogenesis represents a well-known example of body plan diversity. Striped patterns of gene expression that lead to the future body segments appear simultaneously or sequentially in long and short germ-band development, respectively. Moreover, a combination of both is found in intermediate germ-band development. Regulatory genes relevant for stripe formation are evolutionarily conserved among arthropods, therefore the differences in the observed traits are thought to have originated from how the genes are wired. To reveal the basic differences in the network structure, we have numerically evolved hundreds of gene regulatory networks that produce striped patterns of gene expression. By analyzing the topologies of the generated networks, we show that the characteristics of stripe formation in long and short germ-band development are determined by Feed-Forward Loops (FFLs and negative Feed-Back Loops (FBLs respectively, and those of intermediate germ-band development are determined by the interconnections between FFL and negative FBL. Network architectures, gene expression patterns and knockout responses exhibited by the artificially evolved networks agree with those reported in the fly Drosophila melanogaster and the beetle Tribolium castaneum. For other arthropod species, principal network architectures that remain largely unknown are predicted. Our results suggest that the emergence of the three modes of body segmentation in arthropods is an inherent property of the evolving networks.

  12. Basics of Computer Networking

    CERN Document Server

    Robertazzi, Thomas

    2012-01-01

    Springer Brief Basics of Computer Networking provides a non-mathematical introduction to the world of networks. This book covers both technology for wired and wireless networks. Coverage includes transmission media, local area networks, wide area networks, and network security. Written in a very accessible style for the interested layman by the author of a widely used textbook with many years of experience explaining concepts to the beginner.

  13. Packet Tracer network simulator

    CERN Document Server

    Jesin, A

    2014-01-01

    A practical, fast-paced guide that gives you all the information you need to successfully create networks and simulate them using Packet Tracer.Packet Tracer Network Simulator is aimed at students, instructors, and network administrators who wish to use this simulator to learn how to perform networking instead of investing in expensive, specialized hardware. This book assumes that you have a good amount of Cisco networking knowledge, and it will focus more on Packet Tracer rather than networking.

  14. The Economics of Networking

    DEFF Research Database (Denmark)

    Sørensen, Olav Jull

    The literature on business networks is often oversocialized. The economic side of business is implicitly assumed. This paper analyses the economics of network behavior by loking at each of the key concepts in the Network Theory.......The literature on business networks is often oversocialized. The economic side of business is implicitly assumed. This paper analyses the economics of network behavior by loking at each of the key concepts in the Network Theory....

  15. Clusters in nonsmooth oscillator networks

    Science.gov (United States)

    Nicks, Rachel; Chambon, Lucie; Coombes, Stephen

    2018-03-01

    For coupled oscillator networks with Laplacian coupling, the master stability function (MSF) has proven a particularly powerful tool for assessing the stability of the synchronous state. Using tools from group theory, this approach has recently been extended to treat more general cluster states. However, the MSF and its generalizations require the determination of a set of Floquet multipliers from variational equations obtained by linearization around a periodic orbit. Since closed form solutions for periodic orbits are invariably hard to come by, the framework is often explored using numerical techniques. Here, we show that further insight into network dynamics can be obtained by focusing on piecewise linear (PWL) oscillator models. Not only do these allow for the explicit construction of periodic orbits, their variational analysis can also be explicitly performed. The price for adopting such nonsmooth systems is that many of the notions from smooth dynamical systems, and in particular linear stability, need to be modified to take into account possible jumps in the components of Jacobians. This is naturally accommodated with the use of saltation matrices. By augmenting the variational approach for studying smooth dynamical systems with such matrices we show that, for a wide variety of networks that have been used as models of biological systems, cluster states can be explicitly investigated. By way of illustration, we analyze an integrate-and-fire network model with event-driven synaptic coupling as well as a diffusively coupled network built from planar PWL nodes, including a reduction of the popular Morris-Lecar neuron model. We use these examples to emphasize that the stability of network cluster states can depend as much on the choice of single node dynamics as it does on the form of network structural connectivity. Importantly, the procedure that we present here, for understanding cluster synchronization in networks, is valid for a wide variety of systems in

  16. The effect of narrow provider networks on health care use.

    Science.gov (United States)

    Atwood, Alicia; Lo Sasso, Anthony T

    2016-12-01

    Network design is an often overlooked aspect of health insurance contracts. Recent policy factors have resulted in narrower provider networks. We provide plausibly causal evidence on the effect of narrow network plans offered by a large national health insurance carrier in a major metropolitan market. Our econometric design exploits the fact that some firms offer a narrow network plan to their employees and some do not. Our results show that narrow network health plans lead to reductions in health care utilization and spending. We find evidence that narrow networks save money by selecting lower cost providers into the network. Copyright © 2016 Elsevier B.V. All rights reserved.

  17. Finding quasi-optimal network topologies for information transmission in active networks.

    Science.gov (United States)

    Baptista, Murilo S; de Carvalho, Josué X; Hussein, Mahir S

    2008-01-01

    This work clarifies the relation between network circuit (topology) and behaviour (information transmission and synchronization) in active networks, e.g. neural networks. As an application, we show how one can find network topologies that are able to transmit a large amount of information, possess a large number of communication channels, and are robust under large variations of the network coupling configuration. This theoretical approach is general and does not depend on the particular dynamic of the elements forming the network, since the network topology can be determined by finding a Laplacian matrix (the matrix that describes the connections and the coupling strengths among the elements) whose eigenvalues satisfy some special conditions. To illustrate our ideas and theoretical approaches, we use neural networks of electrically connected chaotic Hindmarsh-Rose neurons.

  18. Finding quasi-optimal network topologies for information transmission in active networks.

    Directory of Open Access Journals (Sweden)

    Murilo S Baptista

    Full Text Available This work clarifies the relation between network circuit (topology and behaviour (information transmission and synchronization in active networks, e.g. neural networks. As an application, we show how one can find network topologies that are able to transmit a large amount of information, possess a large number of communication channels, and are robust under large variations of the network coupling configuration. This theoretical approach is general and does not depend on the particular dynamic of the elements forming the network, since the network topology can be determined by finding a Laplacian matrix (the matrix that describes the connections and the coupling strengths among the elements whose eigenvalues satisfy some special conditions. To illustrate our ideas and theoretical approaches, we use neural networks of electrically connected chaotic Hindmarsh-Rose neurons.

  19. An Improved Car-Following Model in Vehicle Networking Based on Network Control

    Directory of Open Access Journals (Sweden)

    D. Y. Kong

    2014-01-01

    Full Text Available Vehicle networking is a system to realize information interoperability between vehicles and people, vehicles and roads, vehicles and vehicles, and cars and transport facilities, through the network information exchange, in order to achieve the effective monitoring of the vehicle and traffic flow. Realizing information interoperability between vehicles and vehicles, which can affect the traffic flow, is an important application of network control system (NCS. In this paper, a car-following model using vehicle networking theory is established, based on network control principle. The car-following model, which is an improvement of the traditional traffic model, describes the traffic in vehicle networking condition. The impact that vehicle networking has on the traffic flow is quantitatively assessed in a particular scene of one-way, no lane changing highway. The examples show that the capacity of the road is effectively enhanced by using vehicle networking.

  20. Local Social Networks

    DEFF Research Database (Denmark)

    Sapuppo, Antonio; Sørensen, Lene Tolstrup

    2011-01-01

    Online social networks have become essential for many users in their daily communication. Through a combination of the online social networks with opportunistic networks, a new concept arises: Local Social Networks. The target of local social networks is to promote social networking benefits...... in physical environment in order to leverage personal affinities in the users' surroundings. The purpose of this paper is to present and discuss the concept of local social networks as a new social communication system. Particularly, the preliminary architecture and the prototype of local social networks...

  1. Integrating Networking into ATLAS

    CERN Document Server

    Mc Kee, Shawn Patrick; The ATLAS collaboration

    2018-01-01

    Networking is foundational to the ATLAS distributed infrastructure and there are many ongoing activities related to networking both within and outside of ATLAS. We will report on the progress in a number of areas exploring ATLAS's use of networking and our ability to monitor the network, analyze metrics from the network, and tune and optimize application and end-host parameters to make the most effective use of the network. Specific topics will include work on Open vSwitch for production systems, network analytics, FTS testing and tuning, and network problem alerting and alarming.

  2. Lagged correlation networks

    Science.gov (United States)

    Curme, Chester

    Technological advances have provided scientists with large high-dimensional datasets that describe the behaviors of complex systems: from the statistics of energy levels in complex quantum systems, to the time-dependent transcription of genes, to price fluctuations among assets in a financial market. In this environment, where it may be difficult to infer the joint distribution of the data, network science has flourished as a way to gain insight into the structure and organization of such systems by focusing on pairwise interactions. This work focuses on a particular setting, in which a system is described by multivariate time series data. We consider time-lagged correlations among elements in this system, in such a way that the measured interactions among elements are asymmetric. Finally, we allow these interactions to be characteristically weak, so that statistical uncertainties may be important to consider when inferring the structure of the system. We introduce a methodology for constructing statistically validated networks to describe such a system, extend the methodology to accommodate interactions with a periodic component, and show how consideration of bipartite community structures in these networks can aid in the construction of robust statistical models. An example of such a system is a financial market, in which high frequency returns data may be used to describe contagion, or the spreading of shocks in price among assets. These data provide the experimental testing ground for our methodology. We study NYSE data from both the present day and one decade ago, examine the time scales over which the validated lagged correlation networks exist, and relate differences in the topological properties of the networks to an increasing economic efficiency. We uncover daily periodicities in the validated interactions, and relate our findings to explanations of the Epps Effect, an empirical phenomenon of financial time series. We also study bipartite community

  3. Epidemics scenarios in the "Romantic network".

    Directory of Open Access Journals (Sweden)

    Alexsandro M Carvalho

    Full Text Available The networks of sexual contacts together with temporal interactions play key roles in the spread of sexually transmitted infections. Unfortunately, data for this kind of network is scarce. One of the few exceptions, the "Romantic network", is a complete structure of a real sexual network in a high school. Based on many network measurements the authors of the work have concluded that it does not correspond to any other model network. Regarding the temporal structure, several studies indicate that relationship timing can have an effect on the diffusion throughout networks, as relationship order determines transmission routes. The aim is to check if the particular structure, static and dynamic, of the Romantic network is determinant for the propagation of an STI. We performed simulations in two scenarios: the static network where all contacts are available and the dynamic case where contacts evolve over time. In the static case, we compared the epidemic results in the Romantic network with some paradigmatic topologies. In the dynamic scenario, we considered the dynamics of formation of pairs in the Romantic network and we studied the propagation of the diseases. Our results suggest that although this real network cannot be labeled as a Watts-Strogatz network, it is, in regard to the propagation of an STI, very similar to a high disorder network. Additionally, we found that: the effect that any individual contacting an externally infected subject is to make the network closer to a fully connected one, the higher the contact degree of patient zero the faster the spread of the outbreaks, and the epidemic impact is proportional to the numbers of contacts per unit time. Finally, our simulations confirm that relationship timing severely reduced the final outbreak size, and also, show a clear correlation between the average degree and the outbreak size over time.

  4. Decoding communities in networks

    Science.gov (United States)

    Radicchi, Filippo

    2018-02-01

    According to a recent information-theoretical proposal, the problem of defining and identifying communities in networks can be interpreted as a classical communication task over a noisy channel: memberships of nodes are information bits erased by the channel, edges and nonedges in the network are parity bits introduced by the encoder but degraded through the channel, and a community identification algorithm is a decoder. The interpretation is perfectly equivalent to the one at the basis of well-known statistical inference algorithms for community detection. The only difference in the interpretation is that a noisy channel replaces a stochastic network model. However, the different perspective gives the opportunity to take advantage of the rich set of tools of coding theory to generate novel insights on the problem of community detection. In this paper, we illustrate two main applications of standard coding-theoretical methods to community detection. First, we leverage a state-of-the-art decoding technique to generate a family of quasioptimal community detection algorithms. Second and more important, we show that the Shannon's noisy-channel coding theorem can be invoked to establish a lower bound, here named as decodability bound, for the maximum amount of noise tolerable by an ideal decoder to achieve perfect detection of communities. When computed for well-established synthetic benchmarks, the decodability bound explains accurately the performance achieved by the best community detection algorithms existing on the market, telling us that only little room for their improvement is still potentially left.

  5. Decoding communities in networks.

    Science.gov (United States)

    Radicchi, Filippo

    2018-02-01

    According to a recent information-theoretical proposal, the problem of defining and identifying communities in networks can be interpreted as a classical communication task over a noisy channel: memberships of nodes are information bits erased by the channel, edges and nonedges in the network are parity bits introduced by the encoder but degraded through the channel, and a community identification algorithm is a decoder. The interpretation is perfectly equivalent to the one at the basis of well-known statistical inference algorithms for community detection. The only difference in the interpretation is that a noisy channel replaces a stochastic network model. However, the different perspective gives the opportunity to take advantage of the rich set of tools of coding theory to generate novel insights on the problem of community detection. In this paper, we illustrate two main applications of standard coding-theoretical methods to community detection. First, we leverage a state-of-the-art decoding technique to generate a family of quasioptimal community detection algorithms. Second and more important, we show that the Shannon's noisy-channel coding theorem can be invoked to establish a lower bound, here named as decodability bound, for the maximum amount of noise tolerable by an ideal decoder to achieve perfect detection of communities. When computed for well-established synthetic benchmarks, the decodability bound explains accurately the performance achieved by the best community detection algorithms existing on the market, telling us that only little room for their improvement is still potentially left.

  6. Identifying changes in the support networks of end-of-life carers using social network analysis.

    Science.gov (United States)

    Leonard, Rosemary; Horsfall, Debbie; Noonan, Kerrie

    2015-06-01

    End-of-life caring is often associated with reduced social networks for both the dying person and for the carer. However, those adopting a community participation and development approach, see the potential for the expansion and strengthening of networks. This paper uses Knox, Savage and Harvey's definitions of three generations social network analysis to analyse the caring networks of people with a terminal illness who are being cared for at home and identifies changes in these caring networks that occurred over the period of caring. Participatory network mapping of initial and current networks was used in nine focus groups. The analysis used key concepts from social network analysis (size, density, transitivity, betweenness and local clustering) together with qualitative analyses of the group's reflections on the maps. The results showed an increase in the size of the networks and that ties between the original members of the network strengthened. The qualitative data revealed the importance between core and peripheral network members and the diverse contributions of the network members. The research supports the value of third generation social network analysis and the potential for end-of-life caring to build social capital. Published by the BMJ Publishing Group Limited. For permission to use (where not already granted under a licence) please go to http://group.bmj.com/group/rights-licensing/permissions.

  7. Network Plus

    Science.gov (United States)

    Bender, Walter; Chesnais, Pascal

    1988-05-01

    Over the past several years, the Electronic Publishing Group at the MIT Media Laboratory has been conducting a family of media experiments which explore a new kind of broadcast: the distribution of data and computer programs rather than pre-packaged material. This broadcast is not directed to a human recipient, but to a local computational agent acting on his behalf. In response to instructions from both the broadcaster and the reader, this agent selects from the incoming data and presents it in a manner suggestive of traditional media. The embodiment of these media experiments is a news retrieval system where the news editor has been replaced by the personal computer. A variety of both local and remote databases which operate passively as well as interac-tively are accessed by "reporters." These "reporters" are actually software interfaces, which are programmed to gather news. Ideally, they are "broadcatching" that is to say, watching all broadcast television channels, listening to all radio transmissions, and reading all newspapers, magazines, and journals. 1 A possible consequence of the synthesis of media through active processing is the merger of newspapers and television (figure 1). The result is either a newspaper with illustrations which move 2 or, conversely, print as television output. The latter is the theme of Network Plus.

  8. Network structure exploration via Bayesian nonparametric models

    International Nuclear Information System (INIS)

    Chen, Y; Wang, X L; Xiang, X; Tang, B Z; Bu, J Z

    2015-01-01

    Complex networks provide a powerful mathematical representation of complex systems in nature and society. To understand complex networks, it is crucial to explore their internal structures, also called structural regularities. The task of network structure exploration is to determine how many groups there are in a complex network and how to group the nodes of the network. Most existing structure exploration methods need to specify either a group number or a certain type of structure when they are applied to a network. In the real world, however, the group number and also the certain type of structure that a network has are usually unknown in advance. To explore structural regularities in complex networks automatically, without any prior knowledge of the group number or the certain type of structure, we extend a probabilistic mixture model that can handle networks with any type of structure but needs to specify a group number using Bayesian nonparametric theory. We also propose a novel Bayesian nonparametric model, called the Bayesian nonparametric mixture (BNPM) model. Experiments conducted on a large number of networks with different structures show that the BNPM model is able to explore structural regularities in networks automatically with a stable, state-of-the-art performance. (paper)

  9. Nestedness of ectoparasite-vertebrate host networks.

    Directory of Open Access Journals (Sweden)

    Sean P Graham

    2009-11-01

    Full Text Available Determining the structure of ectoparasite-host networks will enable disease ecologists to better understand and predict the spread of vector-borne diseases. If these networks have consistent properties, then studying the structure of well-understood networks could lead to extrapolation of these properties to others, including those that support emerging pathogens. Borrowing a quantitative measure of network structure from studies of mutualistic relationships between plants and their pollinators, we analyzed 29 ectoparasite-vertebrate host networks--including three derived from molecular bloodmeal analysis of mosquito feeding patterns--using measures of nestedness to identify non-random interactions among species. We found significant nestedness in ectoparasite-vertebrate host lists for habitats ranging from tropical rainforests to polar environments. These networks showed non-random patterns of nesting, and did not differ significantly from published estimates of nestedness from mutualistic networks. Mutualistic and antagonistic networks appear to be organized similarly, with generalized ectoparasites interacting with hosts that attract many ectoparasites and more specialized ectoparasites usually interacting with these same "generalized" hosts. This finding has implications for understanding the network dynamics of vector-born pathogens. We suggest that nestedness (rather than random ectoparasite-host associations can allow rapid transfer of pathogens throughout a network, and expand upon such concepts as the dilution effect, bridge vectors, and host switching in the context of nested ectoparasite-vertebrate host networks.

  10. Epidemics spreading in interconnected complex networks

    International Nuclear Information System (INIS)

    Wang, Y.; Xiao, G.

    2012-01-01

    We study epidemic spreading in two interconnected complex networks. It is found that in our model the epidemic threshold of the interconnected network is always lower than that in any of the two component networks. Detailed theoretical analysis is proposed which allows quick and accurate calculations of epidemic threshold and average outbreak/epidemic size. Theoretical analysis and simulation results show that, generally speaking, the epidemic size is not significantly affected by the inter-network correlation. In interdependent networks which can be viewed as a special case of interconnected networks, however, impacts of inter-network correlation on the epidemic threshold and outbreak size are more significant. -- Highlights: ► We study epidemic spreading in two interconnected complex networks. ► The epidemic threshold is lower than that in any of the two networks. And Interconnection correlation has impacts on threshold and average outbreak size. ► Detailed theoretical analysis is proposed which allows quick and accurate calculations of epidemic threshold and average outbreak/epidemic size. ► We demonstrated and proved that Interconnection correlation does not affect epidemic size significantly. ► In interdependent networks, impacts of inter-network correlation on the epidemic threshold and outbreak size are more significant.

  11. Epidemics spreading in interconnected complex networks

    Energy Technology Data Exchange (ETDEWEB)

    Wang, Y. [School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore 639798 (Singapore); Institute of High Performance Computing, Agency for Science, Technology and Research (A-STAR), Singapore 138632 (Singapore); Xiao, G., E-mail: egxxiao@ntu.edu.sg [School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore 639798 (Singapore)

    2012-09-03

    We study epidemic spreading in two interconnected complex networks. It is found that in our model the epidemic threshold of the interconnected network is always lower than that in any of the two component networks. Detailed theoretical analysis is proposed which allows quick and accurate calculations of epidemic threshold and average outbreak/epidemic size. Theoretical analysis and simulation results show that, generally speaking, the epidemic size is not significantly affected by the inter-network correlation. In interdependent networks which can be viewed as a special case of interconnected networks, however, impacts of inter-network correlation on the epidemic threshold and outbreak size are more significant. -- Highlights: ► We study epidemic spreading in two interconnected complex networks. ► The epidemic threshold is lower than that in any of the two networks. And Interconnection correlation has impacts on threshold and average outbreak size. ► Detailed theoretical analysis is proposed which allows quick and accurate calculations of epidemic threshold and average outbreak/epidemic size. ► We demonstrated and proved that Interconnection correlation does not affect epidemic size significantly. ► In interdependent networks, impacts of inter-network correlation on the epidemic threshold and outbreak size are more significant.

  12. Cut Based Method for Comparing Complex Networks.

    Science.gov (United States)

    Liu, Qun; Dong, Zhishan; Wang, En

    2018-03-23

    Revealing the underlying similarity of various complex networks has become both a popular and interdisciplinary topic, with a plethora of relevant application domains. The essence of the similarity here is that network features of the same network type are highly similar, while the features of different kinds of networks present low similarity. In this paper, we introduce and explore a new method for comparing various complex networks based on the cut distance. We show correspondence between the cut distance and the similarity of two networks. This correspondence allows us to consider a broad range of complex networks and explicitly compare various networks with high accuracy. Various machine learning technologies such as genetic algorithms, nearest neighbor classification, and model selection are employed during the comparison process. Our cut method is shown to be suited for comparisons of undirected networks and directed networks, as well as weighted networks. In the model selection process, the results demonstrate that our approach outperforms other state-of-the-art methods with respect to accuracy.

  13. Epidemics in adaptive networks with community structure

    Science.gov (United States)

    Shaw, Leah; Tunc, Ilker

    2010-03-01

    Models for epidemic spread on static social networks do not account for changes in individuals' social interactions. Recent studies of adaptive networks have modeled avoidance behavior, as non-infected individuals try to avoid contact with infectives. Such models have not generally included realistic social structure. Here we study epidemic spread on an adaptive network with community structure. We model the effect of heterogeneous communities on infection levels and epidemic extinction. We also show how an epidemic can alter the community structure.

  14. Scaling Laws in Chennai Bus Network

    OpenAIRE

    Chatterjee, Atanu; Ramadurai, Gitakrishnan

    2015-01-01

    In this paper, we study the structural properties of the complex bus network of Chennai. We formulate this extensive network structure by identifying each bus stop as a node, and a bus which stops at any two adjacent bus stops as an edge connecting the nodes. Rigorous statistical analysis of this data shows that the Chennai bus network displays small-world properties and a scale-free degree distribution with the power-law exponent, $\\gamma > 3$.

  15. Stochastic synchronization in finite size spiking networks

    Science.gov (United States)

    Doiron, Brent; Rinzel, John; Reyes, Alex

    2006-09-01

    We study a stochastic synchronization of spiking activity in feedforward networks of integrate-and-fire model neurons. A stochastic mean field analysis shows that synchronization occurs only when the network size is sufficiently small. This gives evidence that the dynamics, and hence processing, of finite size populations can be drastically different from that observed in the infinite size limit. Our results agree with experimentally observed synchrony in cortical networks, and further strengthen the link between synchrony and propagation in cortical systems.

  16. Generalized instantly decodable network coding for relay-assisted networks

    KAUST Repository

    Elmahdy, Adel M.

    2013-09-01

    In this paper, we investigate the problem of minimizing the frame completion delay for Instantly Decodable Network Coding (IDNC) in relay-assisted wireless multicast networks. We first propose a packet recovery algorithm in the single relay topology which employs generalized IDNC instead of strict IDNC previously proposed in the literature for the same relay-assisted topology. This use of generalized IDNC is supported by showing that it is a super-set of the strict IDNC scheme, and thus can generate coding combinations that are at least as efficient as strict IDNC in reducing the average completion delay. We then extend our study to the multiple relay topology and propose a joint generalized IDNC and relay selection algorithm. This proposed algorithm benefits from the reception diversity of the multiple relays to further reduce the average completion delay in the network. Simulation results show that our proposed solutions achieve much better performance compared to previous solutions in the literature. © 2013 IEEE.

  17. Ecological network analysis for a virtual water network.

    Science.gov (United States)

    Fang, Delin; Chen, Bin

    2015-06-02

    The notions of virtual water flows provide important indicators to manifest the water consumption and allocation between different sectors via product transactions. However, the configuration of virtual water network (VWN) still needs further investigation to identify the water interdependency among different sectors as well as the network efficiency and stability in a socio-economic system. Ecological network analysis is chosen as a useful tool to examine the structure and function of VWN and the interactions among its sectors. A balance analysis of efficiency and redundancy is also conducted to describe the robustness (RVWN) of VWN. Then, network control analysis and network utility analysis are performed to investigate the dominant sectors and pathways for virtual water circulation and the mutual relationships between pairwise sectors. A case study of the Heihe River Basin in China shows that the balance between efficiency and redundancy is situated on the left side of the robustness curve with less efficiency and higher redundancy. The forestation, herding and fishing sectors and industrial sectors are found to be the main controllers. The network tends to be more mutualistic and synergic, though some competitive relationships that weaken the virtual water circulation still exist.

  18. Uudised : Otsman taas Riias show'l. Rokkstaarist ministriks

    Index Scriptorium Estoniae

    2007-01-01

    Drag-kabareeartist Erkki Otsman esineb detsembris Riias "Sapnu Fabrikas" toimuval jõulu-show'l. Austraalia rokkansambli Midnight Oil endine laulja Peter Garrett nimetati valitsuse keskkonnaministriks

  19. Identity and Professional Networking.

    Science.gov (United States)

    Raj, Medha; Fast, Nathanael J; Fisher, Oliver

    2017-06-01

    Despite evidence that large professional networks afford a host of financial and professional benefits, people vary in how motivated they are to build such networks. To help explain this variance, the present article moves beyond a rational self-interest account to examine the possibility that identity shapes individuals' intentions to network. Study 1 established a positive association between viewing professional networking as identity-congruent and the tendency to prioritize strengthening and expanding one's professional network. Study 2 revealed that manipulating the salience of the self affects networking intentions, but only among those high in networking identity-congruence. Study 3 further established causality by experimentally manipulating identity-congruence to increase networking intentions. Study 4 examined whether identity or self-interest is a better predictor of networking intentions, providing support for the former. These findings indicate that identity influences the networks people develop. Implications for research on the self, identity-based motivation, and professional networking are discussed.

  20. Performance of Group Communication Over Ad-Hoc Networks

    National Research Council Canada - National Science Library

    Mosko, Marc; Garcia-Luna-Aceves, J. J

    2002-01-01

    ... through a network of cluster trees, where a spanning tree joins groups of fully connected nodes. Through numerical analysis and simulations in GloMoSim, we show throughput, goodput, and loss rates for reliable and unreliable networks...