Nanomechanical characterization by double-pass force-distance mapping

International Nuclear Information System (INIS)

Dagdas, Yavuz S; Tekinay, Ayse B; Guler, Mustafa O; Dana, Aykutlu; Necip Aslan, M

2011-01-01

We demonstrate high speed force-distance mapping using a double-pass scheme. The topography is measured in tapping mode in the first pass and this information is used in the second pass to move the tip over the sample. In the second pass, the cantilever dither signal is turned off and the sample is vibrated. Rapid (few kHz frequency) force-distance curves can be recorded with small peak interaction force, and can be processed into an image. Such a double-pass measurement eliminates the need for feedback during force-distance measurements. The method is demonstrated on self-assembled peptidic nanofibers.

Wireless Sensor Networks for Long Distance Pipeline Monitoring

OpenAIRE

Augustine C. Azubogu; Victor E. Idigo; Schola U. Nnebe; Obinna S. Oguejiofor; Simon E.

2013-01-01

The main goal of this seminal paper is to introduce the application of Wireless Sensor Networks (WSN) in long distance infrastructure monitoring (in particular in pipeline infrastructure monitoring) – one of the on-going research projects by the Wireless Communication Research Group at the department of Electronic and Computer Engineering, Nnamdi Azikiwe University, Awka. The current sensor network architectures for monitoring long distance pipeline infrastructures are pr...

Average geodesic distance of skeleton networks of Sierpinski tetrahedron

Science.gov (United States)

Yang, Jinjin; Wang, Songjing; Xi, Lifeng; Ye, Yongchao

2018-04-01

The average distance is concerned in the research of complex networks and is related to Wiener sum which is a topological invariant in chemical graph theory. In this paper, we study the skeleton networks of the Sierpinski tetrahedron, an important self-similar fractal, and obtain their asymptotic formula for average distances. To provide the formula, we develop some technique named finite patterns of integral of geodesic distance on self-similar measure for the Sierpinski tetrahedron.

Visualizing Article Similarities via Sparsified Article Network and Map Projection for Systematic Reviews.

Science.gov (United States)

Ji, Xiaonan; Machiraju, Raghu; Ritter, Alan; Yen, Po-Yin

2017-01-01

Systematic Reviews (SRs) of biomedical literature summarize evidence from high-quality studies to inform clinical decisions, but are time and labor intensive due to the large number of article collections. Article similarities established from textual features have been shown to assist in the identification of relevant articles, thus facilitating the article screening process efficiently. In this study, we visualized article similarities to extend its utilization in practical settings for SR researchers, aiming to promote human comprehension of article distributions and hidden patterns. To prompt an effective visualization in an interpretable, intuitive, and scalable way, we implemented a graph-based network visualization with three network sparsification approaches and a distance-based map projection via dimensionality reduction. We evaluated and compared three network sparsification approaches and the visualization types (article network vs. article map). We demonstrated the effectiveness in revealing article distribution and exhibiting clustering patterns of relevant articles with practical meanings for SRs.

Potential of Social Networking Sites for Distance Education Student Engagement

Science.gov (United States)

Lester, Jaime; Perini, Michael

2010-01-01

This chapter explores the potential of social networking sites for increasing student engagement for distance education learners. The authors present a modified student engagement model with a focus on the integration of technology, specifically social networking sites for community college distance education learners. The chapter concludes with…

Reconstruction of certain phylogenetic networks from their tree-average distances.

Science.gov (United States)

Willson, Stephen J

2013-10-01

Trees are commonly utilized to describe the evolutionary history of a collection of biological species, in which case the trees are called phylogenetic trees. Often these are reconstructed from data by making use of distances between extant species corresponding to the leaves of the tree. Because of increased recognition of the possibility of hybridization events, more attention is being given to the use of phylogenetic networks that are not necessarily trees. This paper describes the reconstruction of certain such networks from the tree-average distances between the leaves. For a certain class of phylogenetic networks, a polynomial-time method is presented to reconstruct the network from the tree-average distances. The method is proved to work if there is a single reticulation cycle.

Concept mapping and network analysis: an analytic approach to measure ties among constructs.

Science.gov (United States)

Goldman, Alyssa W; Kane, Mary

2014-12-01

Group concept mapping is a mixed-methods approach that helps a group visually represent its ideas on a topic of interest through a series of related maps. The maps and additional graphics are useful for planning, evaluation and theory development. Group concept maps are typically described, interpreted and utilized through points, clusters and distances, and the implications of these features in understanding how constructs relate to one another. This paper focuses on the application of network analysis to group concept mapping to quantify the strength and directionality of relationships among clusters. The authors outline the steps of this analysis, and illustrate its practical use through an organizational strategic planning example. Additional benefits of this analysis to evaluation projects are also discussed, supporting the overall utility of this supplemental technique to the standard concept mapping methodology. Copyright © 2014 Elsevier Ltd. All rights reserved.

Mapping and characterization of LCA networks

DEFF Research Database (Denmark)

Bjørn, Anders; Owsianiak, Mikolaj; Laurent, Alexis

2013-01-01

Purpose: The aims of this study were to provide an up-todate overview of global, regional and local networks supporting life cycle thinking and to characterize them according to their structure and activities. Methods: Following a tentative life cycle assessment (LCA) network definition, a mapping......: The provided list of LCA networks is currently the most comprehensive, publicly available mapping. We believe that the results of this mapping can serve as a basis for deciding where priorities should be set to increase the dissemination and development of LCA worldwide. In this aim, we also advocate...... was performed based on (1) a literature search, (2) a web search and (3) an inquiry to stakeholders distributed via the two largest LCA fora. Networks were characterized based on responses from a survey. Results and discussion: We identified 100 networks, of which 29 fulfilled all six criteria composing our...

A Game Map Complexity Measure Based on Hamming Distance

Science.gov (United States)

Li, Yan; Su, Pan; Li, Wenliang

With the booming of PC game market, Game AI has attracted more and more researches. The interesting and difficulty of a game are relative with the map used in game scenarios. Besides, the path-finding efficiency in a game is also impacted by the complexity of the used map. In this paper, a novel complexity measure based on Hamming distance, called the Hamming complexity, is introduced. This measure is able to estimate the complexity of binary tileworld. We experimentally demonstrated that Hamming complexity is highly relative with the efficiency of A* algorithm, and therefore it is a useful reference to the designer when developing a game map.

CNNcon: improved protein contact maps prediction using cascaded neural networks.

Directory of Open Access Journals (Sweden)

Wang Ding

Full Text Available BACKGROUNDS: Despite continuing progress in X-ray crystallography and high-field NMR spectroscopy for determination of three-dimensional protein structures, the number of unsolved and newly discovered sequences grows much faster than that of determined structures. Protein modeling methods can possibly bridge this huge sequence-structure gap with the development of computational science. A grand challenging problem is to predict three-dimensional protein structure from its primary structure (residues sequence alone. However, predicting residue contact maps is a crucial and promising intermediate step towards final three-dimensional structure prediction. Better predictions of local and non-local contacts between residues can transform protein sequence alignment to structure alignment, which can finally improve template based three-dimensional protein structure predictors greatly. METHODS: CNNcon, an improved multiple neural networks based contact map predictor using six sub-networks and one final cascade-network, was developed in this paper. Both the sub-networks and the final cascade-network were trained and tested with their corresponding data sets. While for testing, the target protein was first coded and then input to its corresponding sub-networks for prediction. After that, the intermediate results were input to the cascade-network to finish the final prediction. RESULTS: The CNNcon can accurately predict 58.86% in average of contacts at a distance cutoff of 8 Å for proteins with lengths ranging from 51 to 450. The comparison results show that the present method performs better than the compared state-of-the-art predictors. Particularly, the prediction accuracy keeps steady with the increase of protein sequence length. It indicates that the CNNcon overcomes the thin density problem, with which other current predictors have trouble. This advantage makes the method valuable to the prediction of long length proteins. As a result, the effective

PLANNING THE NETWORKING OF ODL INSTITUTIONS FOR ESTABLISHING INTEGRATED DISTANCE EDUCATION SYSTEM IN INDIA

Directory of Open Access Journals (Sweden)

Pankaj KHANNA

2011-07-01

Full Text Available It is proposed to establish an Integrated Distance Education System in India by designing modern technology based information communication network, connecting all its ODL (Open and Distance Learning institutions to the headquarters of the ODL system in India. The principle roles to be performed by such a system have been discussed; according to which it would enable, educate and empower every member of the academic community including distance learners so as to provide them quality distance education. The connectivity between the ODL institutions would be achieved through the use of VPN (Virtual Private Network involving wireless networking and optical networking. Various benefits of providing VPN connectivity to the ODL institutions in India, such as cost effectiveness, security, and shared applications/services have also been discussed. Thus, the networking of all the ODL institutions in India would provide a national framework so as to build an excellent Integrated Distance Education System necessary for providing equity and quality distance education at national level.

VISUAL UAV TRAJECTORY PLAN SYSTEM BASED ON NETWORK MAP

Directory of Open Access Journals (Sweden)

X. L. Li

2012-07-01

Full Text Available The base map of the current software UP-30 using in trajectory plan for Unmanned Aircraft Vehicle is vector diagram. UP-30 draws navigation points manually. But in the field of operation process, the efficiency and the quality of work is influenced because of insufficient information, screen reflection, calculate inconveniently and other factors. If we do this work in indoor, the effect of external factors on the results would be eliminated, the network earth users can browse the free world high definition satellite images through downloading a client software, and can export the high resolution image by standard file format. This brings unprecedented convenient of trajectory plan. But the images must be disposed by coordinate transformation, geometric correction. In addition, according to the requirement of mapping scale ,camera parameters and overlap degree we can calculate exposure hole interval and trajectory distance between the adjacent trajectory automatically . This will improve the degree of automation of data collection. Software will judge the position of next point according to the intersection of the trajectory and the survey area and ensure the position of point according to trajectory distance. We can undertake the points artificially. So the trajectory plan is automatic and flexible. Considering safety, the date can be used in flying after simulating flight. Finally we can export all of the date using a key

Visual Uav Trajectory Plan System Based on Network Map

Science.gov (United States)

Li, X. L.; Lin, Z. J.; Su, G. Z.; Wu, B. Y.

2012-07-01

The base map of the current software UP-30 using in trajectory plan for Unmanned Aircraft Vehicle is vector diagram. UP-30 draws navigation points manually. But in the field of operation process, the efficiency and the quality of work is influenced because of insufficient information, screen reflection, calculate inconveniently and other factors. If we do this work in indoor, the effect of external factors on the results would be eliminated, the network earth users can browse the free world high definition satellite images through downloading a client software, and can export the high resolution image by standard file format. This brings unprecedented convenient of trajectory plan. But the images must be disposed by coordinate transformation, geometric correction. In addition, according to the requirement of mapping scale ,camera parameters and overlap degree we can calculate exposure hole interval and trajectory distance between the adjacent trajectory automatically . This will improve the degree of automation of data collection. Software will judge the position of next point according to the intersection of the trajectory and the survey area and ensure the position of point according to trajectory distance. We can undertake the points artificially. So the trajectory plan is automatic and flexible. Considering safety, the date can be used in flying after simulating flight. Finally we can export all of the date using a key

A Mapping Between Structural and Functional Brain Networks.

Science.gov (United States)

Meier, Jil; Tewarie, Prejaas; Hillebrand, Arjan; Douw, Linda; van Dijk, Bob W; Stufflebeam, Steven M; Van Mieghem, Piet

2016-05-01

The relationship between structural and functional brain networks is still highly debated. Most previous studies have used a single functional imaging modality to analyze this relationship. In this work, we use multimodal data, from functional MRI, magnetoencephalography, and diffusion tensor imaging, and assume that there exists a mapping between the connectivity matrices of the resting-state functional and structural networks. We investigate this mapping employing group averaged as well as individual data. We indeed find a significantly high goodness of fit level for this structure-function mapping. Our analysis suggests that a functional connection is shaped by all walks up to the diameter in the structural network in both modality cases. When analyzing the inverse mapping, from function to structure, longer walks in the functional network also seem to possess minor influence on the structural connection strengths. Even though similar overall properties for the structure-function mapping are found for different functional modalities, our results indicate that the structure-function relationship is modality dependent.

Tree-average distances on certain phylogenetic networks have their weights uniquely determined.

Science.gov (United States)

Willson, Stephen J

2012-01-01

A phylogenetic network N has vertices corresponding to species and arcs corresponding to direct genetic inheritance from the species at the tail to the species at the head. Measurements of DNA are often made on species in the leaf set, and one seeks to infer properties of the network, possibly including the graph itself. In the case of phylogenetic trees, distances between extant species are frequently used to infer the phylogenetic trees by methods such as neighbor-joining. This paper proposes a tree-average distance for networks more general than trees. The notion requires a weight on each arc measuring the genetic change along the arc. For each displayed tree the distance between two leaves is the sum of the weights along the path joining them. At a hybrid vertex, each character is inherited from one of its parents. We will assume that for each hybrid there is a probability that the inheritance of a character is from a specified parent. Assume that the inheritance events at different hybrids are independent. Then for each displayed tree there will be a probability that the inheritance of a given character follows the tree; this probability may be interpreted as the probability of the tree. The tree-average distance between the leaves is defined to be the expected value of their distance in the displayed trees. For a class of rooted networks that includes rooted trees, it is shown that the weights and the probabilities at each hybrid vertex can be calculated given the network and the tree-average distances between the leaves. Hence these weights and probabilities are uniquely determined. The hypotheses on the networks include that hybrid vertices have indegree exactly 2 and that vertices that are not leaves have a tree-child.

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.

Measuring distance through dense weighted networks: The case of hospital-associated pathogens.

Directory of Open Access Journals (Sweden)

Tjibbe Donker

2017-08-01

Full Text Available Hospital networks, formed by patients visiting multiple hospitals, affect the spread of hospital-associated infections, resulting in differences in risks for hospitals depending on their network position. These networks are increasingly used to inform strategies to prevent and control the spread of hospital-associated pathogens. However, many studies only consider patients that are received directly from the initial hospital, without considering the effect of indirect trajectories through the network. We determine the optimal way to measure the distance between hospitals within the network, by reconstructing the English hospital network based on shared patients in 2014-2015, and simulating the spread of a hospital-associated pathogen between hospitals, taking into consideration that each intermediate hospital conveys a delay in the further spread of the pathogen. While the risk of transferring a hospital-associated pathogen between directly neighbouring hospitals is a direct reflection of the number of shared patients, the distance between two hospitals far-away in the network is determined largely by the number of intermediate hospitals in the network. Because the network is dense, most long distance transmission chains in fact involve only few intermediate steps, spreading along the many weak links. The dense connectivity of hospital networks, together with a strong regional structure, causes hospital-associated pathogens to spread from the initial outbreak in a two-step process: first, the directly surrounding hospitals are affected through the strong connections, second all other hospitals receive introductions through the multitude of weaker links. Although the strong connections matter for local spread, weak links in the network can offer ideal routes for hospital-associated pathogens to travel further faster. This hold important implications for infection prevention and control efforts: if a local outbreak is not controlled in time

US long distance fiber optic networks: Technology, evolution and advanced concepts. Volume 2: Fiber optic technology and long distance networks

Science.gov (United States)

1986-10-01

The study projects until 2000 the evolution of long distance fiber optic networks in the U.S. Volume 1 is the Executive Summary. Volume 2 focuses on fiber optic components and systems that are directly related to the operation of long-haul networks. Optimistic, pessimistic and most likely scenarios of technology development are presented. The activities of national and regional companies implementing fiber long haul networks are also highlighted, along with an analysis of the market and regulatory forces affecting network evolution. Volume 3 presents advanced fiber optic network concept definitions. Inter-LATA traffic is quantified and forms the basis for the construction of 11-, 15-, 17-, and 23-node networks. Using the technology projections from Volume 2, a financial model identifies cost drivers and determines circuit mile costs between any two LATAs. A comparison of fiber optics with alternative transmission concludes the report.

Long-distance pulse propagation on high-frequency dissipative nonlinear transmission lines/resonant tunneling diode line cascaded maps

International Nuclear Information System (INIS)

Klofai, Yerima; Essimbi, B Z; Jaeger, D

2011-01-01

Pulse propagation on high-frequency dissipative nonlinear transmission lines (NLTLs)/resonant tunneling diode line cascaded maps is investigated for long-distance propagation of short pulses. Applying perturbative analysis, we show that the dynamics of each line is reduced to an expanded Korteweg-de Vries-Burgers equation. Moreover, it is found by computer experiments that the soliton developed in NLTLs experiences an exponential amplitude decay on the one hand and an exponential amplitude growth on the other. As a result, the behavior of a pulse in special electrical networks made of concatenated pieces of lines is closely similar to the transmission of information in optical/electrical communication systems.

Long-distance pulse propagation on high-frequency dissipative nonlinear transmission lines/resonant tunneling diode line cascaded maps

Energy Technology Data Exchange (ETDEWEB)

Klofai, Yerima [Department of Physics, Higher Teacher Training College, University of Maroua, PO Box 46 Maroua (Cameroon); Essimbi, B Z [Department of Physics, Faculty of Science, University of Yaounde 1, PO Box 812 Yaounde (Cameroon); Jaeger, D, E-mail: bessimb@yahoo.fr [ZHO, Optoelectronik, Universitaet Duisburg-Essen, D-47048 Duisburg (Germany)

2011-10-15

Pulse propagation on high-frequency dissipative nonlinear transmission lines (NLTLs)/resonant tunneling diode line cascaded maps is investigated for long-distance propagation of short pulses. Applying perturbative analysis, we show that the dynamics of each line is reduced to an expanded Korteweg-de Vries-Burgers equation. Moreover, it is found by computer experiments that the soliton developed in NLTLs experiences an exponential amplitude decay on the one hand and an exponential amplitude growth on the other. As a result, the behavior of a pulse in special electrical networks made of concatenated pieces of lines is closely similar to the transmission of information in optical/electrical communication systems.

A feed-forward Hopfield neural network algorithm (FHNNA) with a colour satellite image for water quality mapping

Science.gov (United States)

Asal Kzar, Ahmed; Mat Jafri, M. Z.; Hwee San, Lim; Al-Zuky, Ali A.; Mutter, Kussay N.; Hassan Al-Saleh, Anwar

2016-06-01

There are many techniques that have been given for water quality problem, but the remote sensing techniques have proven their success, especially when the artificial neural networks are used as mathematical models with these techniques. Hopfield neural network is one type of artificial neural networks which is common, fast, simple, and efficient, but it when it deals with images that have more than two colours such as remote sensing images. This work has attempted to solve this problem via modifying the network that deals with colour remote sensing images for water quality mapping. A Feed-forward Hopfield Neural Network Algorithm (FHNNA) was modified and used with a satellite colour image from type of Thailand earth observation system (THEOS) for TSS mapping in the Penang strait, Malaysia, through the classification of TSS concentrations. The new algorithm is based essentially on three modifications: using HNN as feed-forward network, considering the weights of bitplanes, and non-self-architecture or zero diagonal of weight matrix, in addition, it depends on a validation data. The achieved map was colour-coded for visual interpretation. The efficiency of the new algorithm has found out by the higher correlation coefficient (R=0.979) and the lower root mean square error (RMSE=4.301) between the validation data that were divided into two groups. One used for the algorithm and the other used for validating the results. The comparison was with the minimum distance classifier. Therefore, TSS mapping of polluted water in Penang strait, Malaysia, can be performed using FHNNA with remote sensing technique (THEOS). It is a new and useful application of HNN, so it is a new model with remote sensing techniques for water quality mapping which is considered important environmental problem.

Mapping social networks in software process improvement

DEFF Research Database (Denmark)

Tjørnehøj, Gitte; Nielsen, Peter Axel

2005-01-01

Software process improvement in small, agile organizations is often problematic. Model-based approaches seem to overlook problems. We have been seeking an alternative approach to overcome this through action research. Here we report on a piece of action research from which we developed an approach...... to map social networks and suggest how it can be used in software process improvement. We applied the mapping approach in a small software company to support the realization of new ways of improving software processes. The mapping approach was found useful in improving social networks, and thus furthers...... software process improvement....

Distance learning, problem based learning and dynamic knowledge networks.

Science.gov (United States)

Giani, U; Martone, P

1998-06-01

This paper is an attempt to develop a distance learning model grounded upon a strict integration of problem based learning (PBL), dynamic knowledge networks (DKN) and web tools, such as hypermedia documents, synchronous and asynchronous communication facilities, etc. The main objective is to develop a theory of distance learning based upon the idea that learning is a highly dynamic cognitive process aimed at connecting different concepts in a network of mutually supporting concepts. Moreover, this process is supposed to be the result of a social interaction that has to be facilitated by the web. The model was tested by creating a virtual classroom of medical and nursing students and activating a learning session on the concept of knowledge representation in health sciences.

Limitations to mapping habitat-use areas in changing landscapes using the Mahalanobis distance statistic

Science.gov (United States)

Knick, Steven T.; Rotenberry, J.T.

1998-01-01

We tested the potential of a GIS mapping technique, using a resource selection model developed for black-tailed jackrabbits (Lepus californicus) and based on the Mahalanobis distance statistic, to track changes in shrubsteppe habitats in southwestern Idaho. If successful, the technique could be used to predict animal use areas, or those undergoing change, in different regions from the same selection function and variables without additional sampling. We determined the multivariate mean vector of 7 GIS variables that described habitats used by jackrabbits. We then ranked the similarity of all cells in the GIS coverage from their Mahalanobis distance to the mean habitat vector. The resulting map accurately depicted areas where we sighted jackrabbits on verification surveys. We then simulated an increase in shrublands (which are important habitats). Contrary to expectation, the new configurations were classified as lower similarity relative to the original mean habitat vector. Because the selection function is based on a unimodal mean, any deviation, even if biologically positive, creates larger Malanobis distances and lower similarity values. We recommend the Mahalanobis distance technique for mapping animal use areas when animals are distributed optimally, the landscape is well-sampled to determine the mean habitat vector, and distributions of the habitat variables does not change.

Heterogeneous Network Convergence with Artificial Mapping for Cognitive Radio Networks

Directory of Open Access Journals (Sweden)

Hang QIN

2013-04-01

Full Text Available The artificial mapping scheme is proposed in this paper for adaptive network collaboration of cognitive radio networks. The superiority of the DHT-based overlay for its link state aggregation property, which establishes global convergence for link state aggregation message among a scalable number of nodes, is considered in the analysis. In addition, the fuzzy logic inference can better handle uncertainty, fuzziness, and incomplete information in node convergence report, which is developed as a novel approach to aggregate wireless node control with affordable message overload. The Artificial Mapping Tree (AMT for the new convergence scheme is verified by the simulation and experimental results. The moderately increased network throughput for convergence validation is demonstrated with the proactive spectrum coordination.

A program to compute the soft Robinson-Foulds distance between phylogenetic networks.

Science.gov (United States)

Lu, Bingxin; Zhang, Louxin; Leong, Hon Wai

2017-03-14

Over the past two decades, phylogenetic networks have been studied to model reticulate evolutionary events. The relationships among phylogenetic networks, phylogenetic trees and clusters serve as the basis for reconstruction and comparison of phylogenetic networks. To understand these relationships, two problems are raised: the tree containment problem, which asks whether a phylogenetic tree is displayed in a phylogenetic network, and the cluster containment problem, which asks whether a cluster is represented at a node in a phylogenetic network. Both the problems are NP-complete. A fast exponential-time algorithm for the cluster containment problem on arbitrary networks is developed and implemented in C. The resulting program is further extended into a computer program for fast computation of the Soft Robinson-Foulds distance between phylogenetic networks. Two computer programs are developed for facilitating reconstruction and validation of phylogenetic network models in evolutionary and comparative genomics. Our simulation tests indicated that they are fast enough for use in practice. Additionally, the distribution of the Soft Robinson-Foulds distance between phylogenetic networks is demonstrated to be unlikely normal by our simulation data.

Mutated Genes in Schizophrenia Map to Brain Networks

Science.gov (United States)

... Matters NIH Research Matters August 12, 2013 Mutated Genes in Schizophrenia Map to Brain Networks Schizophrenia networks ... have a high number of spontaneous mutations in genes that form a network in the front region ...

Protein distance constraints predicted by neural networks and probability density functions

DEFF Research Database (Denmark)

Lund, Ole; Frimand, Kenneth; Gorodkin, Jan

1997-01-01

We predict interatomic C-α distances by two independent data driven methods. The first method uses statistically derived probability distributions of the pairwise distance between two amino acids, whilst the latter method consists of a neural network prediction approach equipped with windows taki...... method based on the predicted distances is presented. A homepage with software, predictions and data related to this paper is available at http://www.cbs.dtu.dk/services/CPHmodels/...

Study of Tools for Network Discovery and Network Mapping

Science.gov (United States)

2003-11-01

connected to the switch. iv. Accessibility of historical data and event data In general, network discovery tools keep a history of the collected...has the following software dependencies: - Java Virtual machine 76 - Perl modules - RRD Tool - TomCat - PostgreSQL STRENGTHS AND...systems - provide a simple view of the current network status - generate alarms on status change - generate history of status change VISUAL MAP

An integrated approach of analytical network process and fuzzy based spatial decision making systems applied to landslide risk mapping

Science.gov (United States)

Abedi Gheshlaghi, Hassan; Feizizadeh, Bakhtiar

2017-09-01

Landslides in mountainous areas render major damages to residential areas, roads, and farmlands. Hence, one of the basic measures to reduce the possible damage is by identifying landslide-prone areas through landslide mapping by different models and methods. The purpose of conducting this study is to evaluate the efficacy of a combination of two models of the analytical network process (ANP) and fuzzy logic in landslide risk mapping in the Azarshahr Chay basin in northwest Iran. After field investigations and a review of research literature, factors affecting the occurrence of landslides including slope, slope aspect, altitude, lithology, land use, vegetation density, rainfall, distance to fault, distance to roads, distance to rivers, along with a map of the distribution of occurred landslides were prepared in GIS environment. Then, fuzzy logic was used for weighting sub-criteria, and the ANP was applied to weight the criteria. Next, they were integrated based on GIS spatial analysis methods and the landslide risk map was produced. Evaluating the results of this study by using receiver operating characteristic curves shows that the hybrid model designed by areas under the curve 0.815 has good accuracy. Also, according to the prepared map, a total of 23.22% of the area, amounting to 105.38 km2, is in the high and very high-risk class. Results of this research are great of importance for regional planning tasks and the landslide prediction map can be used for spatial planning tasks and for the mitigation of future hazards in the study area.

Google matrix and Ulam networks of intermittency maps.

Science.gov (United States)

Ermann, L; Shepelyansky, D L

2010-03-01

We study the properties of the Google matrix of an Ulam network generated by intermittency maps. This network is created by the Ulam method which gives a matrix approximant for the Perron-Frobenius operator of dynamical map. The spectral properties of eigenvalues and eigenvectors of this matrix are analyzed. We show that the PageRank of the system is characterized by a power law decay with the exponent beta dependent on map parameters and the Google damping factor alpha . Under certain conditions the PageRank is completely delocalized so that the Google search in such a situation becomes inefficient.

Long-distance quantum communication over noisy networks without long-time quantum memory

Science.gov (United States)

Mazurek, Paweł; Grudka, Andrzej; Horodecki, Michał; Horodecki, Paweł; Łodyga, Justyna; Pankowski, Łukasz; PrzysieŻna, Anna

2014-12-01

The problem of sharing entanglement over large distances is crucial for implementations of quantum cryptography. A possible scheme for long-distance entanglement sharing and quantum communication exploits networks whose nodes share Einstein-Podolsky-Rosen (EPR) pairs. In Perseguers et al. [Phys. Rev. A 78, 062324 (2008), 10.1103/PhysRevA.78.062324] the authors put forward an important isomorphism between storing quantum information in a dimension D and transmission of quantum information in a D +1 -dimensional network. We show that it is possible to obtain long-distance entanglement in a noisy two-dimensional (2D) network, even when taking into account that encoding and decoding of a state is exposed to an error. For 3D networks we propose a simple encoding and decoding scheme based solely on syndrome measurements on 2D Kitaev topological quantum memory. Our procedure constitutes an alternative scheme of state injection that can be used for universal quantum computation on 2D Kitaev code. It is shown that the encoding scheme is equivalent to teleporting the state, from a specific node into a whole two-dimensional network, through some virtual EPR pair existing within the rest of network qubits. We present an analytic lower bound on fidelity of the encoding and decoding procedure, using as our main tool a modified metric on space-time lattice, deviating from a taxicab metric at the first and the last time slices.

Network Partitioning Domain Knowledge Multiobjective Application Mapping for Large-Scale Network-on-Chip

Directory of Open Access Journals (Sweden)

Yin Zhen Tei

2014-01-01

Full Text Available This paper proposes a multiobjective application mapping technique targeted for large-scale network-on-chip (NoC. As the number of intellectual property (IP cores in multiprocessor system-on-chip (MPSoC increases, NoC application mapping to find optimum core-to-topology mapping becomes more challenging. Besides, the conflicting cost and performance trade-off makes multiobjective application mapping techniques even more complex. This paper proposes an application mapping technique that incorporates domain knowledge into genetic algorithm (GA. The initial population of GA is initialized with network partitioning (NP while the crossover operator is guided with knowledge on communication demands. NP reduces the large-scale application mapping complexity and provides GA with a potential mapping search space. The proposed genetic operator is compared with state-of-the-art genetic operators in terms of solution quality. In this work, multiobjective optimization of energy and thermal-balance is considered. Through simulation, knowledge-based initial mapping shows significant improvement in Pareto front compared to random initial mapping that is widely used. The proposed knowledge-based crossover also shows better Pareto front compared to state-of-the-art knowledge-based crossover.

An Algorithm Based on the Self-Organized Maps for the Classification of Facial Features

Directory of Open Access Journals (Sweden)

Gheorghe Gîlcă

2015-12-01

Full Text Available This paper deals with an algorithm based on Self Organized Maps networks which classifies facial features. The proposed algorithm can categorize the facial features defined by the input variables: eyebrow, mouth, eyelids into a map of their grouping. The groups map is based on calculating the distance between each input vector and each output neuron layer , the neuron with the minimum distance being declared winner neuron. The network structure consists of two levels: the first level contains three input vectors, each having forty-one values, while the second level contains the SOM competitive network which consists of 100 neurons. The proposed system can classify facial features quickly and easily using the proposed algorithm based on SOMs.

Information networks in the stock market based on the distance of the multi-attribute dimensions between listed companies

Science.gov (United States)

Liu, Qian; Li, Huajiao; Liu, Xueyong; Jiang, Meihui

2018-04-01

In the stock market, there are widespread information connections between economic agents. Listed companies can obtain mutual information about investment decisions from common shareholders, and the extent of sharing information often determines the relationships between listed companies. Because different shareholder compositions and investment shares lead to different formations of the company's governance mechanisms, we map the investment relationships between shareholders to the multi-attribute dimensional spaces of the listed companies (each shareholder investment in a company is a company dimension). Then, we construct the listed company's information network based on co-shareholder relationships. The weights for the edges in the information network are measured with the Euclidean distance between the listed companies in the multi-attribute dimension space. We define two indices to analyze the information network's features. We conduct an empirical study that analyzes Chinese listed companies' information networks. The results from the analysis show that with the diversification and decentralization of shareholder investments, almost all Chinese listed companies exchanged information through common shareholder relationships, and there is a gradual reduction in information sharing capacity between listed companies that have common shareholders. This network analysis has benefits for risk management and portfolio investments.

Structure and Discourse: Mapping the Networked Public Sphere in the Arab Region

OpenAIRE

Faris, Robert M; Kelly, John; Noman, Helmi; Othman, Dalia

2016-01-01

In this study, we employ social network mapping techniques to analyze the shape and structure of the networked public sphere in the Arab region. The analysis is based on four distinct views of digitally connected communities: a regional map of the blogosphere and maps of Twitter networks in three countries: Egypt, Tunisia, and Bahrain. This media ecology mapping across these different platforms and regions offers a detailed view of social, cultural, religious, and political expression through...

Distinguishability notion based on Wootters statistical distance: Application to discrete maps

Science.gov (United States)

Gomez, Ignacio S.; Portesi, M.; Lamberti, P. W.

2017-08-01

We study the distinguishability notion given by Wootters for states represented by probability density functions. This presents the particularity that it can also be used for defining a statistical distance in chaotic unidimensional maps. Based on that definition, we provide a metric d ¯ for an arbitrary discrete map. Moreover, from d ¯ , we associate a metric space with each invariant density of a given map, which results to be the set of all distinguished points when the number of iterations of the map tends to infinity. Also, we give a characterization of the wandering set of a map in terms of the metric d ¯ , which allows us to identify the dissipative regions in the phase space. We illustrate the results in the case of the logistic and the circle maps numerically and analytically, and we obtain d ¯ and the wandering set for some characteristic values of their parameters. Finally, an extension of the metric space associated for arbitrary probability distributions (not necessarily invariant densities) is given along with some consequences. The statistical properties of distributions given by histograms are characterized in terms of the cardinal of the associated metric space. For two conjugate variables, the uncertainty principle is expressed in terms of the diameters of the associated metric space with those variables.

NetMap - Creating a Map of Application Layer QoS Metrics of Mobile Networks Using Crowd Sourcing

DEFF Research Database (Denmark)

Mikkelsen, Lars Møller; Thomsen, Steffen Riber; Pedersen, Michael Sølvkjær

2014-01-01

Based on the continuous increase in network traffic on mobile networks, the large increase in smart devices, and the ever ongoing development of Internet enabled services, we argue for the need of a network performance map. In this paper NetMap is presented, which is a measurement system based...... on crowd sourcing, that utilizes end user smart devices in automatically measuring and gathering network performance metrics on mobile networks. Metrics measured include throughput, round trip times, connectivity, and signal strength, and are accompanied by a wide range of context information about...

Analysis of Double Meridian Distance for a Closed Traverse Area towards Developing a Contour Map and Land Title

Directory of Open Access Journals (Sweden)

T. U. Ganiron Jr

2014-07-01

Full Text Available This research aimed to analyze double meridian distance for a closed traverse area in developing a land title for a propose gymnasium in Qassim University. Theodolite, leveling rod and steel tape plays an important role in measuring elevations, bearings and distances of the boundaries of a lot. Contour map is necessary to determine the traces of level surfaces of successive elevation. This will enable to identify the type of contour map and type of contour lines necessary for this project. Corel draw software is used to draw contour map and guide to interpret the significance of the variables. It is essential to check the error of closure for interior angles and for both latitude and departure before applying the Double Meridian Distance (DMD method to obtain the total area of the lot. Technical descriptions of the land such as distance, bearing, boundaries and area are necessary to visualize the shape & exact location of the land. Developing a land title will be obtained using the technical descriptions of the lot in preparation for the type of gymnasium necessary for Qassim University.

DIMACS Workshop on Interconnection Networks and Mapping, and Scheduling Parallel Computations

CERN Document Server

Rosenberg, Arnold L; Sotteau, Dominique; NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science; Interconnection networks and mapping and scheduling parallel computations

1995-01-01

The interconnection network is one of the most basic components of a massively parallel computer system. Such systems consist of hundreds or thousands of processors interconnected to work cooperatively on computations. One of the central problems in parallel computing is the task of mapping a collection of processes onto the processors and routing network of a parallel machine. Once this mapping is done, it is critical to schedule computations within and communication among processor from universities and laboratories, as well as practitioners involved in the design, implementation, and application of massively parallel systems. Focusing on interconnection networks of parallel architectures of today and of the near future , the book includes topics such as network topologies,network properties, message routing, network embeddings, network emulation, mappings, and efficient scheduling. inputs for a process are available where and when the process is scheduled to be computed. This book contains the refereed pro...

Mapping stochastic processes onto complex networks

International Nuclear Information System (INIS)

Shirazi, A H; Reza Jafari, G; Davoudi, J; Peinke, J; Reza Rahimi Tabar, M; Sahimi, Muhammad

2009-01-01

We introduce a method by which stochastic processes are mapped onto complex networks. As examples, we construct the networks for such time series as those for free-jet and low-temperature helium turbulence, the German stock market index (the DAX), and white noise. The networks are further studied by contrasting their geometrical properties, such as the mean length, diameter, clustering, and average number of connections per node. By comparing the network properties of the original time series investigated with those for the shuffled and surrogate series, we are able to quantify the effect of the long-range correlations and the fatness of the probability distribution functions of the series on the networks constructed. Most importantly, we demonstrate that the time series can be reconstructed with high precision by means of a simple random walk on their corresponding networks

Networking and distance learning for teachers: A classification of possibilities

NARCIS (Netherlands)

Collis, Betty

1995-01-01

Computer based communication technologies, or what could be more conveniently called networking, are bringing new possibilities into teacher education in many different ways. As with distance education more generally they can facilitate flexibility in time and place of learning, but the range of

Effects of Coupling Distance on Synchronization and Coherence in Chaotic Neural Networks

International Nuclear Information System (INIS)

Wang Maosheng

2009-01-01

Effects of coupling distance on synchronization and coherence of chaotic neurons in complex networks are numerically investigated. We find that it is not beneficial to neurons synchronization if confining the coupling distance of random edges to a limit d max , but help to improve their coherence. Moreover, there is an optimal value of d max at which the coherence is maximum.

A global interaction network maps a wiring diagram of cellular function

Science.gov (United States)

Costanzo, Michael; VanderSluis, Benjamin; Koch, Elizabeth N.; Baryshnikova, Anastasia; Pons, Carles; Tan, Guihong; Wang, Wen; Usaj, Matej; Hanchard, Julia; Lee, Susan D.; Pelechano, Vicent; Styles, Erin B.; Billmann, Maximilian; van Leeuwen, Jolanda; van Dyk, Nydia; Lin, Zhen-Yuan; Kuzmin, Elena; Nelson, Justin; Piotrowski, Jeff S.; Srikumar, Tharan; Bahr, Sondra; Chen, Yiqun; Deshpande, Raamesh; Kurat, Christoph F.; Li, Sheena C.; Li, Zhijian; Usaj, Mojca Mattiazzi; Okada, Hiroki; Pascoe, Natasha; Luis, Bryan-Joseph San; Sharifpoor, Sara; Shuteriqi, Emira; Simpkins, Scott W.; Snider, Jamie; Suresh, Harsha Garadi; Tan, Yizhao; Zhu, Hongwei; Malod-Dognin, Noel; Janjic, Vuk; Przulj, Natasa; Troyanskaya, Olga G.; Stagljar, Igor; Xia, Tian; Ohya, Yoshikazu; Gingras, Anne-Claude; Raught, Brian; Boutros, Michael; Steinmetz, Lars M.; Moore, Claire L.; Rosebrock, Adam P.; Caudy, Amy A.; Myers, Chad L.; Andrews, Brenda; Boone, Charles

2017-01-01

We generated a global genetic interaction network for Saccharomyces cerevisiae, constructing over 23 million double mutants, identifying ~550,000 negative and ~350,000 positive genetic interactions. This comprehensive network maps genetic interactions for essential gene pairs, highlighting essential genes as densely connected hubs. Genetic interaction profiles enabled assembly of a hierarchical model of cell function, including modules corresponding to protein complexes and pathways, biological processes, and cellular compartments. Negative interactions connected functionally related genes, mapped core bioprocesses, and identified pleiotropic genes, whereas positive interactions often mapped general regulatory connections among gene pairs, rather than shared functionality. The global network illustrates how coherent sets of genetic interactions connect protein complex and pathway modules to map a functional wiring diagram of the cell. PMID:27708008

Learners’ Views Regarding the Use of Social Networking Sites in Distance Learning

Directory of Open Access Journals (Sweden)

Büşra Özmen

2014-09-01

Full Text Available In this study, it was aimed to examine the use of learning management systems supported by social networking sites in distance education and to determine the views of learners regarding these platforms. The study group of this study, which uses a qualitative research approach, consists of 15 undergraduate students who resumed their education in Turkey. The data were gathered via a semi-structured interview form which consists of open-ended questions. Content analysis was used in the analysis of the data. According to the results of the study, it has been revealed within the scope of the course that the students have positive attitudes towards the use of social networking sites and distance education applications and these applications have positively affected the quality of communication between instructors and students. Furthermore, it was seen that the students made comments relating to the interesting aspects of the applications and the difference between distance education and face-to-face learning.

Distance-Constraint k-Nearest Neighbor Searching in Mobile Sensor Networks.

Science.gov (United States)

Han, Yongkoo; Park, Kisung; Hong, Jihye; Ulamin, Noor; Lee, Young-Koo

2015-07-27

The κ-Nearest Neighbors ( κNN) query is an important spatial query in mobile sensor networks. In this work we extend κNN to include a distance constraint, calling it a l-distant κ-nearest-neighbors (l-κNN) query, which finds the κ sensor nodes nearest to a query point that are also at or greater distance from each other. The query results indicate the objects nearest to the area of interest that are scattered from each other by at least distance l. The l-κNN query can be used in most κNN applications for the case of well distributed query results. To process an l-κNN query, we must discover all sets of κNN sensor nodes and then find all pairs of sensor nodes in each set that are separated by at least a distance l. Given the limited battery and computing power of sensor nodes, this l-κNN query processing is problematically expensive in terms of energy consumption. In this paper, we propose a greedy approach for l-κNN query processing in mobile sensor networks. The key idea of the proposed approach is to divide the search space into subspaces whose all sides are l. By selecting κ sensor nodes from the other subspaces near the query point, we guarantee accurate query results for l-κNN. In our experiments, we show that the proposed method exhibits superior performance compared with a post-processing based method using the κNN query in terms of energy efficiency, query latency, and accuracy.

Mapping biological systems to network systems

CERN Document Server

Rathore, Heena

2016-01-01

The book presents the challenges inherent in the paradigm shift of network systems from static to highly dynamic distributed systems – it proposes solutions that the symbiotic nature of biological systems can provide into altering networking systems to adapt to these changes. The author discuss how biological systems – which have the inherent capabilities of evolving, self-organizing, self-repairing and flourishing with time – are inspiring researchers to take opportunities from the biology domain and map them with the problems faced in network domain. The book revolves around the central idea of bio-inspired systems -- it begins by exploring why biology and computer network research are such a natural match. This is followed by presenting a broad overview of biologically inspired research in network systems -- it is classified by the biological field that inspired each topic and by the area of networking in which that topic lies. Each case elucidates how biological concepts have been most successfully ...

Somatotopic Map and Inter- and Intra-Digit Distance in Brodmann Area 2 by Pressure Stimulation

Science.gov (United States)

Choi, Mi-Hyun; Kim, Sung-Phil; Kim, Hyung-Sik; Gim, Seon-Young; Kim, Woo-Ram; Mun, Kyung-Ryul; Lim, Dae-Woon; Lee, Bongsoo; Chung, Soon-Cheol

2016-01-01

The somatotopic representation of the tactile stimulation on the finger in the brain is an essential part of understanding the human somatosensory system as well as rehabilitation and other clinical therapies. Many studies have used vibrotactile stimulations and reported finger somatotopic representations in the Brodmann area 3 (BA 3). On the contrary, few studies investigated finger somatotopic representation using pressure stimulations. Therefore, the present study aimed to find a comprehensive somatotopic representation (somatotopic map and inter- and intra-digit distance) within BA 2 of humans that could describe tactile stimulations on different joints across the fingers by applying pressure stimulation to three joints-the first (p1), second (p2), and third (p3) joints-of four fingers (index, middle, ring, and little finger). Significant differences were observed in the inter-digit distance between the first joints (p1) of the index and little fingers, and between the third joints (p3) of the index and little fingers. In addition, a significant difference was observed in the intra-digit distance between p1 and p3 of the little finger. This study suggests that a somatotopic map and inter- and intra-digit distance could be found in BA 2 in response to pressure stimulation on finger joints. PMID:27452859

Connecting long distance: semantic distance in analogical reasoning modulates frontopolar cortex activity.

Science.gov (United States)

Green, Adam E; Kraemer, David J M; Fugelsang, Jonathan A; Gray, Jeremy R; Dunbar, Kevin N

2010-01-01

Solving problems often requires seeing new connections between concepts or events that seemed unrelated at first. Innovative solutions of this kind depend on analogical reasoning, a relational reasoning process that involves mapping similarities between concepts. Brain-based evidence has implicated the frontal pole of the brain as important for analogical mapping. Separately, cognitive research has identified semantic distance as a key characteristic of the kind of analogical mapping that can support innovation (i.e., identifying similarities across greater semantic distance reveals connections that support more innovative solutions and models). However, the neural substrates of semantically distant analogical mapping are not well understood. Here, we used functional magnetic resonance imaging (fMRI) to measure brain activity during an analogical reasoning task, in which we parametrically varied the semantic distance between the items in the analogies. Semantic distance was derived quantitatively from latent semantic analysis. Across 23 participants, activity in an a priori region of interest (ROI) in left frontopolar cortex covaried parametrically with increasing semantic distance, even after removing effects of task difficulty. This ROI was centered on a functional peak that we previously associated with analogical mapping. To our knowledge, these data represent a first empirical characterization of how the brain mediates semantically distant analogical mapping.

Optimal Coordination of Distance and Directional Overcurrent Relays Considering Different Network Topologies

Directory of Open Access Journals (Sweden)

Y. Damchi

2015-09-01

Full Text Available Most studies in relay coordination have focused solely on coordination of overcurrent relays while distance relays are used as the main protection of transmission lines. Since, simultaneous coordination of these two types of relays can provide a better protection, in this paper, a new approach is proposed for simultaneous coordination of distance and directional overcurrent relays (D&DOCRs. Also, pursued by most of the previously published studies, the settings of D&DOCRs are usually determined based on a main network topology which may result in mis-coordination of relays when changes occur in the network topology. In the proposed method, in order to have a robust coordination, network topology changes are taken into account in the coordination problem. In the new formulation, coordination constraints for different network topologies are added to those of the main topology. A complex nonlinear optimization problem is derived to find the desirable relay settings. Then, the problem is solved using hybridized genetic algorithm (GA with linear programming (LP method (HGA. The proposed method is evaluated using the IEEE 14-bus test system. According to the results, a feasible and robust solution is obtained for D&DOCRs coordination while all constraints, which are due to different network topologies, are satisfied.

Energy-efficient virtual optical network mapping approaches over converged flexible bandwidth optical networks and data centers.

Science.gov (United States)

Chen, Bowen; Zhao, Yongli; Zhang, Jie

2015-09-21

In this paper, we develop a virtual link priority mapping (LPM) approach and a virtual node priority mapping (NPM) approach to improve the energy efficiency and to reduce the spectrum usage over the converged flexible bandwidth optical networks and data centers. For comparison, the lower bound of the virtual optical network mapping is used for the benchmark solutions. Simulation results show that the LPM approach achieves the better performance in terms of power consumption, energy efficiency, spectrum usage, and the number of regenerators compared to the NPM approach.

On Line Segment Length and Mapping 4-regular Grid Structures in Network Infrastructures

DEFF Research Database (Denmark)

Riaz, Muhammad Tahir; Nielsen, Rasmus Hjorth; Pedersen, Jens Myrup

2006-01-01

The paper focuses on mapping the road network into 4-regular grid structures. A mapping algorithm is proposed. To model the road network GIS data have been used. The Geographic Information System (GIS) data for the road network are composed with different size of line segment lengths...

Addressing the Influence of Hidden State on Wireless Network Optimizations using Performance Maps

DEFF Research Database (Denmark)

Højgaard-Hansen, Kim; Madsen, Tatiana Kozlova; Schwefel, Hans-Peter

2015-01-01

be used to optimize the use of the wireless net- work by predicting future network performance and scheduling the net- work communication for certain applications on mobile devices. However, other important factors influence the performance of the wireless communication such as changes in the propagation...... environment and resource sharing. In this work we extend the framework of performance maps for wireless networks by introducing network state as an abstraction for all other factors than location that influence the performance. Since network state might not always be directly observable the framework......Performance of wireless connectivity for network client devices is location dependent. It has been shown that it can be beneficial to collect network performance metrics along with location information to generate maps of the location dependent network performance. These performance maps can...

Mapping change in large networks.

Directory of Open Access Journals (Sweden)

Martin Rosvall

2010-01-01

Full Text Available Change is a fundamental ingredient of interaction patterns in biology, technology, the economy, and science itself: Interactions within and between organisms change; transportation patterns by air, land, and sea all change; the global financial flow changes; and the frontiers of scientific research change. Networks and clustering methods have become important tools to comprehend instances of these large-scale structures, but without methods to distinguish between real trends and noisy data, these approaches are not useful for studying how networks change. Only if we can assign significance to the partitioning of single networks can we distinguish meaningful structural changes from random fluctuations. Here we show that bootstrap resampling accompanied by significance clustering provides a solution to this problem. To connect changing structures with the changing function of networks, we highlight and summarize the significant structural changes with alluvial diagrams and realize de Solla Price's vision of mapping change in science: studying the citation pattern between about 7000 scientific journals over the past decade, we find that neuroscience has transformed from an interdisciplinary specialty to a mature and stand-alone discipline.

Controlling the interparticle distance in a 2D molecule-nanoparticle network

Energy Technology Data Exchange (ETDEWEB)

Guedon, C M; Zonneveld, J; Van der Molen, S J [Kamerlingh Onnes Laboratorium, Leiden University, PO Box 9504, 2300 RA Leiden (Netherlands); Valkenier, H; Hummelen, J C [Stratingh Institute for Chemistry, University of Groningen, Nijenborgh 4, 9747 AG Groningen (Netherlands)

2011-03-25

Mechanically controllable break junctions allow for an impressive level of control over the distance between two electrodes, but lack stability at room temperature. On the other hand, two-dimensional (2D) networks of nanoparticles bridged by molecules form a stable device structure for investigating molecular conductance properties. Here, we combine both techniques to create a robust platform for molecular charge transport with control over the inter-electrode distance on the picometer scale. The resistance change due to bending of our structures is dependent on the molecular species present between the nanoparticles.

Controlling the interparticle distance in a 2D molecule-nanoparticle network

International Nuclear Information System (INIS)

Guedon, C M; Zonneveld, J; Van der Molen, S J; Valkenier, H; Hummelen, J C

2011-01-01

Mechanically controllable break junctions allow for an impressive level of control over the distance between two electrodes, but lack stability at room temperature. On the other hand, two-dimensional (2D) networks of nanoparticles bridged by molecules form a stable device structure for investigating molecular conductance properties. Here, we combine both techniques to create a robust platform for molecular charge transport with control over the inter-electrode distance on the picometer scale. The resistance change due to bending of our structures is dependent on the molecular species present between the nanoparticles.

Real-time method for establishing a detection map for a network of sensors

Science.gov (United States)

Nguyen, Hung D; Koch, Mark W; Giron, Casey; Rondeau, Daniel M; Russell, John L

2012-09-11

A method for establishing a detection map of a dynamically configurable sensor network. This method determines an appropriate set of locations for a plurality of sensor units of a sensor network and establishes a detection map for the network of sensors while the network is being set up; the detection map includes the effects of the local terrain and individual sensor performance. Sensor performance is characterized during the placement of the sensor units, which enables dynamic adjustment or reconfiguration of the placement of individual elements of the sensor network during network set-up to accommodate variations in local terrain and individual sensor performance. The reconfiguration of the network during initial set-up to accommodate deviations from idealized individual sensor detection zones improves the effectiveness of the sensor network in detecting activities at a detection perimeter and can provide the desired sensor coverage of an area while minimizing unintentional gaps in coverage.

One- and two-cluster synchronized dynamics of non-diffusively coupled Tchebycheff map networks

International Nuclear Information System (INIS)

Schäfer, Mirko; Greiner, Martin

2012-01-01

We use the master stability formalism to discuss one- and two-cluster synchronization of coupled Tchebycheff map networks. For diffusively coupled map systems, the one-cluster synchronized dynamics is given by the behaviour of the individual maps, and the coupling only determines the stability of the coherent state. For the case of non-diffusive coupling and for two-cluster synchronization, the synchronized dynamics on networks is different from the behaviour of the single individual map. Depending on the coupling, we study numerically the characteristics of various forms of the resulting synchronized dynamics. The stability properties of the respective one-cluster synchronized states are discussed for arbitrary network structures. For the case of two-cluster synchronization on bipartite networks we also present analytical expressions for fixed points and zig-zag patterns, and explicitly determine the linear stability of these orbits for the special case of ring-networks.

Distance Based Method for Outlier Detection of Body Sensor Networks

Directory of Open Access Journals (Sweden)

Haibin Zhang

2016-01-01

Full Text Available We propose a distance based method for the outlier detection of body sensor networks. Firstly, we use a Kernel Density Estimation (KDE to calculate the probability of the distance to k nearest neighbors for diagnosed data. If the probability is less than a threshold, and the distance of this data to its left and right neighbors is greater than a pre-defined value, the diagnosed data is decided as an outlier. Further, we formalize a sliding window based method to improve the outlier detection performance. Finally, to estimate the KDE by training sensor readings with errors, we introduce a Hidden Markov Model (HMM based method to estimate the most probable ground truth values which have the maximum probability to produce the training data. Simulation results show that the proposed method possesses a good detection accuracy with a low false alarm rate.

A global genetic interaction network maps a wiring diagram of cellular function.

Science.gov (United States)

Costanzo, Michael; VanderSluis, Benjamin; Koch, Elizabeth N; Baryshnikova, Anastasia; Pons, Carles; Tan, Guihong; Wang, Wen; Usaj, Matej; Hanchard, Julia; Lee, Susan D; Pelechano, Vicent; Styles, Erin B; Billmann, Maximilian; van Leeuwen, Jolanda; van Dyk, Nydia; Lin, Zhen-Yuan; Kuzmin, Elena; Nelson, Justin; Piotrowski, Jeff S; Srikumar, Tharan; Bahr, Sondra; Chen, Yiqun; Deshpande, Raamesh; Kurat, Christoph F; Li, Sheena C; Li, Zhijian; Usaj, Mojca Mattiazzi; Okada, Hiroki; Pascoe, Natasha; San Luis, Bryan-Joseph; Sharifpoor, Sara; Shuteriqi, Emira; Simpkins, Scott W; Snider, Jamie; Suresh, Harsha Garadi; Tan, Yizhao; Zhu, Hongwei; Malod-Dognin, Noel; Janjic, Vuk; Przulj, Natasa; Troyanskaya, Olga G; Stagljar, Igor; Xia, Tian; Ohya, Yoshikazu; Gingras, Anne-Claude; Raught, Brian; Boutros, Michael; Steinmetz, Lars M; Moore, Claire L; Rosebrock, Adam P; Caudy, Amy A; Myers, Chad L; Andrews, Brenda; Boone, Charles

2016-09-23

We generated a global genetic interaction network for Saccharomyces cerevisiae, constructing more than 23 million double mutants, identifying about 550,000 negative and about 350,000 positive genetic interactions. This comprehensive network maps genetic interactions for essential gene pairs, highlighting essential genes as densely connected hubs. Genetic interaction profiles enabled assembly of a hierarchical model of cell function, including modules corresponding to protein complexes and pathways, biological processes, and cellular compartments. Negative interactions connected functionally related genes, mapped core bioprocesses, and identified pleiotropic genes, whereas positive interactions often mapped general regulatory connections among gene pairs, rather than shared functionality. The global network illustrates how coherent sets of genetic interactions connect protein complex and pathway modules to map a functional wiring diagram of the cell. Copyright © 2016, American Association for the Advancement of Science.

Networked curricula: fostering transnational partnership in open and distance learning

Directory of Open Access Journals (Sweden)

María Luz Cacheiro-González

2013-05-01

Full Text Available Transnational Networked Curricula (TNC provides many benefits to the institutions that offer them as well as to the different stakeholders involved, not only the students but also the academics, the institutions as a whole, and the wider society. Supporting Higher Education Institutions in enhancing and implementing international networked practices in virtual campus building is the main aim of the NetCU project, which has been developed by the EADTU, in partnership with 14 member organizations, from 2009 to 2012. The project outcomes intend to facilitate the future set-up of networked curricula in Higher Education institutions and potentially lead to more transnational partnerships in Open and Distance Education (ODE and blended learning, showing challenges, obstacles and ways to overcome them. This paper presents the main products developed in the project, assesses its completeness and usage, and discusses on the challenges of curricula networking starting from the ideas and opinions shared in different stakeholders workshops organized under the NetCU project.

Node-pair reliability of network systems with small distances between adjacent nodes

International Nuclear Information System (INIS)

Malinowski, Jacek

2007-01-01

A new method for computing the node-pair reliability of network systems modeled by random graphs with nodes arranged in sequence is presented. It is based on a recursive algorithm using the 'sliding window' technique, the window being composed of several consecutive nodes. In a single step, the connectivity probabilities for all nodes included in the window are found. Subsequently, the window is moved one node forward. This process is repeated until, in the last step, the window reaches the terminal node. The connectivity probabilities found at that point are used to compute the node-pair reliability of the network system considered. The algorithm is designed especially for graphs with small distances between adjacent nodes, where the distance between two nodes is defined as the absolute value of the difference between the nodes' numbers. The maximal distance between any two adjacent nodes is denoted by Γ(G), where G symbolizes a random graph. If Γ(G)=2 then the method can be applied for directed as well as undirected graphs whose nodes and edges are subject to failure. This is important in view of the fact that many algorithms computing network reliability are designed for graphs with failure-prone edges and reliable nodes. If Γ(G)=3 then the method's applicability is limited to undirected graphs with reliable nodes. The main asset of the presented algorithms is their low numerical complexity-O(n), where n denotes the number of nodes

Role of Distance-Based Routing in Traffic Dynamics on Mobile Networks

Science.gov (United States)

Yang, Han-Xin; Wang, Wen-Xu

2013-06-01

Despite of intensive investigations on transportation dynamics taking place on complex networks with fixed structures, a deep understanding of networks consisting of mobile nodes is challenging yet, especially the lacking of insight into the effects of routing strategies on transmission efficiency. We introduce a distance-based routing strategy for networks of mobile agents toward enhancing the network throughput and the transmission efficiency. We study the transportation capacity and delivering time of data packets associated with mobility and communication ability. Interestingly, we find that the transportation capacity is optimized at moderate moving speed, which is quite different from random routing strategy. In addition, both continuous and discontinuous transitions from free flow to congestions are observed. Degree distributions are explored in order to explain the enhancement of network throughput and other observations. Our work is valuable toward understanding complex transportation dynamics and designing effective routing protocols.

US long distance fiber optic networks: Technology, evolution and advanced concepts. Volume 3: Advanced networks and economics

Science.gov (United States)

1986-10-01

This study projects until 2000 the evolution of long distance fiber optic networks in the U.S. Volume 1 is the executive Summary. Volume 2 focuses on fiber optic components and systems that are directly related to the operation of long-haul networks. Optimistic, pessimistic and most likely scenarios of technology development are presented. The activities of national and regional companies implementing fiber long haul networks are also highlighted, along with an analysis of the market and regulatory forces affecting network evolution. Volume 3 presents advanced fiber optic network concept definitions. Inter-LATA traffic is quantified and forms the basis for the construction of 11-, 15-, 17-, and 23-node networks. Using the technology projections from Volume 2, a financial model identifies cost drivers and determines circuit mile costs between any two LATAs. A comparison of fiber optics with alternative transmission concludes the report.

Epidemic spread over networks with agent awareness and social distancing

KAUST Repository

Paarporn, Keith

2016-04-20

We study an SIS epidemic model over an arbitrary connected network topology when the agents receive personalized information about the current epidemic state. The agents utilize their available information to either reduce interactions with their neighbors (social distancing) when they believe the epidemic is currently prevalent or resume normal interactions when they believe there is low risk of becoming infected. The information is a weighted combination of three sources: 1) the average states of nodes in contact neighborhoods 2) the average states of nodes in an information network 3) a global broadcast of the average epidemic state of the network. A 2n-state Markov Chain is first considered to model the disease dynamics with awareness, from which a mean-field discrete-time n-state dynamical system is derived, where each state corresponds to an agent\\'s probability of being infected. The nonlinear model is a lower bound of its linearized version about the origin. Hence, global stability of the origin (the diseasefree equilibrium) in the linear model implies global stability in the nonlinear model. When the origin is not stable, we show the existence of a nontrivial fixed point in the awareness model, which obeys a strict partial order in relation to the nontrivial fixed point of the dynamics without distancing. In simulations, we define two performance metrics to understand the effectiveness agent awareness has in reducing the spread of an epidemic. © 2015 IEEE.

Visualization of neural networks using saliency maps

DEFF Research Database (Denmark)

Mørch, Niels J.S.; Kjems, Ulrik; Hansen, Lars Kai

1995-01-01

The saliency map is proposed as a new method for understanding and visualizing the nonlinearities embedded in feedforward neural networks, with emphasis on the ill-posed case, where the dimensionality of the input-field by far exceeds the number of examples. Several levels of approximations...

Structure-Function Network Mapping and Its Assessment via Persistent Homology

Science.gov (United States)

2017-01-01

Understanding the relationship between brain structure and function is a fundamental problem in network neuroscience. This work deals with the general method of structure-function mapping at the whole-brain level. We formulate the problem as a topological mapping of structure-function connectivity via matrix function, and find a stable solution by exploiting a regularization procedure to cope with large matrices. We introduce a novel measure of network similarity based on persistent homology for assessing the quality of the network mapping, which enables a detailed comparison of network topological changes across all possible thresholds, rather than just at a single, arbitrary threshold that may not be optimal. We demonstrate that our approach can uncover the direct and indirect structural paths for predicting functional connectivity, and our network similarity measure outperforms other currently available methods. We systematically validate our approach with (1) a comparison of regularized vs. non-regularized procedures, (2) a null model of the degree-preserving random rewired structural matrix, (3) different network types (binary vs. weighted matrices), and (4) different brain parcellation schemes (low vs. high resolutions). Finally, we evaluate the scalability of our method with relatively large matrices (2514x2514) of structural and functional connectivity obtained from 12 healthy human subjects measured non-invasively while at rest. Our results reveal a nonlinear structure-function relationship, suggesting that the resting-state functional connectivity depends on direct structural connections, as well as relatively parsimonious indirect connections via polysynaptic pathways. PMID:28046127

Topological data analysis of contagion maps for examining spreading processes on networks

KAUST Repository

Taylor, Dane

2015-07-21

Social and biological contagions are influenced by the spatial embeddedness of networks. Historically, many epidemics spread as a wave across part of the Earth\\'s surface; however, in modern contagions long-range edges - for example, due to airline transportation or communication media - allow clusters of a contagion to appear in distant locations. Here we study the spread of contagions on networks through a methodology grounded in topological data analysis and nonlinear dimension reduction. We construct \\'contagion maps\\' that use multiple contagions on a network to map the nodes as a point cloud. By analysing the topology, geometry and dimensionality of manifold structure in such point clouds, we reveal insights to aid in the modelling, forecast and control of spreading processes. Our approach highlights contagion maps also as a viable tool for inferring low-dimensional structure in networks.

Topological data analysis of contagion maps for examining spreading processes on networks.

Science.gov (United States)

Taylor, Dane; Klimm, Florian; Harrington, Heather A; Kramár, Miroslav; Mischaikow, Konstantin; Porter, Mason A; Mucha, Peter J

2015-07-21

Social and biological contagions are influenced by the spatial embeddedness of networks. Historically, many epidemics spread as a wave across part of the Earth's surface; however, in modern contagions long-range edges-for example, due to airline transportation or communication media-allow clusters of a contagion to appear in distant locations. Here we study the spread of contagions on networks through a methodology grounded in topological data analysis and nonlinear dimension reduction. We construct 'contagion maps' that use multiple contagions on a network to map the nodes as a point cloud. By analysing the topology, geometry and dimensionality of manifold structure in such point clouds, we reveal insights to aid in the modelling, forecast and control of spreading processes. Our approach highlights contagion maps also as a viable tool for inferring low-dimensional structure in networks.

Topological data analysis of contagion maps for examining spreading processes on networks

Science.gov (United States)

Taylor, Dane; Klimm, Florian; Harrington, Heather A.; Kramár, Miroslav; Mischaikow, Konstantin; Porter, Mason A.; Mucha, Peter J.

2015-07-01

Social and biological contagions are influenced by the spatial embeddedness of networks. Historically, many epidemics spread as a wave across part of the Earth's surface; however, in modern contagions long-range edges--for example, due to airline transportation or communication media--allow clusters of a contagion to appear in distant locations. Here we study the spread of contagions on networks through a methodology grounded in topological data analysis and nonlinear dimension reduction. We construct `contagion maps' that use multiple contagions on a network to map the nodes as a point cloud. By analysing the topology, geometry and dimensionality of manifold structure in such point clouds, we reveal insights to aid in the modelling, forecast and control of spreading processes. Our approach highlights contagion maps also as a viable tool for inferring low-dimensional structure in networks.

Topological data analysis of contagion maps for examining spreading processes on networks

KAUST Repository

Taylor, Dane; Klimm, Florian; Harrington, Heather A.; Kramá r, Miroslav; Mischaikow, Konstantin; Porter, Mason A.; Mucha, Peter J.

2015-01-01

Social and biological contagions are influenced by the spatial embeddedness of networks. Historically, many epidemics spread as a wave across part of the Earth's surface; however, in modern contagions long-range edges - for example, due to airline transportation or communication media - allow clusters of a contagion to appear in distant locations. Here we study the spread of contagions on networks through a methodology grounded in topological data analysis and nonlinear dimension reduction. We construct 'contagion maps' that use multiple contagions on a network to map the nodes as a point cloud. By analysing the topology, geometry and dimensionality of manifold structure in such point clouds, we reveal insights to aid in the modelling, forecast and control of spreading processes. Our approach highlights contagion maps also as a viable tool for inferring low-dimensional structure in networks.

Social networks improve leaderless group navigation by facilitating long-distance communication

Directory of Open Access Journals (Sweden)

Nikolai W. F. BODE, A. Jamie WOOD, Daniel W. FRANKS

2012-04-01

Full Text Available Group navigation is of great importance for many animals, such as migrating flocks of birds or shoals of fish. One theory states that group membership can improve navigational accuracy compared to limited or less accurate individual navigational ability in groups without leaders (“Many-wrongs principle”. Here, we simulate leaderless group navigation that includes social connections as preferential interactions between individuals. Our results suggest that underlying social networks can reduce navigational errors of groups and increase group cohesion. We use network summary statistics, in particular network motifs, to study which characteristics of networks lead to these improvements. It is networks in which preferences between individuals are not clustered, but spread evenly across the group that are advantageous in group navigation by effectively enhancing long-distance information exchange within groups. We suggest that our work predicts a base-line for the type of social structure we might expect to find in group-living animals that navigate without leaders [Current Zoology 58 (2: 329-341, 2012].

The Hetu'u Global Network: Measuring the Distance to the Sun with the Transit of Venus

Science.gov (United States)

Rodriguez, David; Faherty, J.

2013-01-01

In the spirit of historic astronomical endeavors, we invited school groups across the globe to collaborate in a solar distance measurement using the 2012 transit of Venus. In total, our group (stationed at Easter Island, Chile) recruited 19 school groups spread over 6 continents and 10 countries to participate in our Hetu’u Global Network. Applying the methods of French astronomer Joseph-Nicolas Delisle, we used individual second and third Venus-Sun contact times to calculate the distance to the Sun. Ten of the sites in our network had amiable weather; 8 of which measured second contact and 5 of which measured third contact leading to consistent solar distance measurements of 152+/-30 million km and 163+/-30 million km respectively. The distance to the Sun at the time of the transit was 152.25 million km; therefore, our measurements are also consistent within 1-sigma of the known value. The goal of our international school group network was to inspire the next generation of scientists using the excitement and accessibility of such a rare astronomical event. In the process, we connected hundreds of participating students representing a diverse, multi-cultural group with differing political, economic, and racial backgrounds.

Cutaneous leishmaniasis susceptibility mapping using multi-criteria decision-making techniques, analytic hierarchy process (AHP and analytic network process (ANP

Directory of Open Access Journals (Sweden)

SEYED VAHID RAZAVI TERMEH

2018-02-01

Full Text Available Background & objective:Cutaneous leech is one of the six major diseases and an example of epidemic diseases in tropical regions. Prevalence and spread of this disease is affected by environmental factors and climatic conditions as well as economic, social and cultural issues. In this research, Analytic Hierarchy Process and network analyzes are used to prepare susceptible cutaneous leeches map. Considering high incidence of cutaneous leech in Khuzestan province, Izeh city was selected as a case study.   Materials & Methods: For this purpose, the number of patients affected by this disease in Izeh was obtained from the Provincial Health Center from 2009 to 2014. Information layers of elevation, rainfall, temperature, humidity, distance from river, distance from rural areas and land use were identified as effective parameter and their maps were prepared in GIS environment. Parameters were compared in pairs by using AHP and ANP and weight of each factors determining their impacts was calculated in Expert Choice and Super Decision software. Then these parameters were combined based on their obtained weights in ArcGIS software and the final cutaneous leech map was prepared. Evaluation of these methods was performed using relative operation curve (ROC and 16 points related to leech disease. Result: The results of weighting effective parameters using AHP and ANP showed that the highest weight is related to elevation, temperature and rainfall parameters, respectively. The results of ROC assessment showed that in preparing the map, ANP had an accuracy of 87.8% and AHP had an accuracy of 68.9%. Conclusion:The results of ANP showed that this model had suitable accuracy in preparing susceptible cutaneous leech map and AHP had moderate accuracy in preparing susceptible cutaneous leech map.

Detecting Malicious Nodes in Medical Smartphone Networks Through Euclidean Distance-Based Behavioral Profiling

DEFF Research Database (Denmark)

Meng, Weizhi; Li, Wenjuan; Wang, Yu

2017-01-01

and healthcare personnel. The underlying network architecture to support such devices is also referred to as medical smartphone networks (MSNs). Similar to other networks, MSNs also suffer from various attacks like insider attacks (e.g., leakage of sensitive patient information by a malicious insider......). In this work, we focus on MSNs and design a trust-based intrusion detection approach through Euclidean distance-based behavioral profiling to detect malicious devices (or called nodes). In the evaluation, we collaborate with healthcare organizations and implement our approach in a real simulated MSN...

Bifurcation behaviors of synchronized regions in logistic map networks with coupling delay

International Nuclear Information System (INIS)

Tang, Longkun; Wu, Xiaoqun; Lu, Jun-an; Lü, Jinhu

2015-01-01

Network synchronized regions play an extremely important role in network synchronization according to the master stability function framework. This paper focuses on network synchronous state stability via studying the effects of nodal dynamics, coupling delay, and coupling way on synchronized regions in Logistic map networks. Theoretical and numerical investigations show that (1) network synchronization is closely associated with its nodal dynamics. Particularly, the synchronized region bifurcation points through which the synchronized region switches from one type to another are in good agreement with those of the uncoupled node system, and chaotic nodal dynamics can greatly impede network synchronization. (2) The coupling delay generally impairs the synchronizability of Logistic map networks, which is also dominated by the parity of delay for some nodal parameters. (3) A simple nonlinear coupling facilitates network synchronization more than the linear one does. The results found in this paper will help to intensify our understanding for the synchronous state stability in discrete-time networks with coupling delay

One-way hash function construction based on chaotic map network

International Nuclear Information System (INIS)

Yang Huaqian; Wong, K.-W.; Liao Xiaofeng; Wang Yong; Yang Degang

2009-01-01

A novel chaotic hash algorithm based on a network structure formed by 16 chaotic maps is proposed. The original message is first padded with zeros to make the length a multiple of four. Then it is divided into a number of blocks each contains 4 bytes. In the hashing process, the blocks are mixed together by the chaotic map network since the initial value and the control parameter of each tent map are dynamically determined by the output of its neighbors. To enhance the confusion and diffusion effect, the cipher block chaining (CBC) mode is adopted in the algorithm. Theoretic analyses and numerical simulations both show that the proposed hash algorithm possesses good statistical properties, strong collision resistance and high flexibility, as required by practical keyed hash functions.

Ontology Mapping Neural Network: An Approach to Learning and Inferring Correspondences among Ontologies

Science.gov (United States)

Peng, Yefei

2010-01-01

An ontology mapping neural network (OMNN) is proposed in order to learn and infer correspondences among ontologies. It extends the Identical Elements Neural Network (IENN)'s ability to represent and map complex relationships. The learning dynamics of simultaneous (interlaced) training of similar tasks interact at the shared connections of the…

Mapping human brain networks with cortico-cortical evoked potentials

Science.gov (United States)

Keller, Corey J.; Honey, Christopher J.; Mégevand, Pierre; Entz, Laszlo; Ulbert, Istvan; Mehta, Ashesh D.

2014-01-01

The cerebral cortex forms a sheet of neurons organized into a network of interconnected modules that is highly expanded in humans and presumably enables our most refined sensory and cognitive abilities. The links of this network form a fundamental aspect of its organization, and a great deal of research is focusing on understanding how information flows within and between different regions. However, an often-overlooked element of this connectivity regards a causal, hierarchical structure of regions, whereby certain nodes of the cortical network may exert greater influence over the others. While this is difficult to ascertain non-invasively, patients undergoing invasive electrode monitoring for epilepsy provide a unique window into this aspect of cortical organization. In this review, we highlight the potential for cortico-cortical evoked potential (CCEP) mapping to directly measure neuronal propagation across large-scale brain networks with spatio-temporal resolution that is superior to traditional neuroimaging methods. We first introduce effective connectivity and discuss the mechanisms underlying CCEP generation. Next, we highlight how CCEP mapping has begun to provide insight into the neural basis of non-invasive imaging signals. Finally, we present a novel approach to perturbing and measuring brain network function during cognitive processing. The direct measurement of CCEPs in response to electrical stimulation represents a potentially powerful clinical and basic science tool for probing the large-scale networks of the human cerebral cortex. PMID:25180306

Mapping the q-voter model: From a single chain to complex networks

Science.gov (United States)

Jȩdrzejewski, Arkadiusz; Sznajd-Weron, Katarzyna; Szwabiński, Janusz

2016-03-01

We propose and compare six different ways of mapping the modified q-voter model to complex networks. Considering square lattices, Barabási-Albert, Watts-Strogatz and real Twitter networks, we ask the question if always a particular choice of the group of influence of a fixed size q leads to different behavior at the macroscopic level. Using Monte Carlo simulations we show that the answer depends on the relative average path length of the network and for real-life topologies the differences between the considered mappings may be negligible.

Networking for large-scale science: infrastructure, provisioning, transport and application mapping

International Nuclear Information System (INIS)

Rao, Nageswara S; Carter, Steven M; Wu Qishi; Wing, William R; Zhu Mengxia; Mezzacappa, Anthony; Veeraraghavan, Malathi; Blondin, John M

2005-01-01

Large-scale science computations and experiments require unprecedented network capabilities in the form of large bandwidth and dynamically stable connections to support data transfers, interactive visualizations, and monitoring and steering operations. A number of component technologies dealing with the infrastructure, provisioning, transport and application mappings must be developed and/or optimized to achieve these capabilities. We present a brief account of the following technologies that contribute toward achieving these network capabilities: (a) DOE UltraScienceNet and NSF CHEETAH network testbeds that provide on-demand and scheduled dedicated network connections; (b) experimental results on transport protocols that achieve close to 100% utilization on dedicated 1Gbps wide-area channels; (c) a scheme for optimally mapping a visualization pipeline onto a network to minimize the end-to-end delays; and (d) interconnect configuration and protocols that provides multiple Gbps flows from Cray X1 to external hosts

Networking for large-scale science: infrastructure, provisioning, transport and application mapping

Energy Technology Data Exchange (ETDEWEB)

Rao, Nageswara S [Computer Science and Mathematics Division, Oak Ridge National Laboratory, Oak Ridge, TN 37831 (United States); Carter, Steven M [Computer Science and Mathematics Division, Oak Ridge National Laboratory, Oak Ridge, TN 37831 (United States); Wu Qishi [Computer Science and Mathematics Division, Oak Ridge National Laboratory, Oak Ridge, TN 37831 (United States); Wing, William R [Computer Science and Mathematics Division, Oak Ridge National Laboratory, Oak Ridge, TN 37831 (United States); Zhu Mengxia [Department of Computer Science, Louisiana State University, Baton Rouge, LA 70803 (United States); Mezzacappa, Anthony [Physics Division, Oak Ridge National Laboratory, Oak Ridge, TN 37831 (United States); Veeraraghavan, Malathi [Department of Computer Science, University of Virginia, Charlottesville, VA 22904 (United States); Blondin, John M [Department of Physics, North Carolina State University, Raleigh, NC 27695 (United States)

2005-01-01

Large-scale science computations and experiments require unprecedented network capabilities in the form of large bandwidth and dynamically stable connections to support data transfers, interactive visualizations, and monitoring and steering operations. A number of component technologies dealing with the infrastructure, provisioning, transport and application mappings must be developed and/or optimized to achieve these capabilities. We present a brief account of the following technologies that contribute toward achieving these network capabilities: (a) DOE UltraScienceNet and NSF CHEETAH network testbeds that provide on-demand and scheduled dedicated network connections; (b) experimental results on transport protocols that achieve close to 100% utilization on dedicated 1Gbps wide-area channels; (c) a scheme for optimally mapping a visualization pipeline onto a network to minimize the end-to-end delays; and (d) interconnect configuration and protocols that provides multiple Gbps flows from Cray X1 to external hosts.

INTEGRATING INTERNET PROTOCOL TELEVISION (IPTV IN DISTANCE EDUCATION: A Constructivist Framework for Social Networking

Directory of Open Access Journals (Sweden)

T. Volkan YUZER

2011-07-01

Full Text Available New communication technologies and constructivist pedagogy have the great potential to build very powerful paradigm shifts that enhance Internet Protocol Television (IPTV in distance education. Therefore, the main purpose of this chapter is to explore the new concerns, issues and potentials for the IPTV delivery of distance education to multicultural populations. In this study, the design strategies and principles of how to build social networking based on constructivist learning theory are discussed in order to generate a theoretical framework that provides everyday examples and experiences for IPTV in distance education. This framework also shows the needs, expectations and beliefs, and strengths-weaknesses of IPTV in distance. In short, this framework concentrates on discussing the main characteristics of IPTV in distance education and describes how those characteristics can help build constructivist online communities.

Name-Based Address Mapping for Virtual Private Networks

Science.gov (United States)

Surányi, Péter; Shinjo, Yasushi; Kato, Kazuhiko

IPv4 private addresses are commonly used in local area networks (LANs). With the increasing popularity of virtual private networks (VPNs), it has become common that a user connects to multiple LANs at the same time. However, private address ranges for LANs frequently overlap. In such cases, existing systems do not allow the user to access the resources on all LANs at the same time. In this paper, we propose name-based address mapping for VPNs, a novel method that allows connecting to hosts through multiple VPNs at the same time, even when the address ranges of the VPNs overlap. In name-based address mapping, rather than using the IP addresses used on the LANs (the real addresses), we assign a unique virtual address to each remote host based on its domain name. The local host uses the virtual addresses to communicate with remote hosts. We have implemented name-based address mapping for layer 3 OpenVPN connections on Linux and measured its performance. The communication overhead of our system is less than 1.5% for throughput and less than 0.2ms for each name resolution.

Co-regulation of metabolic genes is better explained by flux coupling than by network distance.

Directory of Open Access Journals (Sweden)

Richard A Notebaart

2008-01-01

Full Text Available To what extent can modes of gene regulation be explained by systems-level properties of metabolic networks? Prior studies on co-regulation of metabolic genes have mainly focused on graph-theoretical features of metabolic networks and demonstrated a decreasing level of co-expression with increasing network distance, a naïve, but widely used, topological index. Others have suggested that static graph representations can poorly capture dynamic functional associations, e.g., in the form of dependence of metabolic fluxes across genes in the network. Here, we systematically tested the relative importance of metabolic flux coupling and network position on gene co-regulation, using a genome-scale metabolic model of Escherichia coli. After validating the computational method with empirical data on flux correlations, we confirm that genes coupled by their enzymatic fluxes not only show similar expression patterns, but also share transcriptional regulators and frequently reside in the same operon. In contrast, we demonstrate that network distance per se has relatively minor influence on gene co-regulation. Moreover, the type of flux coupling can explain refined properties of the regulatory network that are ignored by simple graph-theoretical indices. Our results underline the importance of studying functional states of cellular networks to define physiologically relevant associations between genes and should stimulate future developments of novel functional genomic tools.

Satellites vs. fiber optics based networks and services - Road map to strategic planning

Science.gov (United States)

Marandi, James H. R.

An overview of a generic telecommunications network and its components is presented, and the current developments in satellite and fiber optics technologies are discussed with an eye on the trends in industry. A baseline model is proposed, and a cost comparison of fiber- vs satellite-based networks is made. A step-by-step 'road map' to the successful strategic planning of telecommunications services and facilities is presented. This road map provides for optimization of the current and future networks and services through effective utilization of both satellites and fiber optics. The road map is then applied to different segments of the telecommunications industry and market place, to show its effectiveness for the strategic planning of executives of three types: (1) those heading telecommunications manufacturing concerns, (2) those leading communication service companies, and (3) managers of telecommunication/MIS departments of major corporations. Future networking issues, such as developments in integrated-services digital network standards and technologies, are addressed.

SPATIAL DATA MINING TOOLBOX FOR MAPPING SUITABILITY OF LANDFILL SITES USING NEURAL NETWORKS

Directory of Open Access Journals (Sweden)

S. K. M. Abujayyab

2016-09-01

Full Text Available Mapping the suitability of landfill sites is a complex field and is involved with multidiscipline. The purpose of this research is to create an ArcGIS spatial data mining toolbox for mapping the suitability of landfill sites at a regional scale using neural networks. The toolbox is constructed from six sub-tools to prepare, train, and process data. The employment of the toolbox is straightforward. The multilayer perceptron (MLP neural networks structure with a backpropagation learning algorithm is used. The dataset is mined from the north states in Malaysia. A total of 14 criteria are utilized to build the training dataset. The toolbox provides a platform for decision makers to implement neural networks for mapping the suitability of landfill sites in the ArcGIS environment. The result shows the ability of the toolbox to produce suitability maps for landfill sites.

Minimum Map of Social Institutional Network: a multidimensional strategy for research in Nursing

Directory of Open Access Journals (Sweden)

Diene Monique Carlos

2016-06-01

Full Text Available Objective To analyze the use of methodological strategies in qualitative research - Minimum Maps of Social Institutional Network, as proposed to understand the phenomena in the multidimensional perspective. Method Methodological theoretical essay in which we aimed to reflect on the use of innovative methodological strategies in nursing research, supported in Complex Paradigm fundamentals. Results The minimum map of Social Institutional External Network aims to identify institutional linkages and gaps for the intervention work of the surveyed institutions. The use of these maps provided important advances in know-how qualitative research in Health and Nursing. Conclusions In this perspective, the use of minimum Social Intitutional Network maps can be stimulated and enhanced to meet the current demands of the contemporary world, particularly for its flexibility in adapting to various research subjects; breadth and depth of discussion; and possibilities with health services.

Self-Organization in Coupled Map Scale-Free Networks

International Nuclear Information System (INIS)

Xiao-Ming, Liang; Zong-Hua, Liu; Hua-Ping, Lü

2008-01-01

We study the self-organization of phase synchronization in coupled map scale-free networks with chaotic logistic map at each node and find that a variety of ordered spatiotemporal patterns emerge spontaneously in a regime of coupling strength. These ordered behaviours will change with the increase of the average links and are robust to both the system size and parameter mismatch. A heuristic theory is given to explain the mechanism of self-organization and to figure out the regime of coupling for the ordered spatiotemporal patterns

KEY ISSUES OF CONCEPTS' FORMATION OF THE NETWORK OF RESOURCE CENTER OF DISTANCE EDUCATION OF GENERAL EDUCATION INSTITUTIONS

Directory of Open Access Journals (Sweden)

Yuriy M. Bogachkov

2013-06-01

Full Text Available In the article the problem of constructing a network of resource centers for Distance Education to meet the needs of general secondary schools is presented. Modern educational trends in the use of Internet services in education are viewed.  Main contradictions, solution of which helps to create a network of resource centers, are identified. The definition of key terms related to the range of issues are given. The basic categories of participants, who  implementation of e-learning and networking are oriented on. There are considered the basic tasks of  distance education resource centers' functioning and types of supporting: personnel, regulatory, informative, systematic and  technical etc. The review of possible models of implementation of  students' distance education is reviewed . Three options for business models of resource centers, depending on funding  sources are offered.

Pattern classification and recognition of invertebrate functional groups using self-organizing neural networks.

Science.gov (United States)

Zhang, WenJun

2007-07-01

Self-organizing neural networks can be used to mimic non-linear systems. The main objective of this study is to make pattern classification and recognition on sampling information using two self-organizing neural network models. Invertebrate functional groups sampled in the irrigated rice field were classified and recognized using one-dimensional self-organizing map and self-organizing competitive learning neural networks. Comparisons between neural network models, distance (similarity) measures, and number of neurons were conducted. The results showed that self-organizing map and self-organizing competitive learning neural network models were effective in pattern classification and recognition of sampling information. Overall the performance of one-dimensional self-organizing map neural network was better than self-organizing competitive learning neural network. The number of neurons could determine the number of classes in the classification. Different neural network models with various distance (similarity) measures yielded similar classifications. Some differences, dependent upon the specific network structure, would be found. The pattern of an unrecognized functional group was recognized with the self-organizing neural network. A relative consistent classification indicated that the following invertebrate functional groups, terrestrial blood sucker; terrestrial flyer; tourist (nonpredatory species with no known functional role other than as prey in ecosystem); gall former; collector (gather, deposit feeder); predator and parasitoid; leaf miner; idiobiont (acarine ectoparasitoid), were classified into the same group, and the following invertebrate functional groups, external plant feeder; terrestrial crawler, walker, jumper or hunter; neustonic (water surface) swimmer (semi-aquatic), were classified into another group. It was concluded that reliable conclusions could be drawn from comparisons of different neural network models that use different distance

Using obsidian transfer distances to explore social network maintenance in late Pleistocene hunter-gatherers.

Science.gov (United States)

Pearce, Eiluned; Moutsiou, Theodora

2014-12-01

Social behaviour is notoriously difficult to study archaeologically and it is unclear how large the networks of prehistoric humans were, or how they remained connected. Maintaining social cohesion was crucial for early humans because social networks facilitate cooperation and are imperative for survival and reproduction. Recent hunter-gatherer social organisation typically comprises a number of nested layers, ranging from the nuclear family through to the ~1500-strong ethnolinguistic tribe. Here we compare maximum obsidian transfer distances from the late Pleistocene with ethnographic data on the size of the geographic areas associated with each of these social grouping layers in recent hunter-gatherers. The closest match between the two is taken to indicate the maximum social layer within which contact could be sustained by Pleistocene hominins. Within both the (sub)tropical African and Subarctic biomes, the maximum obsidian transfer distances for Pleistocene modern humans (~200km and ~400km respectively) correspond to the geographic ranges of the outermost tribal layer in recent hunter-gatherers. This suggests that modern humans could potentially sustain the cohesion of their entire tribe at all latitudes, even though networks are more dispersed nearer the poles. Neanderthal obsidian transfer distances (300km) indicate that although Neanderthal home ranges are larger than those of low latitude hominins, Neanderthals travelled shorter distances than modern humans living at the same high latitudes. We argue that, like modern humans, Neanderthals could have maintained tribal cohesion, but that their tribes were substantially smaller than those of contemporary modern humans living in similar environments. The greater time taken to traverse the larger modern human tribal ranges may have limited the frequency of their face-to-face interactions and thus necessitated additional mechanisms to ensure network connectivity, such as the exchange of symbolic artefacts

Simple, distance-dependent formulation of the Watts-Strogatz model for directed and undirected small-world networks

Science.gov (United States)

Song, H. Francis; Wang, Xiao-Jing

2014-12-01

Small-world networks—complex networks characterized by a combination of high clustering and short path lengths—are widely studied using the paradigmatic model of Watts and Strogatz (WS). Although the WS model is already quite minimal and intuitive, we describe an alternative formulation of the WS model in terms of a distance-dependent probability of connection that further simplifies, both practically and theoretically, the generation of directed and undirected WS-type small-world networks. In addition to highlighting an essential feature of the WS model that has previously been overlooked, namely the equivalence to a simple distance-dependent model, this alternative formulation makes it possible to derive exact expressions for quantities such as the degree and motif distributions and global clustering coefficient for both directed and undirected networks in terms of model parameters.

Impact of distance on the network management capability of the home base firm

DEFF Research Database (Denmark)

Mykhaylenko, Alona; Wæhrens, Brian Vejrum; Slepniov, Dmitrij

For many globally dispersed organizations the home base (HB) is historically the locus of integrative, coordinating and innovating efforts, important for the overall performance. The growing concerns about the offshoring strategies posing threats to the capabilities of the HB draw attention to how...... a HB can continuously sustain its centrality. The well-known challenges of distance in the distributed working arrangements may be regarded as a major threat to the network management capabilities (NMCs) of the HB. Therefore, this paper investigates what role does distance between the HB and its...

Learners' Views Regarding the Use of Social Networking Sites in Distance Learning

Science.gov (United States)

Özmen, Büsra; Atici, Bünyamin

2014-01-01

In this study, it was aimed to examine the use of learning management systems supported by social networking sites in distance education and to determine the views of learners regarding these platforms. The study group of this study, which uses a qualitative research approach, consists of 15 undergraduate students who resumed their education in…

Mapping Koch curves into scale-free small-world networks

International Nuclear Information System (INIS)

Zhang Zhongzhi; Gao Shuyang; Zhou Shuigeng; Chen Lichao; Zhang Hongjuan; Guan Jihong

2010-01-01

The class of Koch fractals is one of the most interesting families of fractals, and the study of complex networks is a central issue in the scientific community. In this paper, inspired by the famous Koch fractals, we propose a mapping technique converting Koch fractals into a family of deterministic networks called Koch networks. This novel class of networks incorporates some key properties characterizing a majority of real-life networked systems-a power-law distribution with exponent in the range between 2 and 3, a high clustering coefficient, a small diameter and average path length and degree correlations. Besides, we enumerate the exact numbers of spanning trees, spanning forests and connected spanning subgraphs in the networks. All these features are obtained exactly according to the proposed generation algorithm of the networks considered. The network representation approach could be used to investigate the complexity of some real-world systems from the perspective of complex networks.

Mapping debris flow susceptibility using analytical network process ...

Indian Academy of Sciences (India)

Evangelin Ramani Sujatha

2017-11-23

Nov 23, 2017 ... methods known as the analytical network process (ANP) is used to map the ..... ciated in any prospective way, through feedbacks ..... slide susceptibility by means of multivariate statistical .... and bivariate statistics: A case study in southern Italy;. Nat. ... combination applied to Tevankarai Stream Watershed,.

Morphological self-organizing feature map neural network with applications to automatic target recognition

Science.gov (United States)

Zhang, Shijun; Jing, Zhongliang; Li, Jianxun

2005-01-01

The rotation invariant feature of the target is obtained using the multi-direction feature extraction property of the steerable filter. Combining the morphological operation top-hat transform with the self-organizing feature map neural network, the adaptive topological region is selected. Using the erosion operation, the topological region shrinkage is achieved. The steerable filter based morphological self-organizing feature map neural network is applied to automatic target recognition of binary standard patterns and real-world infrared sequence images. Compared with Hamming network and morphological shared-weight networks respectively, the higher recognition correct rate, robust adaptability, quick training, and better generalization of the proposed method are achieved.

Point-Cloud Compression for Vehicle-Based Mobile Mapping Systems Using Portable Network Graphics

Science.gov (United States)

Kohira, K.; Masuda, H.

2017-09-01

A mobile mapping system is effective for capturing dense point-clouds of roads and roadside objects Point-clouds of urban areas, residential areas, and arterial roads are useful for maintenance of infrastructure, map creation, and automatic driving. However, the data size of point-clouds measured in large areas is enormously large. A large storage capacity is required to store such point-clouds, and heavy loads will be taken on network if point-clouds are transferred through the network. Therefore, it is desirable to reduce data sizes of point-clouds without deterioration of quality. In this research, we propose a novel point-cloud compression method for vehicle-based mobile mapping systems. In our compression method, point-clouds are mapped onto 2D pixels using GPS time and the parameters of the laser scanner. Then, the images are encoded in the Portable Networking Graphics (PNG) format and compressed using the PNG algorithm. In our experiments, our method could efficiently compress point-clouds without deteriorating the quality.

POINT-CLOUD COMPRESSION FOR VEHICLE-BASED MOBILE MAPPING SYSTEMS USING PORTABLE NETWORK GRAPHICS

Directory of Open Access Journals (Sweden)

K. Kohira

2017-09-01

Full Text Available A mobile mapping system is effective for capturing dense point-clouds of roads and roadside objects．Point-clouds of urban areas, residential areas, and arterial roads are useful for maintenance of infrastructure, map creation, and automatic driving. However, the data size of point-clouds measured in large areas is enormously large. A large storage capacity is required to store such point-clouds, and heavy loads will be taken on network if point-clouds are transferred through the network. Therefore, it is desirable to reduce data sizes of point-clouds without deterioration of quality. In this research, we propose a novel point-cloud compression method for vehicle-based mobile mapping systems. In our compression method, point-clouds are mapped onto 2D pixels using GPS time and the parameters of the laser scanner. Then, the images are encoded in the Portable Networking Graphics (PNG format and compressed using the PNG algorithm. In our experiments, our method could efficiently compress point-clouds without deteriorating the quality.

Corridor One: An Integrated Distance Visualization Environment for SSI and ASCI Applications

Energy Technology Data Exchange (ETDEWEB)

Stevens, Rick [ANL, PI; Leigh, Jason [UIC, PI

2002-07-14

Scenarios describe realistic uses of DVC/Distance technologies in several years. Four scenarios are described: Distributed Decision Making; Remote Interactive Computing; Remote Visualization: (a) Remote Immersive Visualization and (b) Remote Scientific Visualization; Remote Virtual Prototyping. Scenarios serve as drivers for the road maps and enable us to check that the functionality and technology in the road maps match application needs. There are four major DVC/Distance technology areas we cover: Networking and QoS; Remote Computing; Remote Visualization; Remote Data. Each road ma consists of two parts, a functionality matrix (what can be done) and a technology matrix (underlying technology). That is, functionality matrices show the desired operational characteristics, while technology matrices show the underlying technology needed. In practice, there isn't always a clean break between functionality and technology, but it still seems useful to try and separate things this way.

Mapping the follicle-stimulating hormone-induced signalling networks

Directory of Open Access Journals (Sweden)

Pauline eGloaguen

2011-10-01

Full Text Available Follicle-stimulating hormone (FSH is a central regulator of male and female reproductive function. Over the last decade, there has been a growing perception of the complexity associated with FSH-induced cellular signalling. It is now clear that the canonical Gs/cAMP/PKA pathway is not the sole mechanism that must be considered in FSH biological actions. In parallel, consistent with the emerging concept of biased agonism, several examples of ligand-mediated selective signalling pathway activation by gonadotropin receptors have been reported. In this context, it is important to gain an integrative view of the signalling pathways induced by FSH and how they interconnect to form a network. In this review, we propose a first attempt at building topological maps of various pathways known to be involved in the FSH-induced signalling network. We discuss the multiple facets of FSH-induced signalling and how they converge to the hormone integrated biological response. Despite of their incompleteness, these maps of the FSH-induced signalling network represent a first step towards gaining a system-level comprehension of this hormone’s actions, which may ultimately facilitate the discovery of novel regulatory processes and therapeutic strategies for infertilities and non-steroidal contraception.

Characterization of Diffusion Metric Map Similarity in Data From a Clinical Data Repository Using Histogram Distances

Science.gov (United States)

Warner, Graham C.; Helmer, Karl G.

2018-01-01

As the sharing of data is mandated by funding agencies and journals, reuse of data has become more prevalent. It becomes imperative, therefore, to develop methods to characterize the similarity of data. While users can group data based on the acquisition parameters stored in the file headers, these gives no indication whether a file can be combined with other data without increasing the variance in the data set. Methods have been implemented that characterize the signal-to-noise ratio or identify signal drop-outs in the raw image files, but potential users of data often have access to calculated metric maps and these are more difficult to characterize and compare. Here we describe a histogram-distance-based method applied to diffusion metric maps of fractional anisotropy and mean diffusivity that were generated using data extracted from a repository of clinically-acquired MRI data. We describe the generation of the data set, the pitfalls specific to diffusion MRI data, and the results of the histogram distance analysis. We find that, in general, data from GE scanners are less similar than are data from Siemens scanners. We also find that the distribution of distance metric values is not Gaussian at any selection of the acquisition parameters considered here (field strength, number of gradient directions, b-value, and vendor). PMID:29568257

Low-Cost Ultrasonic Distance Sensor Arrays with Networked Error Correction

Directory of Open Access Journals (Sweden)

Tianzhou Chen

2013-09-01

Full Text Available Distance has been one of the basic factors in manufacturing and control fields, and ultrasonic distance sensors have been widely used as a low-cost measuring tool. However, the propagation of ultrasonic waves is greatly affected by environmental factors such as temperature, humidity and atmospheric pressure. In order to solve the problem of inaccurate measurement, which is significant within industry, this paper presents a novel ultrasonic distance sensor model using networked error correction (NEC trained on experimental data. This is more accurate than other existing approaches because it uses information from indirect association with neighboring sensors, which has not been considered before. The NEC technique, focusing on optimization of the relationship of the topological structure of sensor arrays, is implemented for the compensation of erroneous measurements caused by the environment. We apply the maximum likelihood method to determine the optimal fusion data set and use a neighbor discovery algorithm to identify neighbor nodes at the top speed. Furthermore, we adopt the NEC optimization algorithm, which takes full advantage of the correlation coefficients for neighbor sensors. The experimental results demonstrate that the ranging errors of the NEC system are within 2.20%; furthermore, the mean absolute percentage error is reduced to 0.01% after three iterations of this method, which means that the proposed method performs extremely well. The optimized method of distance measurement we propose, with the capability of NEC, would bring a significant advantage for intelligent industrial automation.

Computational solution to automatically map metabolite libraries in the context of genome scale metabolic networks

Directory of Open Access Journals (Sweden)

Benjamin eMerlet

2016-02-01

Full Text Available This article describes a generic programmatic method for mapping chemical compound libraries on organism-specific metabolic networks from various databases (KEGG, BioCyc and flat file formats (SBML and Matlab files. We show how this pipeline was successfully applied to decipher the coverage of chemical libraries set up by two metabolomics facilities MetaboHub (French National infrastructure for metabolomics and fluxomics and Glasgow Polyomics on the metabolic networks available in the MetExplore web server. The present generic protocol is designed to formalize and reduce the volume of information transfer between the library and the network database. Matching of metabolites between libraries and metabolic networks is based on InChIs or InChIKeys and therefore requires that these identifiers are specified in both libraries and networks.In addition to providing covering statistics, this pipeline also allows the visualization of mapping results in the context of metabolic networks.In order to achieve this goal we tackled issues on programmatic interaction between two servers, improvement of metabolite annotation in metabolic networks and automatic loading of a mapping in genome scale metabolic network analysis tool MetExplore. It is important to note that this mapping can also be performed on a single or a selection of organisms of interest and is thus not limited to large facilities.

Triadic Closure in Core Networks : Disentangling the Effects of Social Distance, National Origin Similarity and Shared Contexts

NARCIS (Netherlands)

Mollenhorst, Gerald|info:eu-repo/dai/nl/304835153; Van Duijn, Marijtje; Rydgren, Jens; Edling, Christofer

2016-01-01

Acknowledging that the composition and structure of personal networks is affected by meeting opportunities, social distance, and national origin similarity, we aim to disentangle their association with triadic closure in the core of personal networks. We use data (collected 2009) on the core

Triadic closure in core networks: Disentangling the effects of social distance, natoinal origin similarity and shared contexts

NARCIS (Netherlands)

Mollenhorst, Gerald; van Duijn, Maria; Rydgren, Jens; Edling, Christopher

2016-01-01

Acknowledging that the composition and structure of personal networks is affected by meeting opportunities, social distance, and national origin similarity, we aim to disentangle their association with triadic closure in the core of personal networks. We use data (collected 2009) on the core

Mapping the geography of science: distribution patterns and networks of relations among cities and institutes

NARCIS (Netherlands)

Leydesdorff, L.; Persson, O.

2010-01-01

Using Google Earth, Google Maps, and/or network visualization programs such as Pajek, one can overlay the network of relations among addresses in scientific publications onto the geographic map. The authors discuss the pros and cons of various options, and provide software (freeware) for bridging

How does language distance between L1 and L2 affect the L2 brain network? An fMRI study of Korean-Chinese-English trilinguals.

Science.gov (United States)

Kim, Say Young; Qi, Ting; Feng, Xiaoxia; Ding, Guosheng; Liu, Li; Cao, Fan

2016-04-01

The present study tested the hypothesis that language distance between first language (L1) and second language (L2) influences the assimilation and accommodation pattern in Korean-Chinese-English trilinguals. The distance between English and Korean is smaller than that between Chinese and Korean in terms of orthographic transparency, because both English and Korean are alphabetic, whereas Chinese is logographic. During fMRI, Korean trilingual participants performed a visual rhyming judgment task in three languages (Korean: KK, Chinese: KC, English: KE). Two L1 control groups were native Chinese and English speakers performing the task in their native languages (CC and EE, respectively). The general pattern of brain activation of KC was more similar to that of CC than KK, suggesting accommodation. Higher accuracy in KC was associated with decreased activation in regions of the KK network, suggesting reduced assimilation. In contrast, the brain activation of KE was more similar to that of KK than EE, suggesting assimilation. Higher accuracy in KE was associated with decreased activation in regions of the EE network, suggesting reduced accommodation. Finally, an ROI analysis on the left middle frontal gyrus revealed greater activation for KC than for KE, suggesting its selective involvement in the L2 with more arbitrary mapping between orthography and phonology (i.e., Chinese). Taken together, the brain network involved in L2 reading is similar to the L1 network when L2 and L1 are similar in orthographic transparency, while significant accommodation is expected when L2 is more opaque than L1. Copyright © 2015. Published by Elsevier Inc.

Mapping the temporary and perennial character of whole river networks

Science.gov (United States)

González-Ferreras, A. M.; Barquín, J.

2017-08-01

Knowledge of the spatial distribution of temporary and perennial river channels in a whole catchment is important for effective integrated basin management and river biodiversity conservation. However, this information is usually not available or is incomplete. In this study, we present a statistically based methodology to classify river segments from a whole river network (Deva-Cares catchment, Northern Spain) as temporary or perennial. This method is based on an a priori classification of a subset of river segments as temporary or perennial, using field surveys and aerial images, and then running Random Forest models to predict classification membership for the rest of the river network. The independent variables and the river network were derived following a computer-based geospatial simulation of riverine landscapes. The model results show high values of overall accuracy, sensitivity, and specificity for the evaluation of the fitted model to the training and testing data set (≥0.9). The most important independent variables were catchment area, area occupied by broadleaf forest, minimum monthly precipitation in August, and average catchment elevation. The final map shows 7525 temporary river segments (1012.5 km) and 3731 perennial river segments (662.5 km). A subsequent validation of the mapping results using River Habitat Survey data and expert knowledge supported the validity of the proposed maps. We conclude that the proposed methodology is a valid method for mapping the limits of flow permanence that could substantially increase our understanding of the spatial links between terrestrial and aquatic interfaces, improving the research, management, and conservation of river biodiversity and functioning.

Recasting Distance Learning with Network-Enabled Open Education: An Interview with Vijay Kumar

Science.gov (United States)

Morrison, James L.; Kumar, Vijay

2008-01-01

In an interview with James Morrison, "Innovate's" editor-in-chief, Vijay Kumar describes how rethinking distance learning as network-enabled open education can catalyze a whole new set of learning opportunities. The growing open-education movement has made an increasing number and variety of resources freely available online, including everything…

MapReduce Based Parallel Neural Networks in Enabling Large Scale Machine Learning.

Science.gov (United States)

Liu, Yang; Yang, Jie; Huang, Yuan; Xu, Lixiong; Li, Siguang; Qi, Man

2015-01-01

Artificial neural networks (ANNs) have been widely used in pattern recognition and classification applications. However, ANNs are notably slow in computation especially when the size of data is large. Nowadays, big data has received a momentum from both industry and academia. To fulfill the potentials of ANNs for big data applications, the computation process must be speeded up. For this purpose, this paper parallelizes neural networks based on MapReduce, which has become a major computing model to facilitate data intensive applications. Three data intensive scenarios are considered in the parallelization process in terms of the volume of classification data, the size of the training data, and the number of neurons in the neural network. The performance of the parallelized neural networks is evaluated in an experimental MapReduce computer cluster from the aspects of accuracy in classification and efficiency in computation.

Hop-distance relationship analysis with quasi-UDG model for node localization in wireless sensor networks

Directory of Open Access Journals (Sweden)

Chen Ping

2011-01-01

Full Text Available Abstract In wireless sensor networks (WSNs, location information plays an important role in many fundamental services which includes geographic routing, target tracking, location-based coverage, topology control, and others. One promising approach in sensor network localization is the determination of location based on hop counts. A critical priori of this approach that directly influences the accuracy of location estimation is the hop-distance relationship. However, most of the related works on the hop-distance relationship assume the unit-disk graph (UDG model that is unrealistic in a practical scenario. In this paper, we formulate the hop-distance relationship for quasi-UDG model in WSNs where sensor nodes are randomly and independently deployed in a circular region based on a Poisson point process. Different from the UDG model, quasi-UDG model has the non-uniformity property for connectivity. We derive an approximated recursive expression for the probability of the hop count with a given geographic distance. The border effect and dependence problem are also taken into consideration. Furthermore, we give the expressions describing the distribution of distance with known hop counts for inner nodes and those suffered from the border effect where we discover the insignificance of the border effect. The analytical results are validated by simulations showing the accuracy of the employed approximation. Besides, we demonstrate the localization application of the formulated relationship and show the accuracy improvement in the WSN localization.

Mapping industrial systems - a supply network perspective on enabling technologies, processes and actors

OpenAIRE

Srai, Jagjit Singh

2016-01-01

This is the author accepted manuscript. The final version is available from InderScience Publishers via http://dx.doi.org/10.1504/IJMTM.2017.10002927 This paper develops a multi-layered multi-stage mapping approach to explore the characteristics of emerging industry supply networks (EI SNs), and how enabling production technologies and supply chain processes are supported by institutional, industrial and supply network actors. The mapping methodology involves the systematic capture of mate...

Density and diversity of OpenStreetMap road networks in China

Directory of Open Access Journals (Sweden)

Yingjia Zhang

2015-12-01

Full Text Available OpenStreetMap is a geographic information platform designed to provide real-time updates and user-generated content related to its freely available global map, and it is one of the most widely used examples of volunteered geographic information, a technique associated with so-called neogeography. This paper, based on the data from China’s OpenStreetMap road network in May 2014, taking 340 prefecture-level cities in China as its study area, presents the geometric-related (road density and attribute-related (type diversity spatial patterns of the OpenStreetMap road network, and explores their relationship. The results are as follows. (1 The distribution of OpenStreetMap road density in Shenzhen, Shanghai, Hong Kong, and Macao predominantly obeys a “positive skewness distribution”. OpenStreetMap data for eastern China shows a higher overall and circular structure. In central China, there are noticeable discrepancies in the road density, whereas in western China, the road density is low. (2 The OpenStreetMap road diversity shows a normal distribution. The spatial pattern for the so-called “Hu Huanyong line” was broken by the effect of diplomatic and strategic factors, showing a high diversity along the peripheral border, coastal cities, and core inland cites. (3 China’s OpenStreetMap is partitioned into four parts according to road density and diversity: high density and high diversity; low density and low diversity; high density and low diversity; and low density high diversity. (4 The OpenStreetMap geographical information-collection process and mechanism were analyzed, demonstrating that the road density reflects the preponderance of traffic in the real world. OpenStreetMap road diversity reflects the road-related geographic information demand and value, and it also reflects the interests of users toward to OpenStreetMap geographical information.

Physical Proximity and Spreading in Dynamic Social Networks

OpenAIRE

Stopczynski, Arkadiusz; Pentland, Alex Sandy; Lehmann, Sune

2015-01-01

Most infectious diseases spread on a dynamic network of human interactions. Recent studies of social dynamics have provided evidence that spreading patterns may depend strongly on detailed micro-dynamics of the social system. We have recorded every single interaction within a large population, mapping out---for the first time at scale---the complete proximity network for a densely-connected system. Here we show the striking impact of interaction-distance on the network structure and dynamics ...

Mapping human whole-brain structural networks with diffusion MRI.

Directory of Open Access Journals (Sweden)

Patric Hagmann

Full Text Available Understanding the large-scale structural network formed by neurons is a major challenge in system neuroscience. A detailed connectivity map covering the entire brain would therefore be of great value. Based on diffusion MRI, we propose an efficient methodology to generate large, comprehensive and individual white matter connectional datasets of the living or dead, human or animal brain. This non-invasive tool enables us to study the basic and potentially complex network properties of the entire brain. For two human subjects we find that their individual brain networks have an exponential node degree distribution and that their global organization is in the form of a small world.

Renewal of Road Networks Using Map-matching Technique of Trajectories

Directory of Open Access Journals (Sweden)

WU Tao

2017-04-01

Full Text Available The road network with complete and accurate information, as one of the key foundations of Smart City, bears significance in fields like urban planning, traffic managing and public traveling, et al. However, long manufacturing period of road network data, based on traditional surveying methods, often leaves it in an inconsistent state with the latest situation. Recently, positioning techniques ubiquitously used in mobile devices has been gradually coming into focus for domestic and overseas scholars. Currently, most of approaches, generating or updating road networks from mobile location information, are to compute with GPS trajectory data directly by various algorithms, which lead to expensive consumption of computational resources in case of mass GPS data covering large-scale areas. For this reason, we propose a spiral update strategy of road network data based on map-matching technology, which follows a “identify→analyze→extract→update” process. The main idea is to detect condemned road segments of existing road network data with the help of HMM for each trajectory input, as well as repair them, on the local scale, by extracting new road information from trajectory data.The proposed approach avoids computing on the entire dataset of trajectory data for road segments. Instead, it updates information of existing road network data by means of focalizing on the minimum range of potential condemned segments. We evaluated the performance of our proposals using GPS traces collected on taxies and OpenStreetMap(OSM road networks covering urban areas of Wuhan City.

Chimera states in networks of logistic maps with hierarchical connectivities

Science.gov (United States)

zur Bonsen, Alexander; Omelchenko, Iryna; Zakharova, Anna; Schöll, Eckehard

2018-04-01

Chimera states are complex spatiotemporal patterns consisting of coexisting domains of coherence and incoherence. We study networks of nonlocally coupled logistic maps and analyze systematically how the dilution of the network links influences the appearance of chimera patterns. The network connectivities are constructed using an iterative Cantor algorithm to generate fractal (hierarchical) connectivities. Increasing the hierarchical level of iteration, we compare the resulting spatiotemporal patterns. We demonstrate that a high clustering coefficient and symmetry of the base pattern promotes chimera states, and asymmetric connectivities result in complex nested chimera patterns.

MapReduce Based Parallel Neural Networks in Enabling Large Scale Machine Learning

Directory of Open Access Journals (Sweden)

Yang Liu

2015-01-01

Full Text Available Artificial neural networks (ANNs have been widely used in pattern recognition and classification applications. However, ANNs are notably slow in computation especially when the size of data is large. Nowadays, big data has received a momentum from both industry and academia. To fulfill the potentials of ANNs for big data applications, the computation process must be speeded up. For this purpose, this paper parallelizes neural networks based on MapReduce, which has become a major computing model to facilitate data intensive applications. Three data intensive scenarios are considered in the parallelization process in terms of the volume of classification data, the size of the training data, and the number of neurons in the neural network. The performance of the parallelized neural networks is evaluated in an experimental MapReduce computer cluster from the aspects of accuracy in classification and efficiency in computation.

Multivariate correlation analysis technique based on euclidean distance map for network traffic characterization

NARCIS (Netherlands)

Tan, Zhiyuan; Jamdagni, Aruna; He, Xiangjian; Nanda, Priyadarsi; Liu, Ren Ping; Qing, Sihan; Susilo, Willy; Wang, Guilin; Liu, Dongmei

2011-01-01

The quality of feature has significant impact on the performance of detection techniques used for Denial-of-Service (DoS) attack. The features that fail to provide accurate characterization for network traffic records make the techniques suffer from low accuracy in detection. Although researches

Robust spatial memory maps in flickering neuronal networks: a topological model

Science.gov (United States)

Dabaghian, Yuri; Babichev, Andrey; Memoli, Facundo; Chowdhury, Samir; Rice University Collaboration; Ohio State University Collaboration

It is widely accepted that the hippocampal place cells provide a substrate of the neuronal representation of the environment--the ``cognitive map''. However, hippocampal network, as any other network in the brain is transient: thousands of hippocampal neurons die every day and the connections formed by these cells constantly change due to various forms of synaptic plasticity. What then explains the remarkable reliability of our spatial memories? We propose a computational approach to answering this question based on a couple of insights. First, we propose that the hippocampal cognitive map is fundamentally topological, and hence it is amenable to analysis by topological methods. We then apply several novel methods from homology theory, to understand how dynamic connections between cells influences the speed and reliability of spatial learning. We simulate the rat's exploratory movements through different environments and study how topological invariants of these environments arise in a network of simulated neurons with ``flickering'' connectivity. We find that despite transient connectivity the network of place cells produces a stable representation of the topology of the environment.

Terrain Mapping and Classification in Outdoor Environments Using Neural Networks

OpenAIRE

Alberto Yukinobu Hata; Denis Fernando Wolf; Gustavo Pessin; Fernando Osório

2009-01-01

This paper describes a three-dimensional terrain mapping and classification technique to allow the operation of mobile robots in outdoor environments using laser range finders. We propose the use of a multi-layer perceptron neural network to classify the terrain into navigable, partially navigable, and non-navigable. The maps generated by our approach can be used for path planning, navigation, and local obstacle avoidance. Experimental tests using an outdoor robot and a laser sensor demonstra...

Neural network representation and learning of mappings and their derivatives

Science.gov (United States)

White, Halbert; Hornik, Kurt; Stinchcombe, Maxwell; Gallant, A. Ronald

1991-01-01

Discussed here are recent theorems proving that artificial neural networks are capable of approximating an arbitrary mapping and its derivatives as accurately as desired. This fact forms the basis for further results establishing the learnability of the desired approximations, using results from non-parametric statistics. These results have potential applications in robotics, chaotic dynamics, control, and sensitivity analysis. An example involving learning the transfer function and its derivatives for a chaotic map is discussed.

Use of Tabu Search in a Solver to Map Complex Networks onto Emulab Testbeds

National Research Council Canada - National Science Library

MacDonald, Jason E

2007-01-01

The University of Utah's solver for the testbed mapping problem uses a simulated annealing metaheuristic algorithm to map a researcher's experimental network topology onto available testbed resources...

A Computational Solution to Automatically Map Metabolite Libraries in the Context of Genome Scale Metabolic Networks.

Science.gov (United States)

Merlet, Benjamin; Paulhe, Nils; Vinson, Florence; Frainay, Clément; Chazalviel, Maxime; Poupin, Nathalie; Gloaguen, Yoann; Giacomoni, Franck; Jourdan, Fabien

2016-01-01

This article describes a generic programmatic method for mapping chemical compound libraries on organism-specific metabolic networks from various databases (KEGG, BioCyc) and flat file formats (SBML and Matlab files). We show how this pipeline was successfully applied to decipher the coverage of chemical libraries set up by two metabolomics facilities MetaboHub (French National infrastructure for metabolomics and fluxomics) and Glasgow Polyomics (GP) on the metabolic networks available in the MetExplore web server. The present generic protocol is designed to formalize and reduce the volume of information transfer between the library and the network database. Matching of metabolites between libraries and metabolic networks is based on InChIs or InChIKeys and therefore requires that these identifiers are specified in both libraries and networks. In addition to providing covering statistics, this pipeline also allows the visualization of mapping results in the context of metabolic networks. In order to achieve this goal, we tackled issues on programmatic interaction between two servers, improvement of metabolite annotation in metabolic networks and automatic loading of a mapping in genome scale metabolic network analysis tool MetExplore. It is important to note that this mapping can also be performed on a single or a selection of organisms of interest and is thus not limited to large facilities.

A Selfish Constraint Satisfaction Genetic Algorithms for Planning a Long-Distance Transportation Network

Science.gov (United States)

Onoyama, Takashi; Maekawa, Takuya; Kubota, Sen; Tsuruta, Setuso; Komoda, Norihisa

To build a cooperative logistics network covering multiple enterprises, a planning method that can build a long-distance transportation network is required. Many strict constraints are imposed on this type of problem. To solve these strict-constraint problems, a selfish constraint satisfaction genetic algorithm (GA) is proposed. In this GA, each gene of an individual satisfies only its constraint selfishly, disregarding the constraints of other genes in the same individuals. Moreover, a constraint pre-checking method is also applied to improve the GA convergence speed. The experimental result shows the proposed method can obtain an accurate solution in a practical response time.

Semiparametric Allelic Tests for Mapping Multiple Phenotypes: Binomial Regression and Mahalanobis Distance.

Science.gov (United States)

Majumdar, Arunabha; Witte, John S; Ghosh, Saurabh

2015-12-01

Binary phenotypes commonly arise due to multiple underlying quantitative precursors and genetic variants may impact multiple traits in a pleiotropic manner. Hence, simultaneously analyzing such correlated traits may be more powerful than analyzing individual traits. Various genotype-level methods, e.g., MultiPhen (O'Reilly et al. []), have been developed to identify genetic factors underlying a multivariate phenotype. For univariate phenotypes, the usefulness and applicability of allele-level tests have been investigated. The test of allele frequency difference among cases and controls is commonly used for mapping case-control association. However, allelic methods for multivariate association mapping have not been studied much. In this article, we explore two allelic tests of multivariate association: one using a Binomial regression model based on inverted regression of genotype on phenotype (Binomial regression-based Association of Multivariate Phenotypes [BAMP]), and the other employing the Mahalanobis distance between two sample means of the multivariate phenotype vector for two alleles at a single-nucleotide polymorphism (Distance-based Association of Multivariate Phenotypes [DAMP]). These methods can incorporate both discrete and continuous phenotypes. Some theoretical properties for BAMP are studied. Using simulations, the power of the methods for detecting multivariate association is compared with the genotype-level test MultiPhen's. The allelic tests yield marginally higher power than MultiPhen for multivariate phenotypes. For one/two binary traits under recessive mode of inheritance, allelic tests are found to be substantially more powerful. All three tests are applied to two different real data and the results offer some support for the simulation study. We propose a hybrid approach for testing multivariate association that implements MultiPhen when Hardy-Weinberg Equilibrium (HWE) is violated and BAMP otherwise, because the allelic approaches assume HWE

Mapping and modeling of physician collaboration network.

Science.gov (United States)

Uddin, Shahadat; Hamra, Jafar; Hossain, Liaquat

2013-09-10

Effective provisioning of healthcare services during patient hospitalization requires collaboration involving a set of interdependent complex tasks, which needs to be carried out in a synergistic manner. Improved patients' outcome during and after hospitalization has been attributed to how effective different health services provisioning groups carry out their tasks in a coordinated manner. Previous studies have documented the underlying relationships between collaboration among physicians on the effective outcome in delivering health services for improved patient outcomes. However, there are very few systematic empirical studies with a focus on the effect of collaboration networks among healthcare professionals and patients' medical condition. On the basis of the fact that collaboration evolves among physicians when they visit a common hospitalized patient, in this study, we first propose an approach to map collaboration network among physicians from their visiting information to patients. We termed this network as physician collaboration network (PCN). Then, we use exponential random graph (ERG) models to explore the microlevel network structures of PCNs and their impact on hospitalization cost and hospital readmission rate. ERG models are probabilistic models that are presented by locally determined explanatory variables and can effectively identify structural properties of networks such as PCN. It simplifies a complex structure down to a combination of basic parameters such as 2-star, 3-star, and triangle. By applying our proposed mapping approach and ERG modeling technique to the electronic health insurance claims dataset of a very large Australian health insurance organization, we construct and model PCNs. We notice that the 2-star (subset of 3 nodes in which 1 node is connected to each of the other 2 nodes) parameter of ERG has significant impact on hospitalization cost. Further, we identify that triangle (subset of 3 nodes in which each node is connected to

MapReduce Based Parallel Bayesian Network for Manufacturing Quality Control

Science.gov (United States)

Zheng, Mao-Kuan; Ming, Xin-Guo; Zhang, Xian-Yu; Li, Guo-Ming

2017-09-01

Increasing complexity of industrial products and manufacturing processes have challenged conventional statistics based quality management approaches in the circumstances of dynamic production. A Bayesian network and big data analytics integrated approach for manufacturing process quality analysis and control is proposed. Based on Hadoop distributed architecture and MapReduce parallel computing model, big volume and variety quality related data generated during the manufacturing process could be dealt with. Artificial intelligent algorithms, including Bayesian network learning, classification and reasoning, are embedded into the Reduce process. Relying on the ability of the Bayesian network in dealing with dynamic and uncertain problem and the parallel computing power of MapReduce, Bayesian network of impact factors on quality are built based on prior probability distribution and modified with posterior probability distribution. A case study on hull segment manufacturing precision management for ship and offshore platform building shows that computing speed accelerates almost directly proportionally to the increase of computing nodes. It is also proved that the proposed model is feasible for locating and reasoning of root causes, forecasting of manufacturing outcome, and intelligent decision for precision problem solving. The integration of bigdata analytics and BN method offers a whole new perspective in manufacturing quality control.

Road network selection for small-scale maps using an improved centrality-based algorithm

Directory of Open Access Journals (Sweden)

Roy Weiss

2014-12-01

Full Text Available The road network is one of the key feature classes in topographic maps and databases. In the task of deriving road networks for products at smaller scales, road network selection forms a prerequisite for all other generalization operators, and is thus a fundamental operation in the overall process of topographic map and database production. The objective of this work was to develop an algorithm for automated road network selection from a large-scale (1:10,000 to a small-scale database (1:200,000. The project was pursued in collaboration with swisstopo, the national mapping agency of Switzerland, with generic mapping requirements in mind. Preliminary experiments suggested that a selection algorithm based on betweenness centrality performed best for this purpose, yet also exposed problems. The main contribution of this paper thus consists of four extensions that address deficiencies of the basic centrality-based algorithm and lead to a significant improvement of the results. The first two extensions improve the formation of strokes concatenating the road segments, which is crucial since strokes provide the foundation upon which the network centrality measure is computed. Thus, the first extension ensures that roundabouts are detected and collapsed, thus avoiding interruptions of strokes by roundabouts, while the second introduces additional semantics in the process of stroke formation, allowing longer and more plausible strokes to built. The third extension detects areas of high road density (i.e., urban areas using density-based clustering and then locally increases the threshold of the centrality measure used to select road segments, such that more thinning takes place in those areas. Finally, since the basic algorithm tends to create dead-ends—which however are not tolerated in small-scale maps—the fourth extension reconnects these dead-ends to the main network, searching for the best path in the main heading of the dead-end.

Identification of illicit drugs by using SOM neural networks

Energy Technology Data Exchange (ETDEWEB)

Liang Meiyan; Shen Jingling; Wang Guangqin [Beijing Key Lab for Terahertz Spectroscopy and Imaging, Key Laboratory of Terahertz Optoelectronics, Ministry of Education, Department of Physics, Capital Normal University, Beijing 100037 (China)], E-mail: liangyan661982@163.com, E-mail: jinglingshen@gmail.com, E-mail: pywgq2004@163.com

2008-07-07

Absorption spectra of six illicit drugs were measured by using the terahertz time-domain spectroscopy technique in the range 0.2-2.6 THz and then clustered with self-organization feature map (SOM) artificial neural network. After the network training process, the spectra collected at another time were identified successfully by the well-trained SOM network. An effective distance was introduced as a quantitative criterion to decide which cluster the new spectra were affiliated with.

Identification of illicit drugs by using SOM neural networks

International Nuclear Information System (INIS)

Liang Meiyan; Shen Jingling; Wang Guangqin

2008-01-01

Absorption spectra of six illicit drugs were measured by using the terahertz time-domain spectroscopy technique in the range 0.2-2.6 THz and then clustered with self-organization feature map (SOM) artificial neural network. After the network training process, the spectra collected at another time were identified successfully by the well-trained SOM network. An effective distance was introduced as a quantitative criterion to decide which cluster the new spectra were affiliated with

Fluence map optimization (FMO) with dose–volume constraints in IMRT using the geometric distance sorting method

International Nuclear Information System (INIS)

Lan Yihua; Li Cunhua; Ren Haozheng; Zhang Yong; Min Zhifang

2012-01-01

A new heuristic algorithm based on the so-called geometric distance sorting technique is proposed for solving the fluence map optimization with dose–volume constraints which is one of the most essential tasks for inverse planning in IMRT. The framework of the proposed method is basically an iterative process which begins with a simple linear constrained quadratic optimization model without considering any dose–volume constraints, and then the dose constraints for the voxels violating the dose–volume constraints are gradually added into the quadratic optimization model step by step until all the dose–volume constraints are satisfied. In each iteration step, an interior point method is adopted to solve each new linear constrained quadratic programming. For choosing the proper candidate voxels for the current dose constraint adding, a so-called geometric distance defined in the transformed standard quadratic form of the fluence map optimization model was used to guide the selection of the voxels. The new geometric distance sorting technique can mostly reduce the unexpected increase of the objective function value caused inevitably by the constraint adding. It can be regarded as an upgrading to the traditional dose sorting technique. The geometry explanation for the proposed method is also given and a proposition is proved to support our heuristic idea. In addition, a smart constraint adding/deleting strategy is designed to ensure a stable iteration convergence. The new algorithm is tested on four cases including head–neck, a prostate, a lung and an oropharyngeal, and compared with the algorithm based on the traditional dose sorting technique. Experimental results showed that the proposed method is more suitable for guiding the selection of new constraints than the traditional dose sorting method, especially for the cases whose target regions are in non-convex shapes. It is a more efficient optimization technique to some extent for choosing constraints than

Fluence map optimization (FMO) with dose-volume constraints in IMRT using the geometric distance sorting method.

Science.gov (United States)

Lan, Yihua; Li, Cunhua; Ren, Haozheng; Zhang, Yong; Min, Zhifang

2012-10-21

A new heuristic algorithm based on the so-called geometric distance sorting technique is proposed for solving the fluence map optimization with dose-volume constraints which is one of the most essential tasks for inverse planning in IMRT. The framework of the proposed method is basically an iterative process which begins with a simple linear constrained quadratic optimization model without considering any dose-volume constraints, and then the dose constraints for the voxels violating the dose-volume constraints are gradually added into the quadratic optimization model step by step until all the dose-volume constraints are satisfied. In each iteration step, an interior point method is adopted to solve each new linear constrained quadratic programming. For choosing the proper candidate voxels for the current dose constraint adding, a so-called geometric distance defined in the transformed standard quadratic form of the fluence map optimization model was used to guide the selection of the voxels. The new geometric distance sorting technique can mostly reduce the unexpected increase of the objective function value caused inevitably by the constraint adding. It can be regarded as an upgrading to the traditional dose sorting technique. The geometry explanation for the proposed method is also given and a proposition is proved to support our heuristic idea. In addition, a smart constraint adding/deleting strategy is designed to ensure a stable iteration convergence. The new algorithm is tested on four cases including head-neck, a prostate, a lung and an oropharyngeal, and compared with the algorithm based on the traditional dose sorting technique. Experimental results showed that the proposed method is more suitable for guiding the selection of new constraints than the traditional dose sorting method, especially for the cases whose target regions are in non-convex shapes. It is a more efficient optimization technique to some extent for choosing constraints than the dose

Hyperbolic mapping of complex networks based on community information

Science.gov (United States)

Wang, Zuxi; Li, Qingguang; Jin, Fengdong; Xiong, Wei; Wu, Yao

2016-08-01

To improve the hyperbolic mapping methods both in terms of accuracy and running time, a novel mapping method called Community and Hyperbolic Mapping (CHM) is proposed based on community information in this paper. Firstly, an index called Community Intimacy (CI) is presented to measure the adjacency relationship between the communities, based on which a community ordering algorithm is introduced. According to the proposed Community-Sector hypothesis, which supposes that most nodes of one community gather in a same sector in hyperbolic space, CHM maps the ordered communities into hyperbolic space, and then the angular coordinates of nodes are randomly initialized within the sector that they belong to. Therefore, all the network nodes are so far mapped to hyperbolic space, and then the initialized angular coordinates can be optimized by employing the information of all nodes, which can greatly improve the algorithm precision. By applying the proposed dual-layer angle sampling method in the optimization procedure, CHM reduces the time complexity to O(n2) . The experiments show that our algorithm outperforms the state-of-the-art methods.

Alteration of long-distance functional connectivity and network topology in patients with supratentorial gliomas

Energy Technology Data Exchange (ETDEWEB)

Park, Ji Eun; Kim, Ho Sung; Kim, Sang Joon; Shim, Woo Hyun [University of Ulsan College of Medicine, Department of Radiology and Research Institute of Radiology, Asan Medical Center, Songpa-Gu, Seoul (Korea, Republic of); Kim, Jeong Hoon [University of Ulsan College of Medicine, Department of Neurosurgery, Asan Medical Center, Seoul (Korea, Republic of)

2016-03-15

The need for information regarding functional alterations in patients with brain gliomas is increasing, but little is known about the functional consequences of focal brain tumors throughout the entire brain. Using resting-state functional MR imaging (rs-fMRI), this study assessed functional connectivity in patients with supratentorial brain gliomas with possible alterations in long-distance connectivity and network topology. Data from 36 patients with supratentorial brain gliomas and 12 healthy subjects were acquired using rs-fMRI. The functional connectivity matrix (FCM) was created using 32 pairs of cortical seeds on Talairach coordinates in each individual subject. Local and distant connectivity were calculated using z-scores in the individual patient's FCM, and the averaged FCM of patients was compared with that of healthy subjects. Weighted network analysis was performed by calculating local efficiency, global efficiency, clustering coefficient, and small-world topology, and compared between patients and healthy controls. When comparing the averaged FCM of patients with that of healthy controls, the patients showed decreased long-distance, inter-hemispheric connectivity (0.32 ± 0.16 in patients vs. 0. 42 ± 0.15 in healthy controls, p = 0.04). In network analysis, patients showed increased local efficiency (p < 0.05), but global efficiency, clustering coefficient, and small-world topology were relatively preserved compared to healthy subjects. Patients with supratentorial brain gliomas showed decreased long-distance connectivity while increased local efficiency and preserved small-world topology. The results of this small case series may provide a better understanding of the alterations of functional connectivity in patients with brain gliomas across the whole brain scale. (orig.)

International Trade Modelling Using Open Flow Networks: A Flow-Distance Based Analysis.

Science.gov (United States)

Shen, Bin; Zhang, Jiang; Li, Yixiao; Zheng, Qiuhua; Li, Xingsen

2015-01-01

This paper models and analyzes international trade flows using open flow networks (OFNs) with the approaches of flow distances, which provide a novel perspective and effective tools for the study of international trade. We discuss the establishment of OFNs of international trade from two coupled viewpoints: the viewpoint of trading commodity flow and that of money flow. Based on the novel model with flow distance approaches, meaningful insights are gained. First, by introducing the concepts of trade trophic levels and niches, countries' roles and positions in the global supply chains (or value-added chains) can be evaluated quantitatively. We find that the distributions of trading "trophic levels" have the similar clustering pattern for different types of commodities, and summarize some regularities between money flow and commodity flow viewpoints. Second, we find that active and competitive countries trade a wide spectrum of products, while inactive and underdeveloped countries trade a limited variety of products. Besides, some abnormal countries import many types of goods, which the vast majority of countries do not need to import. Third, harmonic node centrality is proposed and we find the phenomenon of centrality stratification. All the results illustrate the usefulness of the model of OFNs with its network approaches for investigating international trade flows.

Empirical evidence of the effectiveness of concept mapping as a learning intervention for nuclear medicine technology students in a distance learning radiation protection and biology course.

Science.gov (United States)

Passmore, Gregory G; Owen, Mary Anne; Prabakaran, Krishnan

2011-12-01

Metacognitive learning strategies are based on instructional learning theory, which promotes deep, meaningful learning. Educators in a baccalaureate-level nuclear medicine technology program demonstrated that students enrolled in an online, distance learning section of an introductory radiation protection and radiobiology course performed better when traditional instruction was supplemented with nontraditional metacognitive learning strategies. The metacognitive learning strategy that was used is best known as concept mapping. The concept map, in addition to the standard homework problem assignment and opportunity for question-answer sessions, became the template for misconception identification and remediation interactions between the instructor and the student. The control group relied on traditional homework problems and question-answer sessions alone. Because students in both the "treatment" groups (i.e., students who used concept mapping) and the control group were distance learning students, all personal communications were conducted via e-mail or telephone. The final examination of the course was used to facilitate a quantitative comparison of the performance of students who used concept mapping and the performance of students who did not use concept mapping. The results demonstrated a significantly higher median final examination score for the concept mapping group than for the non-concept mapping group (z = -2.0381, P = 0.0415), with an appropriately large effect size (2.65). Concept mapping is a cognitive learning intervention that effectively enables meaningful learning and is suitable for use in the independent learner-oriented distance learning environments used by some nuclear medicine technology programs.

MSD-MAP: A Network-Based Systems Biology Platform for Predicting Disease-Metabolite Links.

Science.gov (United States)

Wathieu, Henri; Issa, Naiem T; Mohandoss, Manisha; Byers, Stephen W; Dakshanamurthy, Sivanesan

2017-01-01

Cancer-associated metabolites result from cell-wide mechanisms of dysregulation. The field of metabolomics has sought to identify these aberrant metabolites as disease biomarkers, clues to understanding disease mechanisms, or even as therapeutic agents. This study was undertaken to reliably predict metabolites associated with colorectal, esophageal, and prostate cancers. Metabolite and disease biological action networks were compared in a computational platform called MSD-MAP (Multi Scale Disease-Metabolite Association Platform). Using differential gene expression analysis with patient-based RNAseq data from The Cancer Genome Atlas, genes up- or down-regulated in cancer compared to normal tissue were identified. Relational databases were used to map biological entities including pathways, functions, and interacting proteins, to those differential disease genes. Similar relational maps were built for metabolites, stemming from known and in silico predicted metabolite-protein associations. The hypergeometric test was used to find statistically significant relationships between disease and metabolite biological signatures at each tier, and metabolites were assessed for multi-scale association with each cancer. Metabolite networks were also directly associated with various other diseases using a disease functional perturbation database. Our platform recapitulated metabolite-disease links that have been empirically verified in the scientific literature, with network-based mapping of jointly-associated biological activity also matching known disease mechanisms. This was true for colorectal, esophageal, and prostate cancers, using metabolite action networks stemming from both predicted and known functional protein associations. By employing systems biology concepts, MSD-MAP reliably predicted known cancermetabolite links, and may serve as a predictive tool to streamline conventional metabolomic profiling methodologies. Copyright© Bentham Science Publishers; For any

Ecological systems as computer networks: Long distance sea dispersal as a communication medium between island plant populations.

Science.gov (United States)

Sanaa, Adnen; Ben Abid, Samir; Boulila, Abdennacer; Messaoud, Chokri; Boussaid, Mohamed; Ben Fadhel, Najeh

2016-06-01

Ecological systems are known to exchange genetic material through animal species migration and seed dispersal for plants. Isolated plant populations have developed long distance dispersal as a means of propagation which rely on meteorological such as anemochory and hydrochory for coast, island and river bank dwelling species. Long distance dispersal by water, in particular, in the case of water current bound islands, calls for the analogy with computer networks, where each island and nearby mainland site plays the role of a network node, the water currents play the role of a transmission channel, and water borne seeds as data packets. In this paper we explore this analogy to model long distance dispersal of seeds among island and mainland populations, when traversed with water currents, in order to model and predict their future genetic diversity. The case of Pancratium maritimum L. populations in Tunisia is used as a proof of concept, where their genetic diversity is extrapolated. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

Reducing Communication Overhead by Scheduling TCP Transfers on Mobile Devices using Wireless Network Performance Maps

DEFF Research Database (Denmark)

Højgaard-Hansen, Kim; Madsen, Tatiana Kozlova; Schwefel, Hans-Peter

2012-01-01

The performance of wireless communication networks has been shown to have a strong location dependence. Measuring the performance while having accurate location information available makes it possible to generate performance maps. In this paper we propose a framework for the generation and use...... of such performance maps. We demonstrate how the framework can be used to reduce the retransmissions and to better utilise network resources when performing TCP-based file downloads in vehicular M2M communication scenarios. The approach works on top of a standard TCP stack hence has to map identified transmission...

Navigating the massive world of reddit: using backbone networks to map user interests in social media

Directory of Open Access Journals (Sweden)

Randal S. Olson

2015-05-01

Full Text Available In the massive online worlds of social media, users frequently rely on organizing themselves around specific topics of interest to find and engage with like-minded people. However, navigating these massive worlds and finding topics of specific interest often proves difficult because the worlds are mostly organized haphazardly, leaving users to find relevant interests by word of mouth or using a basic search feature. Here, we report on a method using the backbone of a network to create a map of the primary topics of interest in any social network. To demonstrate the method, we build an interest map for the social news web site reddit and show how such a map could be used to navigate a social media world. Moreover, we analyze the network properties of the reddit social network and find that it has a scale-free, small-world, and modular community structure, much like other online social networks such as Facebook and Twitter. We suggest that the integration of interest maps into popular social media platforms will assist users in organizing themselves into more specific interest groups, which will help alleviate the overcrowding effect often observed in large online communities.

Symbolic dynamics and synchronization of coupled map networks with multiple delays

International Nuclear Information System (INIS)

Atay, Fatihcan M.; Jalan, Sarika; Jost, Juergen

2010-01-01

We use symbolic dynamics to study discrete-time dynamical systems with multiple time delays. We exploit the concept of avoiding sets, which arise from specific non-generating partitions of the phase space and restrict the occurrence of certain symbol sequences related to the characteristics of the dynamics. In particular, we show that the resulting forbidden sequences are closely related to the time delays in the system. We present two applications to coupled map lattices, namely (1) detecting synchronization and (2) determining unknown values of the transmission delays in networks with possibly directed and weighted connections and measurement noise. The method is applicable to multi-dimensional as well as set-valued maps, and to networks with time-varying delays and connection structure.

Foreground removal from Planck Sky Model temperature maps using a MLP neural network

DEFF Research Database (Denmark)

Nørgaard-Nielsen, Hans Ulrik; Hebert, K.

2009-01-01

with no systematic errors. To demonstrate the feasibility of a simple multilayer perceptron (MLP) neural network for extracting the CMB temperature signal, we have analyzed a specific data set, namely the Planck Sky Model maps, developed for evaluation of different component separation methods before including them...... in the Planck data analysis pipeline. It is found that a MLP neural network can provide a CMB map of about 80% of the sky to a very high degree uncorrelated with the foreground components. Also the derived power spectrum shows little evidence for systematic errors....

Mapping of networks to detect priority zoonoses in Jordan

Directory of Open Access Journals (Sweden)

Erin M Sorrell

2015-10-01

Full Text Available Early detection of emerging disease events is a priority focus area for cooperative bioengagement programs. Communication and coordination among national disease surveillance and response networks are essential for timely detection and control of a public health event. Although systematic information sharing between the human and animal health sectors can help stakeholders detect and respond to zoonotic diseases rapidly, resource constraints and other barriers often prevent efficient cross-sector reporting. The purpose of this research project was to map the laboratory and surveillance networks currently in place for detecting and reporting priority zoonotic diseases in Jordan in order to identify the nodes of communication, coordination, and decision-making where health and veterinary sectors intersect, and to identify priorities and gaps that limit information-sharing for action. We selected three zoonotic diseases as case studies: highly pathogenic avian influenza (HPAI H5N1, rabies, and brucellosis. Through meetings with government agencies and health officials, and desk research, we mapped each system from the index case through response – including both surveillance and laboratory networks, highlighting both areas of strength and those that would benefit from capacity-building resources. Our major findings indicate informal communication exists across sectors; in the event of emergence of one of the priority zoonoses studied there is effective coordination across the Ministry of Health and Ministry of Agriculture. However, routine formal coordination is lacking. Overall, there is a strong desire and commitment for multi-sectoral coordination in detection and response to zoonoses across public health and veterinary sectors. Our analysis indicates that the networks developed in response to HPAI can and should be leveraged to develop a comprehensive laboratory and surveillance One Health network.

Mapping Rice Cropping Systems in Vietnam Using an NDVI-Based Time-Series Similarity Measurement Based on DTW Distance

Directory of Open Access Journals (Sweden)

Xudong Guan

2016-01-01

Full Text Available Normalized Difference Vegetation Index (NDVI derived from Moderate Resolution Imaging Spectroradiometer (MODIS time-series data has been widely used in the fields of crop and rice classification. The cloudy and rainy weather characteristics of the monsoon season greatly reduce the likelihood of obtaining high-quality optical remote sensing images. In addition, the diverse crop-planting system in Vietnam also hinders the comparison of NDVI among different crop stages. To address these problems, we apply a Dynamic Time Warping (DTW distance-based similarity measure approach and use the entire yearly NDVI time series to reduce the inaccuracy of classification using a single image. We first de-noise the NDVI time series using S-G filtering based on the TIMESAT software. Then, a standard NDVI time-series base for rice growth is established based on field survey data and Google Earth sample data. NDVI time-series data for each pixel are constructed and the DTW distance with the standard rice growth NDVI time series is calculated. Then, we apply thresholds to extract rice growth areas. A qualitative assessment using statistical data and a spatial assessment using sampled data from the rice-cropping map reveal a high mapping accuracy at the national scale between the statistical data, with the corresponding R2 being as high as 0.809; however, the mapped rice accuracy decreased at the provincial scale due to the reduced number of rice planting areas per province. An analysis of the results indicates that the 500-m resolution MODIS data are limited in terms of mapping scattered rice parcels. The results demonstrate that the DTW-based similarity measure of the NDVI time series can be effectively used to map large-area rice cropping systems with diverse cultivation processes.

Mentoring Entrepreneurial Networks: mapping conceptions of participants in technological-based business incubators in Brazil.

Directory of Open Access Journals (Sweden)

Pontes Regis, Helder

2007-12-01

Full Text Available The recent entrepreneurship research agenda includes the analysis of cognitive structures of successful entrepreneurs, revealing an important tool for the examination of an entrepreneurial career. Using techniques of cognitive maps, this study explores the concepts of a successful career and the network itself, as a whole, for career development. Fifty-three entrepreneurs were studied, in seven technological incubators in the city of Recife, Pernambuco, Brazil. Specifically, this study aimed to map the shared meanings of the incubated entrepreneurs regarding informal support networks. Such networks support the entrepreneurial career and the present study explores the characteristics and the conceptual model that underlies the networks. The data collection was achieved through interviews through a free evocation technique. The shared meanings indicate the existence of inherent thought categories that support network context in the incubator environment, mainly the mentoring networks. The results endorse the interpretation of an informal mentoring model emerging from the dominant evocations concerning a successful career and of the network itself as promoter of career development.

A Cross-Layer Wireless Sensor Network Energy-Efficient Communication Protocol for Real-Time Monitoring of the Long-Distance Electric Transmission Lines

Directory of Open Access Journals (Sweden)

Jun Yu

2015-01-01

Full Text Available Optimization of energy consumption in Wireless Sensor Network (WSN nodes has become a critical link that constrains the engineering application of the smart grid due to the fact that the smart grid is characterized by long-distance transmission in a special environment. The paper proposes a linear hierarchical network topological structure specific to WSN energy conservation in environmental monitoring of the long-distance electric transmission lines in the smart grid. Based on the topological structural characteristics and optimization of network layers, the paper also proposes a Topological Structure be Layered Configurations (TSLC routing algorithm to improve the quality of WSN data transmission performance. Coprocessing of the network layer and the media access control (MAC layer is achieved by using the cross-layer design method, accessing the status for the nodes in the network layer and obtaining the status of the network nodes of the MAC layer. It efficiently saves the energy of the whole network, improves the quality of the network service performance, and prolongs the life cycle of the network.

Fast mapping rapidly integrates information into existing memory networks.

Science.gov (United States)

Coutanche, Marc N; Thompson-Schill, Sharon L

2014-12-01

Successful learning involves integrating new material into existing memory networks. A learning procedure known as fast mapping (FM), thought to simulate the word-learning environment of children, has recently been linked to distinct neuroanatomical substrates in adults. This idea has suggested the (never-before tested) hypothesis that FM may promote rapid incorporation into cortical memory networks. We test this hypothesis here in 2 experiments. In our 1st experiment, we introduced 50 participants to 16 unfamiliar animals and names through FM or explicit encoding (EE) and tested participants on the training day, and again after sleep. Learning through EE produced strong declarative memories, without immediate lexical competition, as expected from slow-consolidation models. Learning through FM, however, led to almost immediate lexical competition, which continued to the next day. Additionally, the learned words began to prime related concepts on the day following FM (but not EE) training. In a 2nd experiment, we replicated the lexical integration results and determined that presenting an already-known item during learning was crucial for rapid integration through FM. The findings presented here indicate that learned items can be integrated into cortical memory networks at an accelerated rate through fast mapping. The retrieval of a related known concept, in order to infer the target of the FM question, is critical for this effect. PsycINFO Database Record (c) 2014 APA, all rights reserved.

Zombie projects, negative networks, and multigenerational science: The temporality of the International Map of the World.

Science.gov (United States)

Rankin, William

2017-06-01

The International Map of the World was a hugely ambitious scheme to create standardized maps of the entire world. It was first proposed in 1891 and remained a going concern until 1986. Over the course of the project's official life, nearly every country in the world took part, and map sheets were published showing all but a few areas of the planet. But the project ended quite unceremoniously, repudiated by cartographers and mapping institutions alike, and it is now remembered as a 'sad story' of network failure. How can we evaluate this kind of sprawling, multigenerational project? In order to move beyond practitioners' (and historians') habit of summarizing the entire endeavor using the blunt categories of success and failure, I propose a more temporally aware reading, one that both disaggregates the (persistent) project from the (always changing) network and sees project and network as invertible, with the possibility of zombie projects and negative networks that can remain robust even when disconnected from their original goals. I therefore see the abandonment of the International Map of the World as resulting from vigorous collaboration and new norms in cartography, not from lack of cooperation or other resources. New categories are required for analyzing science over the long durée.

THE APPLICATION OF DIGITAL LINE GRAPHS AND MAP IN THE NETWORK ENVIRONMENT

Directory of Open Access Journals (Sweden)

X. Guo

2012-07-01

Full Text Available WebGIS is an important research field in GIS. W3C organization established SVG standard, which laid a foundation for WebGIS based on vector data. In China, Digital Line Graphs(DLG is a significant GIS product and it has been used in many medium and large WebGIS system. Geographic information-portrayal is the common method of DLG visualization. However, the inherent characteristics of Geographic information-portrayal may lead to a relatively higher data production input, still, the visualization effect is not ideal. We put forward a new product named Digital Line Graphs and Map(DLGM, which consists of DLG and DLG's cartographic presentation data. It provides visualization data based on the cartographic standards. Due to the manufacture and management of DLGM data that are independent from software and platform, its data can be used in many fields. Network application is one of them. This paper is to use DLGM in the network applications. First it reveals the connotation and characteristics of DLGM then analyses the model that DLGM organizes, manages DLG and map symbol data. After that, combined with SVG standards, we put forward DLGM’s SVG encoding method without any information loss. Finally we provide a web map system based on local area network by using 1：10000 DLGM data of a certain area. Based on this study, we conclude that DLGM can be used in the network environment providing high quality DLG and cartographic data for WebGIS.

The Euclidean distance degree

NARCIS (Netherlands)

Draisma, J.; Horobet, E.; Ottaviani, G.; Sturmfels, B.; Thomas, R.R.; Zhi, L.; Watt, M.

2014-01-01

The nearest point map of a real algebraic variety with respect to Euclidean distance is an algebraic function. For instance, for varieties of low rank matrices, the Eckart-Young Theorem states that this map is given by the singular value decomposition. This article develops a theory of such nearest

Mapping the dengue scientific landscape worldwide: a bibliometric and network analysis.

Science.gov (United States)

Mota, Fabio Batista; Fonseca, Bruna de Paula Fonseca E; Galina, Andréia Cristina; Silva, Roseli Monteiro da

2017-05-01

Despite the current global trend of reduction in the morbidity and mortality of neglected diseases, dengue's incidence has increased and occurrence areas have expanded. Dengue also persists as a scientific and technological challenge since there is no effective treatment, vaccine, vector control or public health intervention. Combining bibliometrics and social network analysis methods can support the mapping of dengue research and development (R&D) activities worldwide. The aim of this paper is to map the scientific scenario related to dengue research worldwide. We use scientific publication data from Web of Science Core Collection - articles indexed in Science Citation Index Expanded (SCI-EXPANDED) - and combine bibliometrics and social network analysis techniques to identify the most relevant journals, scientific references, research areas, countries and research organisations in the dengue scientific landscape. Our results show a significant increase of dengue publications over time; tropical medicine and virology as the most frequent research areas and biochemistry and molecular biology as the most central area in the network; USA and Brazil as the most productive countries; and Mahidol University and Fundação Oswaldo Cruz as the main research organisations and the Centres for Disease Control and Prevention as the most central organisation in the collaboration network. Our findings can be used to strengthen a global knowledge platform guiding policy, planning and funding decisions as well as to providing directions to researchers and institutions. So that, by offering to the scientific community, policy makers and public health practitioners a mapping of the dengue scientific landscape, this paper has aimed to contribute to upcoming debates, decision-making and planning on dengue R&D and public health strategies worldwide.

The cancer cell map initiative: defining the hallmark networks of cancer.

Science.gov (United States)

Krogan, Nevan J; Lippman, Scott; Agard, David A; Ashworth, Alan; Ideker, Trey

2015-05-21

Progress in DNA sequencing has revealed the startling complexity of cancer genomes, which typically carry thousands of somatic mutations. However, it remains unclear which are the key driver mutations or dependencies in a given cancer and how these influence pathogenesis and response to therapy. Although tumors of similar types and clinical outcomes can have patterns of mutations that are strikingly different, it is becoming apparent that these mutations recurrently hijack the same hallmark molecular pathways and networks. For this reason, it is likely that successful interpretation of cancer genomes will require comprehensive knowledge of the molecular networks under selective pressure in oncogenesis. Here we announce the creation of a new effort, The Cancer Cell Map Initiative (CCMI), aimed at systematically detailing these complex interactions among cancer genes and how they differ between diseased and healthy states. We discuss recent progress that enables creation of these cancer cell maps across a range of tumor types and how they can be used to target networks disrupted in individual patients, significantly accelerating the development of precision medicine. Copyright © 2015 Elsevier Inc. All rights reserved.

Automated high resolution mapping of coffee in Rwanda using an expert Bayesian network

Science.gov (United States)

Mukashema, A.; Veldkamp, A.; Vrieling, A.

2014-12-01

African highland agro-ecosystems are dominated by small-scale agricultural fields that often contain a mix of annual and perennial crops. This makes such systems difficult to map by remote sensing. We developed an expert Bayesian network model to extract the small-scale coffee fields of Rwanda from very high resolution data. The model was subsequently applied to aerial orthophotos covering more than 99% of Rwanda and on one QuickBird image for the remaining part. The method consists of a stepwise adjustment of pixel probabilities, which incorporates expert knowledge on size of coffee trees and fields, and on their location. The initial naive Bayesian network, which is a spectral-based classification, yielded a coffee map with an overall accuracy of around 50%. This confirms that standard spectral variables alone cannot accurately identify coffee fields from high resolution images. The combination of spectral and ancillary data (DEM and a forest map) allowed mapping of coffee fields and associated uncertainties with an overall accuracy of 87%. Aggregated to district units, the mapped coffee areas demonstrated a high correlation with the coffee areas reported in the detailed national coffee census of 2009 (R2 = 0.92). Unlike the census data our map provides high spatial resolution of coffee area patterns of Rwanda. The proposed method has potential for mapping other perennial small scale cropping systems in the East African Highlands and elsewhere.

Wavelet analysis of polarization maps of polycrystalline biological fluids networks

Science.gov (United States)

Ushenko, Y. A.

2011-12-01

The optical model of human joints synovial fluid is proposed. The statistic (statistic moments), correlation (autocorrelation function) and self-similar (Log-Log dependencies of power spectrum) structure of polarization two-dimensional distributions (polarization maps) of synovial fluid has been analyzed. It has been shown that differentiation of polarization maps of joint synovial fluid with different physiological state samples is expected of scale-discriminative analysis. To mark out of small-scale domain structure of synovial fluid polarization maps, the wavelet analysis has been used. The set of parameters, which characterize statistic, correlation and self-similar structure of wavelet coefficients' distributions of different scales of polarization domains for diagnostics and differentiation of polycrystalline network transformation connected with the pathological processes, has been determined.

Perception of similarity: a model for social network dynamics

International Nuclear Information System (INIS)

Javarone, Marco Alberto; Armano, Giuliano

2013-01-01

Some properties of social networks (e.g., the mixing patterns and the community structure) appear deeply influenced by the individual perception of people. In this work we map behaviors by considering similarity and popularity of people, also assuming that each person has his/her proper perception and interpretation of similarity. Although investigated in different ways (depending on the specific scientific framework), from a computational perspective similarity is typically calculated as a distance measure. In accordance with this view, to represent social network dynamics we developed an agent-based model on top of a hyperbolic space on which individual distance measures are calculated. Simulations, performed in accordance with the proposed model, generate small-world networks that exhibit a community structure. We deem this model to be valuable for analyzing the relevant properties of real social networks. (paper)

Confession-building, long-distance networks, and the organization of Jesuit science.

Science.gov (United States)

Harris, S J

1996-01-01

The ability of the Society of Jesus to engage in a broad and enduring tradition of scientific activity is here addressed in terms of its programmatic commitment to the consolidation and extension of the Catholic confession (i.e., to a multipronged program of confession-building) and its mastery of the administrative apparatus necessary to operate long-distance networks. The Society's early move into two major apostolates, one in education and the other in the overseas missions, brought Jesuits into regular contact with the educated elites of Europe and at the same time placed the society's missionaries in remote parts of the natural world. The modes of organization of travel and communication required by the Society's long-distance networks (i.e., the training and deployment of reliable agents willing to work under direction in remote locations and capable of providing trustworthy reports and observations to their superiors through regular exchange of correspondence) not only facilitated scientific communication and collaboration within the order, it also provided Jesuits with the resources they needed to engage successfully in 'ministries among the learned'. Evidence of a sustained attempt by Jesuit authors to assume the role of Kulturträger is found in the several genres of scientific publications that dominate the society's scientific corpus. Thus the society's early recognition of the "apostolic value" of scientific publications in recruiting friends and allies among Europe's intellectual elites, I argue, allowed a robust interest in natural knowledge to emerge as a legitimate part of the Jesuit vocation.

Numerical distance protection

CERN Document Server

Ziegler, Gerhard

2011-01-01

Distance protection provides the basis for network protection in transmission systems and meshed distribution systems. This book covers the fundamentals of distance protection and the special features of numerical technology. The emphasis is placed on the application of numerical distance relays in distribution and transmission systems.This book is aimed at students and engineers who wish to familiarise themselves with the subject of power system protection, as well as the experienced user, entering the area of numerical distance protection. Furthermore it serves as a reference guide for s

Single-shot T2 mapping using overlapping-echo detachment planar imaging and a deep convolutional neural network.

Science.gov (United States)

Cai, Congbo; Wang, Chao; Zeng, Yiqing; Cai, Shuhui; Liang, Dong; Wu, Yawen; Chen, Zhong; Ding, Xinghao; Zhong, Jianhui

2018-04-24

An end-to-end deep convolutional neural network (CNN) based on deep residual network (ResNet) was proposed to efficiently reconstruct reliable T 2 mapping from single-shot overlapping-echo detachment (OLED) planar imaging. The training dataset was obtained from simulations that were carried out on SPROM (Simulation with PRoduct Operator Matrix) software developed by our group. The relationship between the original OLED image containing two echo signals and the corresponding T 2 mapping was learned by ResNet training. After the ResNet was trained, it was applied to reconstruct the T 2 mapping from simulation and in vivo human brain data. Although the ResNet was trained entirely on simulated data, the trained network was generalized well to real human brain data. The results from simulation and in vivo human brain experiments show that the proposed method significantly outperforms the echo-detachment-based method. Reliable T 2 mapping with higher accuracy is achieved within 30 ms after the network has been trained, while the echo-detachment-based OLED reconstruction method took approximately 2 min. The proposed method will facilitate real-time dynamic and quantitative MR imaging via OLED sequence, and deep convolutional neural network has the potential to reconstruct maps from complex MRI sequences efficiently. © 2018 International Society for Magnetic Resonance in Medicine.

Secure Chaotic Map Based Block Cryptosystem with Application to Camera Sensor Networks

Directory of Open Access Journals (Sweden)

Muhammad Khurram Khan

2011-01-01

Full Text Available Recently, Wang et al. presented an efficient logistic map based block encryption system. The encryption system employs feedback ciphertext to achieve plaintext dependence of sub-keys. Unfortunately, we discovered that their scheme is unable to withstand key stream attack. To improve its security, this paper proposes a novel chaotic map based block cryptosystem. At the same time, a secure architecture for camera sensor network is constructed. The network comprises a set of inexpensive camera sensors to capture the images, a sink node equipped with sufficient computation and storage capabilities and a data processing server. The transmission security between the sink node and the server is gained by utilizing the improved cipher. Both theoretical analysis and simulation results indicate that the improved algorithm can overcome the flaws and maintain all the merits of the original cryptosystem. In addition, computational costs and efficiency of the proposed scheme are encouraging for the practical implementation in the real environment as well as camera sensor network.

Robustness leads close to the edge of chaos in coupled map networks: toward the understanding of biological networks

International Nuclear Information System (INIS)

Saito, Nen; Kikuchi, Macoto

2013-01-01

Dynamics in biological networks are, in general, robust against several perturbations. We investigate a coupled map network as a model motivated by gene regulatory networks and design systems that are robust against phenotypic perturbations (perturbations in dynamics), as well as systems that are robust against mutation (perturbations in network structure). To achieve such a design, we apply a multicanonical Monte Carlo method. Analysis based on the maximum Lyapunov exponent and parameter sensitivity shows that systems with marginal stability, which are regarded as systems at the edge of chaos, emerge when robustness against network perturbations is required. This emergence of the edge of chaos is a self-organization phenomenon and does not need a fine tuning of parameters. (paper)

Analyzing the role of social networks in mapping knowledge flows: A case of a pharmaceutical company in India

Directory of Open Access Journals (Sweden)

V. Murale

2014-03-01

Full Text Available Knowledge Management literature lays emphasis on the fact that a major chunk of knowledge dissemination occurs through the various forms of social networks that exist within the organizations. A social network is a simple structure comprising of set of actors or nodes that may have relationships ties with one another. The social network analysis (SNA will help in mapping and measuring formal and informal relationships to understand what facilitates or impedes the knowledge flows that bind interacting units. This paper aims at studying the knowledge flows that happen through the social networks. It first, provides a conceptual framework and review of literature on the recent research and application of knowledge mapping and SNA, followed by a discussion on application of SNA for mapping knowledge flows in a pharmaceutical firm. In the last part, Knowledge maps are presented to illustrate the actual knowledge flow in firm.

Pattern formation and firing synchronization in networks of map neurons

International Nuclear Information System (INIS)

Wang Qingyun; Duan Zhisheng; Huang Lin; Chen Guanrong; Lu Qishao

2007-01-01

Patterns and collective phenomena such as firing synchronization are studied in networks of nonhomogeneous oscillatory neurons and mixtures of oscillatory and excitable neurons, with dynamics of each neuron described by a two-dimensional (2D) Rulkov map neuron. It is shown that as the coupling strength is increased, typical patterns emerge spatially, which propagate through the networks in the form of beautiful target waves or parallel ones depending on the size of networks. Furthermore, we investigate the transitions of firing synchronization characterized by the rate of firing when the coupling strength is increased. It is found that there exists an intermediate coupling strength; firing synchronization is minimal simultaneously irrespective of the size of networks. For further increasing the coupling strength, synchronization is enhanced. Since noise is inevitable in real neurons, we also investigate the effects of white noise on firing synchronization for different networks. For the networks of oscillatory neurons, it is shown that firing synchronization decreases when the noise level increases. For the missed networks, firing synchronization is robust under the noise conditions considered in this paper. Results presented in this paper should prove to be valuable for understanding the properties of collective dynamics in real neuronal networks

On network coding and modulation mapping for three-phase bidirectional relaying

KAUST Repository

Chang, Ronald Y.; Lin, Sian Jheng; Chung, Wei-Ho

2015-01-01

© 2015 IEEE. In this paper, we consider the network coding (NC) enabled three-phase protocol for information exchange between two users in a wireless two-way (bidirectional) relay network. Modulo-based (nonbinary) and XOR-based (binary) NC schemes are considered as information mixture schemes at the relay while all transmissions adopt pulse amplitude modulation (PAM). We first obtain the optimal constellation mapping at the relay that maximizes the decoding performance at the users for each NC scheme. Then, we compare the two NC schemes, each in conjunction with the optimal constellation mapping at the relay, in different conditions. Our results demonstrate that, in the low SNR regime, binary NC outperforms nonbinary NC with 4-PAM, while they have mixed performance with 8-PAM. This observation applies to quadrature amplitude modulation (QAM) composed of two parallel PAMs.

On network coding and modulation mapping for three-phase bidirectional relaying

KAUST Repository

Chang, Ronald Y.

2015-12-03

© 2015 IEEE. In this paper, we consider the network coding (NC) enabled three-phase protocol for information exchange between two users in a wireless two-way (bidirectional) relay network. Modulo-based (nonbinary) and XOR-based (binary) NC schemes are considered as information mixture schemes at the relay while all transmissions adopt pulse amplitude modulation (PAM). We first obtain the optimal constellation mapping at the relay that maximizes the decoding performance at the users for each NC scheme. Then, we compare the two NC schemes, each in conjunction with the optimal constellation mapping at the relay, in different conditions. Our results demonstrate that, in the low SNR regime, binary NC outperforms nonbinary NC with 4-PAM, while they have mixed performance with 8-PAM. This observation applies to quadrature amplitude modulation (QAM) composed of two parallel PAMs.

A distance-aware replica adaptive data gathering protocol for Delay Tolerant Mobile Sensor Networks.

Science.gov (United States)

Feng, Yong; Gong, Haigang; Fan, Mingyu; Liu, Ming; Wang, Xiaomin

2011-01-01

In Delay Tolerant Mobile Sensor Networks (DTMSNs) that have the inherent features of intermitted connectivity and frequently changing network topology it is reasonable to utilize multi-replica schemes to improve the data gathering performance. However, most existing multi-replica approaches inject a large amount of message copies into the network to increase the probability of message delivery, which may drain each mobile node's limited battery supply faster and result in too much contention for the restricted resources of the DTMSN, so a proper data gathering scheme needs a trade off between the number of replica messages and network performance. In this paper, we propose a new data gathering protocol called DRADG (for Distance-aware Replica Adaptive Data Gathering protocol), which economizes network resource consumption through making use of a self-adapting algorithm to cut down the number of redundant replicas of messages, and achieves a good network performance by leveraging the delivery probabilities of the mobile sensors as main routing metrics. Simulation results have shown that the proposed DRADG protocol achieves comparable or higher message delivery ratios at the cost of the much lower transmission overhead than several current DTMSN data gathering schemes.

Facial Feature Extraction Using Frequency Map Series in PCNN

Directory of Open Access Journals (Sweden)

Rencan Nie

2016-01-01

Full Text Available Pulse coupled neural network (PCNN has been widely used in image processing. The 3D binary map series (BMS generated by PCNN effectively describes image feature information such as edges and regional distribution, so BMS can be treated as the basis of extracting 1D oscillation time series (OTS for an image. However, the traditional methods using BMS did not consider the correlation of the binary sequence in BMS and the space structure for every map. By further processing for BMS, a novel facial feature extraction method is proposed. Firstly, consider the correlation among maps in BMS; a method is put forward to transform BMS into frequency map series (FMS, and the method lessens the influence of noncontinuous feature regions in binary images on OTS-BMS. Then, by computing the 2D entropy for every map in FMS, the 3D FMS is transformed into 1D OTS (OTS-FMS, which has good geometry invariance for the facial image, and contains the space structure information of the image. Finally, by analyzing the OTS-FMS, the standard Euclidean distance is used to measure the distances for OTS-FMS. Experimental results verify the effectiveness of OTS-FMS in facial recognition, and it shows better recognition performance than other feature extraction methods.

Logarithmic r-θ mapping for hybrid optical neural network filter for multiple objects recognition within cluttered scenes

Science.gov (United States)

Kypraios, Ioannis; Young, Rupert C. D.; Chatwin, Chris R.; Birch, Phil M.

2009-04-01

θThe window unit in the design of the complex logarithmic r-θ mapping for hybrid optical neural network filter can allow multiple objects of the same class to be detected within the input image. Additionally, the architecture of the neural network unit of the complex logarithmic r-θ mapping for hybrid optical neural network filter becomes attractive for accommodating the recognition of multiple objects of different classes within the input image by modifying the output layer of the unit. We test the overall filter for multiple objects of the same and of different classes' recognition within cluttered input images and video sequences of cluttered scenes. Logarithmic r-θ mapping for hybrid optical neural network filter is shown to exhibit with a single pass over the input data simultaneously in-plane rotation, out-of-plane rotation, scale, log r-θ map translation and shift invariance, and good clutter tolerance by recognizing correctly the different objects within the cluttered scenes. We record in our results additional extracted information from the cluttered scenes about the objects' relative position, scale and in-plane rotation.

Inferring nonlinear gene regulatory networks from gene expression data based on distance correlation.

Directory of Open Access Journals (Sweden)

Xiaobo Guo

Full Text Available Nonlinear dependence is general in regulation mechanism of gene regulatory networks (GRNs. It is vital to properly measure or test nonlinear dependence from real data for reconstructing GRNs and understanding the complex regulatory mechanisms within the cellular system. A recently developed measurement called the distance correlation (DC has been shown powerful and computationally effective in nonlinear dependence for many situations. In this work, we incorporate the DC into inferring GRNs from the gene expression data without any underling distribution assumptions. We propose three DC-based GRNs inference algorithms: CLR-DC, MRNET-DC and REL-DC, and then compare them with the mutual information (MI-based algorithms by analyzing two simulated data: benchmark GRNs from the DREAM challenge and GRNs generated by SynTReN network generator, and an experimentally determined SOS DNA repair network in Escherichia coli. According to both the receiver operator characteristic (ROC curve and the precision-recall (PR curve, our proposed algorithms significantly outperform the MI-based algorithms in GRNs inference.

Frequency Count Attribute Oriented Induction of Corporate Network Data for Mapping Business Activity

Directory of Open Access Journals (Sweden)

Tanutama Lukas

2014-03-01

Full Text Available Companies increasingly rely on Internet for effective and efficient business communication. As Information Technology infrastructure backbone for business activities, corporate network connects the company to Internet and enables its activities globally. It carries data packets generated by the activities of the users performing their business tasks. Traditionally, infrastructure operations mainly maintain data carrying capacity and network devices performance. It would be advantageous if a company knows what activities are running in its network. The research provides a simple method of mapping the business activity reflected by the network data. To map corporate users’ activities, a slightly modified Attribute Oriented Induction (AOI approach to mine the network data was applied. The frequency of each protocol invoked were counted to show what the user intended to do. The collected data was samples taken within a certain sampling period. Samples were taken due to the enormous data packets generated. Protocols of interest are only Internet related while intranet protocols are ignored. It can be concluded that the method could provide the management a general overview of the usage of its infrastructure and lead to efficient, effective and secure ICT infrastructure.

Frequency Count Attribute Oriented Induction of Corporate Network Data for Mapping Business Activity

Science.gov (United States)

Tanutama, Lukas

2014-03-01

Companies increasingly rely on Internet for effective and efficient business communication. As Information Technology infrastructure backbone for business activities, corporate network connects the company to Internet and enables its activities globally. It carries data packets generated by the activities of the users performing their business tasks. Traditionally, infrastructure operations mainly maintain data carrying capacity and network devices performance. It would be advantageous if a company knows what activities are running in its network. The research provides a simple method of mapping the business activity reflected by the network data. To map corporate users' activities, a slightly modified Attribute Oriented Induction (AOI) approach to mine the network data was applied. The frequency of each protocol invoked were counted to show what the user intended to do. The collected data was samples taken within a certain sampling period. Samples were taken due to the enormous data packets generated. Protocols of interest are only Internet related while intranet protocols are ignored. It can be concluded that the method could provide the management a general overview of the usage of its infrastructure and lead to efficient, effective and secure ICT infrastructure.

Mapping the ecological networks of microbial communities.

Science.gov (United States)

Xiao, Yandong; Angulo, Marco Tulio; Friedman, Jonathan; Waldor, Matthew K; Weiss, Scott T; Liu, Yang-Yu

2017-12-11

Mapping the ecological networks of microbial communities is a necessary step toward understanding their assembly rules and predicting their temporal behavior. However, existing methods require assuming a particular population dynamics model, which is not known a priori. Moreover, those methods require fitting longitudinal abundance data, which are often not informative enough for reliable inference. To overcome these limitations, here we develop a new method based on steady-state abundance data. Our method can infer the network topology and inter-taxa interaction types without assuming any particular population dynamics model. Additionally, when the population dynamics is assumed to follow the classic Generalized Lotka-Volterra model, our method can infer the inter-taxa interaction strengths and intrinsic growth rates. We systematically validate our method using simulated data, and then apply it to four experimental data sets. Our method represents a key step towards reliable modeling of complex, real-world microbial communities, such as the human gut microbiota.

Application of Fuzzy theory with neutral network and cognitive map on decision making

International Nuclear Information System (INIS)

Hla Aung; Tin Maung

2001-01-01

The format reasoning involves establishment of causal relationships among concepts. These are commonly represented by cognitive maps. However, the concepts and their relationships could be fuzzy. In this paper we review some properties of fuzzy cognitive maps. This paper shows that one of the solutions is to introduce the idea of disconcepts along with concepts to arrive at reasonings that are intuitively satisfying. A neutral network architecture based on associative memory and a framework for fuzzy cognitive maps based knowledge processing tool has also been proposed. The proposed method is tested on a cognitive map of a publishing company. (author)

Mapping thalamocortical network pathology in temporal lobe epilepsy.

Science.gov (United States)

Bernhardt, Boris C; Bernasconi, Neda; Kim, Hosung; Bernasconi, Andrea

2012-01-10

Although experimental work has provided evidence that the thalamus is a crucial relay structure in temporal lobe epilepsy (TLE), the relation of the thalamus to neocortical pathology remains unclear. To assess thalamocortical network pathology in TLE, we mapped pointwise patterns of thalamic atrophy and statistically related them to neocortical thinning. We studied cross-sectionally 36 patients with drug-resistant TLE and 19 age- and sex-matched healthy control subjects using high-resolution MRI. To localize thalamic pathology, we converted manual labels into surface meshes using the spherical harmonic description and calculated local deformations relative to a template. In addition, we measured cortical thickness by means of the constrained Laplacian anatomic segmentation using proximity algorithm. Compared with control subjects, patients with TLE showed ipsilateral thalamic atrophy that was located along the medial surface, encompassing anterior, medial, and posterior divisions. Unbiased analysis correlating the degree of medial thalamic atrophy with cortical thickness measurements mapped bilateral frontocentral, lateral temporal, and mesiotemporal cortices. These areas overlapped with those of cortical thinning found when patients were compared with control subjects. Thalamic atrophy intensified with a longer duration of epilepsy and was more severe in patients with a history of febrile convulsions. The degree and distribution of thalamic pathology relates to the topography and extent of neocortical atrophy, lending support to the concept that the thalamus is an important hub in the pathologic network of TLE.

Distance-Based Opportunistic Mobile Data Offloading.

Science.gov (United States)

Lu, Xiaofeng; Lio, Pietro; Hui, Pan

2016-06-15

Cellular network data traffic can be offload onto opportunistic networks. This paper proposes a Distance-based Opportunistic Publish/Subscribe (DOPS) content dissemination model, which is composed of three layers: application layer, decision-making layer and network layer. When a user wants new content, he/she subscribes on a subscribing server. Users having the contents decide whether to deliver the contents to the subscriber based on the distance information. If in the meantime a content owner has traveled further in the immediate past time than the distance between the owner and the subscriber, the content owner will send the content to the subscriber through opportunistic routing. Simulations provide an evaluation of the data traffic offloading efficiency of DOPS.

Big Data: A Parallel Particle Swarm Optimization-Back-Propagation Neural Network Algorithm Based on MapReduce.

Science.gov (United States)

Cao, Jianfang; Cui, Hongyan; Shi, Hao; Jiao, Lijuan

2016-01-01

A back-propagation (BP) neural network can solve complicated random nonlinear mapping problems; therefore, it can be applied to a wide range of problems. However, as the sample size increases, the time required to train BP neural networks becomes lengthy. Moreover, the classification accuracy decreases as well. To improve the classification accuracy and runtime efficiency of the BP neural network algorithm, we proposed a parallel design and realization method for a particle swarm optimization (PSO)-optimized BP neural network based on MapReduce on the Hadoop platform using both the PSO algorithm and a parallel design. The PSO algorithm was used to optimize the BP neural network's initial weights and thresholds and improve the accuracy of the classification algorithm. The MapReduce parallel programming model was utilized to achieve parallel processing of the BP algorithm, thereby solving the problems of hardware and communication overhead when the BP neural network addresses big data. Datasets on 5 different scales were constructed using the scene image library from the SUN Database. The classification accuracy of the parallel PSO-BP neural network algorithm is approximately 92%, and the system efficiency is approximately 0.85, which presents obvious advantages when processing big data. The algorithm proposed in this study demonstrated both higher classification accuracy and improved time efficiency, which represents a significant improvement obtained from applying parallel processing to an intelligent algorithm on big data.

Interactive Distance Learning in Connecticut.

Science.gov (United States)

Pietras, Jesse John; Murphy, Robert J.

This paper provides an overview of distance learning activities in Connecticut and addresses the feasibility of such activities. Distance education programs have evolved from the one dimensional electronic mail systems to the use of sophisticated digital fiber networks. The Middlesex Distance Learning Consortium has developed a long-range plan to…

Analysis of connectivity map: Control to glutamate injured and phenobarbital treated neuronal network

Science.gov (United States)

Kamal, Hassan; Kanhirodan, Rajan; Srinivas, Kalyan V.; Sikdar, Sujit K.

2010-04-01

We study the responses of a cultured neural network when it is exposed to epileptogenesis glutamate injury causing epilepsy and subsequent treatment with phenobarbital by constructing connectivity map of neurons using correlation matrix. This study is particularly useful in understanding the pharmaceutical drug induced changes in the neuronal network properties with insights into changes at the systems biology level.

[Factors regarding awareness of preventive care exercises: Distance to exercise facilities and their social networks].

Science.gov (United States)

Soma, Yuki; Tsunoda, Kenji; Kitano, Naruki; Jindo, Takashi; Okura, Tomohiro

2015-01-01

The present study examines factors affecting individuals' awareness of certain types of preventive care exercises, particularly the distance from their home to an exercise facility and their social networks. Participants were 3206 men (age, 73.0±6.2 years) and 3395 women (age, 73.2±6.4 years) aged ≥65 years who had not been certified as persons with care needs and who had responded to an inventory survey conducted in Kasama City, Japan, in 2013. We performed multiple logistic regression analysis to assess the characteristics associated with participants' awareness of two types of exercises for preventive care: "silver rehabili taisou" (SRT) and "square-stepping exercise" (SSE). Independent variables were distance from home to the exercise facility, social networks, transportation availability, physical function, cognitive function, and neighborhood population density. Older adults who were aware of the exercises lived significantly closer to an exercise facility (SRT, aware: 1,148.5±961.3 m vs. unaware: 1,284.2±1,027.4 m; SSE, aware: 1,415.9±1104.1 m vs. unaware: 1,615.7±1,172.2 m). Multiple logistic regression analysis showed that participation in community activities (men, SRT-odds ratio [OR]=2.54 and SSE-OR=2.19; women, SRT-OR=4.14 and SSE-OR=3.34] and visiting friends (men, SRT-OR=1.45 and SSE-OR=1.49; women SRT-OR=1.44 and SSE-OR=1.73) were promoting factors for awareness of both types of exercises. In men and women, low physical function (SRT-OR=0.73 and SSE-OR=0.56) and dependence on another person to drive them to the destination (SRT-OR=0.79 and SSE-OR=0.78) were inhibiting factors, respectively. A distance of >500 m between their home and the facility tended to be an inhibiting factor. A shorter distance from home to an exercise facility and better social networks increased awareness of preventive care exercises in both sexes and for both types of exercise. Establishing exercise centers and devising effective methods of imparting information to

LiDAR-based 2D Localization and Mapping System using Elliptical Distance Correction Models for UAV Wind Turbine Blade Inspection

DEFF Research Database (Denmark)

Nikolov, Ivan Adriyanov; Madsen, Claus B.

2017-01-01

for on-site outdoor localization and mapping in low feature environment using the inexpensive RPLIDAR and an 9-DOF IMU. Our algorithm geometrically simplifies the wind turbine blade 2D cross-section to an elliptical model and uses it for distance and shape correction. We show that the proposed algorithm...

Effective distance adaptation traffic dispatching in software defined IP over optical network

Science.gov (United States)

Duan, Zhiwei; Li, Hui; Liu, Yuze; Ji, Yuefeng; Li, Hongfa; Lin, Yi

2017-10-01

The rapid growth of IP traffic has contributed to the wide deployment of optical devices (ROADM/OXC, etc.). Meanwhile, with the emergence and application of high-performance network services such as ultra-high video transmission, people are increasingly becoming more and more particular about the quality of service (QoS) of network. However, the pass-band shape of WSSs which is utilized in the ROADM/OXC is not ideal, causing narrowing of spectrum. Spectral narrowing can lead to signal impairment. Therefore, guard-bands need to be inserted between adjacent paths. In order to minimize the bandwidth waste due to guard bands, we propose an effective distance-adaptation traffic dispatching algorithm in IP over optical network based on SDON architecture. We use virtualization technology to set up virtual resources direct links by extracting part of the resources on paths which meet certain specific constraints. We also assign different bandwidth to each IP request based on path length. There is no need for guard-bands between the adjacent paths on the virtual link, which can effectively reduce the number of guard-bands and save the spectrum.

Online Communication in Organizations Does Not Kill Distance

DEFF Research Database (Denmark)

Hage, Eveline; Tan, Chee-Wee

Debates on the effects of online communication on distance within organizational networks have persisted within extant literature. Early contributions, which focus primarily on geographical distance, have highlighted the negative impact of distance on network evolution and sustenance, alluding...... to the importance of online communication as a means of nullifying these effects (Caimcross, 2001; Wellman, 2001). These studies have led to optimistic, but also premature, declarations of the ‘death of distance’ (Caimcross, 2001). More recent works however, have demonstrated that online networks are “to...

Identifying multiple influential spreaders in term of the distance-based coloring

Energy Technology Data Exchange (ETDEWEB)

Guo, Lei; Lin, Jian-Hong; Guo, Qiang [Research Center of Complex Systems Science, University of Shanghai for Science and Technology, Shanghai 200093 (China); Liu, Jian-Guo, E-mail: liujg004@ustc.edu.cn [Research Center of Complex Systems Science, University of Shanghai for Science and Technology, Shanghai 200093 (China); Data Science and Cloud Service Research Centre, Shanghai University of Finance and Economics, Shanghai 200433 (China)

2016-02-22

Identifying influential nodes is of significance for understanding the dynamics of information diffusion process in complex networks. In this paper, we present an improved distance-based coloring method to identify the multiple influential spreaders. In our method, each node is colored by a kind of color with the rule that the distance between initial nodes is close to the average distance of a network. When all nodes are colored, nodes with the same color are sorted into an independent set. Then we choose the nodes at the top positions of the ranking list according to their centralities. The experimental results for an artificial network and three empirical networks show that, comparing with the performance of traditional coloring method, the improvement ratio of our distance-based coloring method could reach 12.82%, 8.16%, 4.45%, 2.93% for the ER, Erdős, Polblogs and Routers networks respectively. - Highlights: • We present an improved distance-based coloring method to identify the multiple influential spreaders. • Each node is colored by a kind of color where the distance between initial nodes is close to the average distance. • For three empirical networks show that the improvement ratio of our distance-based coloring method could reach 8.16% for the Erdos network.

Identifying multiple influential spreaders in term of the distance-based coloring

International Nuclear Information System (INIS)

Guo, Lei; Lin, Jian-Hong; Guo, Qiang; Liu, Jian-Guo

2016-01-01

Identifying influential nodes is of significance for understanding the dynamics of information diffusion process in complex networks. In this paper, we present an improved distance-based coloring method to identify the multiple influential spreaders. In our method, each node is colored by a kind of color with the rule that the distance between initial nodes is close to the average distance of a network. When all nodes are colored, nodes with the same color are sorted into an independent set. Then we choose the nodes at the top positions of the ranking list according to their centralities. The experimental results for an artificial network and three empirical networks show that, comparing with the performance of traditional coloring method, the improvement ratio of our distance-based coloring method could reach 12.82%, 8.16%, 4.45%, 2.93% for the ER, Erdős, Polblogs and Routers networks respectively. - Highlights: • We present an improved distance-based coloring method to identify the multiple influential spreaders. • Each node is colored by a kind of color where the distance between initial nodes is close to the average distance. • For three empirical networks show that the improvement ratio of our distance-based coloring method could reach 8.16% for the Erdos network.

Distance-Based Opportunistic Mobile Data Offloading

Directory of Open Access Journals (Sweden)

Xiaofeng Lu

2016-06-01

Full Text Available Cellular network data traffic can be offload onto opportunistic networks. This paper proposes a Distance-based Opportunistic Publish/Subscribe (DOPS content dissemination model, which is composed of three layers: application layer, decision-making layer and network layer. When a user wants new content, he/she subscribes on a subscribing server. Users having the contents decide whether to deliver the contents to the subscriber based on the distance information. If in the meantime a content owner has traveled further in the immediate past time than the distance between the owner and the subscriber, the content owner will send the content to the subscriber through opportunistic routing. Simulations provide an evaluation of the data traffic offloading efficiency of DOPS.

Spatial prediction of ground subsidence susceptibility using an artificial neural network.

Science.gov (United States)

Lee, Saro; Park, Inhye; Choi, Jong-Kuk

2012-02-01

Ground subsidence in abandoned underground coal mine areas can result in loss of life and property. We analyzed ground subsidence susceptibility (GSS) around abandoned coal mines in Jeong-am, Gangwon-do, South Korea, using artificial neural network (ANN) and geographic information system approaches. Spatial data of subsidence area, topography, and geology, as well as various ground-engineering data, were collected and used to create a raster database of relevant factors for a GSS map. Eight major factors causing ground subsidence were extracted from the existing ground subsidence area: slope, depth of coal mine, distance from pit, groundwater depth, rock-mass rating, distance from fault, geology, and land use. Areas of ground subsidence were randomly divided into a training set to analyze GSS using the ANN and a test set to validate the predicted GSS map. Weights of each factor's relative importance were determined by the back-propagation training algorithms and applied to the input factor. The GSS was then calculated using the weights, and GSS maps were created. The process was repeated ten times to check the stability of analysis model using a different training data set. The map was validated using area-under-the-curve analysis with the ground subsidence areas that had not been used to train the model. The validation showed prediction accuracies between 94.84 and 95.98%, representing overall satisfactory agreement. Among the input factors, "distance from fault" had the highest average weight (i.e., 1.5477), indicating that this factor was most important. The generated maps can be used to estimate hazards to people, property, and existing infrastructure, such as the transportation network, and as part of land-use and infrastructure planning.

Fast non-linear extraction of plasma equilibrium parameters using a neural network mapping

International Nuclear Information System (INIS)

Lister, J.B.; Schnurrenberger, H.

1990-07-01

The shaping of non-circular plasmas requires a non-linear mapping between the measured diagnostic signals and selected equilibrium parameters. The particular configuration of Neural Network known as the multi-layer perceptron provides a powerful and general technique for formulating an arbitrary continuous non-linear multi-dimensional mapping. This technique has been successfully applied to the extraction of equilibrium parameters from measurements of single-null diverted plasmas in the DIII-D tokamak; the results are compared with a purely linear mapping. The method is promising, and hardware implementation is straightforward. (author) 15 refs., 7 figs

No need for a cognitive map: decentralized memory for insect navigation.

Directory of Open Access Journals (Sweden)

Holk Cruse

2011-03-01

Full Text Available In many animals the ability to navigate over long distances is an important prerequisite for foraging. For example, it is widely accepted that desert ants and honey bees, but also mammals, use path integration for finding the way back to their home site. It is however a matter of a long standing debate whether animals in addition are able to acquire and use so called cognitive maps. Such a 'map', a global spatial representation of the foraging area, is generally assumed to allow the animal to find shortcuts between two sites although the direct connection has never been travelled before. Using the artificial neural network approach, here we develop an artificial memory system which is based on path integration and various landmark guidance mechanisms (a bank of individual and independent landmark-defined memory elements. Activation of the individual memory elements depends on a separate motivation network and an, in part, asymmetrical lateral inhibition network. The information concerning the absolute position of the agent is present, but resides in a separate memory that can only be used by the path integration subsystem to control the behaviour, but cannot be used for computational purposes with other memory elements of the system. Thus, in this simulation there is no neural basis of a cognitive map. Nevertheless, an agent controlled by this network is able to accomplish various navigational tasks known from ants and bees and often discussed as being dependent on a cognitive map. For example, map-like behaviour as observed in honey bees arises as an emergent property from a decentralized system. This behaviour thus can be explained without referring to the assumption that a cognitive map, a coherent representation of foraging space, must exist. We hypothesize that the proposed network essentially resides in the mushroom bodies of the insect brain.

FUZZY MAPPING IN DATA SONIFICATION SYSTEM OF WIRELESS SENSOR NETWORK

Directory of Open Access Journals (Sweden)

Arseny A. Markhotin

2016-11-01

Full Text Available Problem Statement. This paper describes the modeling of sonification system with possible types of wireless sensor network data. Fuzzy logic is used for the data-to-sound mapping. Methods. Devised sonification system includes input data model and sound synthesis core. It was created in Pure Data. For fuzzy output of mapped data the Fuzzy Logic Toolboxof MATLABwas used. Moreover, the system model has an ability to send data to the side application via UDP protocol. Results. We offer the method of timbre space organization for sonification system output and the following output of control sound characteristics depending on the type of input data. Practical Relevance. The offered approach of using fuzzy logic in sonification systems can be applied in development of new applications when the formalization of data-to-sound mapping is difficult and also complicated timbal space organization is required.

Characteristics of equatorial plasma bubbles observed by TEC map based on ground-based GNSS receivers over South America

Science.gov (United States)

Barros, Diego; Takahashi, Hisao; Wrasse, Cristiano M.; Figueiredo, Cosme Alexandre O. B.

2018-01-01

A ground-based network of GNSS receivers has been used to monitor equatorial plasma bubbles (EPBs) by mapping the total electron content (TEC map). The large coverage of the TEC map allowed us to monitor several EPBs simultaneously and get characteristics of the dynamics, extension and longitudinal distributions of the EPBs from the onset time until their disappearance. These characteristics were obtained by using TEC map analysis and the keogram technique. TEC map databases analyzed were for the period between November 2012 and January 2016. The zonal drift velocities of the EPBs showed a clear latitudinal gradient varying from 123 m s-1 at the Equator to 65 m s-1 for 35° S latitude. Consequently, observed EPBs are inclined against the geomagnetic field lines. Both zonal drift velocity and the inclination of the EPBs were compared to the thermospheric neutral wind, which showed good agreement. Moreover, the large two-dimensional coverage of TEC maps allowed us to study periodic EPBs with a wide longitudinal distance. The averaged values observed for the inter-bubble distances also presented a clear latitudinal gradient varying from 920 km at the Equator to 640 km at 30° S. The latitudinal gradient in the inter-bubble distances seems to be related to the difference in the zonal drift velocity of the EPB from the Equator to middle latitudes and to the difference in the westward movement of the terminator. On several occasions, the distances reached more than 2000 km. Inter-bubble distances greater than 1000 km have not been reported in the literature.

An energy efficient distance-aware routing algorithm with multiple mobile sinks for wireless sensor networks.

Science.gov (United States)

Wang, Jin; Li, Bin; Xia, Feng; Kim, Chang-Seob; Kim, Jeong-Uk

2014-08-18

Traffic patterns in wireless sensor networks (WSNs) usually follow a many-to-one model. Sensor nodes close to static sinks will deplete their limited energy more rapidly than other sensors, since they will have more data to forward during multihop transmission. This will cause network partition, isolated nodes and much shortened network lifetime. Thus, how to balance energy consumption for sensor nodes is an important research issue. In recent years, exploiting sink mobility technology in WSNs has attracted much research attention because it can not only improve energy efficiency, but prolong network lifetime. In this paper, we propose an energy efficient distance-aware routing algorithm with multiple mobile sink for WSNs, where sink nodes will move with a certain speed along the network boundary to collect monitored data. We study the influence of multiple mobile sink nodes on energy consumption and network lifetime, and we mainly focus on the selection of mobile sink node number and the selection of parking positions, as well as their impact on performance metrics above. We can see that both mobile sink node number and the selection of parking position have important influence on network performance. Simulation results show that our proposed routing algorithm has better performance than traditional routing ones in terms of energy consumption.

An Energy Efficient Distance-Aware Routing Algorithm with Multiple Mobile Sinks for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Jin Wang

2014-08-01

Full Text Available Traffic patterns in wireless sensor networks (WSNs usually follow a many-to-one model. Sensor nodes close to static sinks will deplete their limited energy more rapidly than other sensors, since they will have more data to forward during multihop transmission. This will cause network partition, isolated nodes and much shortened network lifetime. Thus, how to balance energy consumption for sensor nodes is an important research issue. In recent years, exploiting sink mobility technology in WSNs has attracted much research attention because it can not only improve energy efficiency, but prolong network lifetime. In this paper, we propose an energy efficient distance-aware routing algorithm with multiple mobile sink for WSNs, where sink nodes will move with a certain speed along the network boundary to collect monitored data. We study the influence of multiple mobile sink nodes on energy consumption and network lifetime, and we mainly focus on the selection of mobile sink node number and the selection of parking positions, as well as their impact on performance metrics above. We can see that both mobile sink node number and the selection of parking position have important influence on network performance. Simulation results show that our proposed routing algorithm has better performance than traditional routing ones in terms of energy consumption.

Ischemia Detection Using Supervised Learning for Hierarchical Neural Networks Based on Kohonen-Maps

National Research Council Canada - National Science Library

Vladutu, L

2001-01-01

.... The motivation for developing the Supervising Network - Self Organizing Map (sNet-SOM) model is to design computationally effective solutions for the particular problem of ischemia detection and other similar applications...

Self-Organizing Maps Neural Networks Applied to the Classification of Ethanol Samples According to the Region of Commercialization

Directory of Open Access Journals (Sweden)

Aline Regina Walkoff

2017-10-01

Full Text Available Physical-chemical analysis data were collected, from 998 ethanol samples of automotive ethanol commercialized in the northern, midwestern and eastern regions of the state of Paraná. The data presented self-organizing maps (SOM neural networks, which classified them according to those regions. The self-organizing maps best configuration had a 45 x 45 topology and 5000 training epochs, with a final learning rate of 6.7x10-4, a final neighborhood relationship of 3x10-2 and a mean quantization error of 2x10-2. This neural network provided a topological map depicting three separated groups, each one corresponding to samples of a same region of commercialization. Four maps of weights, one for each parameter, were presented. The network established the pH was the most important variable for classification and electrical conductivity the least one. The self-organizing maps application allowed the segmentation of alcohol samples, therefore identifying them according to the region of commercialization. DOI: http://dx.doi.org/10.17807/orbital.v9i4.982

Fast non-linear extraction of plasma equilibrium parameters using a neural network mapping

International Nuclear Information System (INIS)

Lister, J.B.; Schnurrenberger, H.

1991-01-01

The shaping of non-circular plasmas requires a non-linear mapping between the measured diagnostic signals and selected equilibrium parameters. The particular configuration of neural network known as the multilayer perceptron provides a powerful and general technique for formulating an arbitrary continuous non-linear multi-dimensional mapping. This technique has been successfully applied to the extraction of equilibrium parameters from measurements of single-null diverted plasmas in the DIII-D tokamak; the results are compared with a purely linear mapping. The method is promising, and hardware implementation is straightforward. (author). 17 refs, 8 figs, 2 tab

Distribution of genotype network sizes in sequence-to-structure genotype-phenotype maps.

Science.gov (United States)

Manrubia, Susanna; Cuesta, José A

2017-04-01

An essential quantity to ensure evolvability of populations is the navigability of the genotype space. Navigability, understood as the ease with which alternative phenotypes are reached, relies on the existence of sufficiently large and mutually attainable genotype networks. The size of genotype networks (e.g. the number of RNA sequences folding into a particular secondary structure or the number of DNA sequences coding for the same protein structure) is astronomically large in all functional molecules investigated: an exhaustive experimental or computational study of all RNA folds or all protein structures becomes impossible even for moderately long sequences. Here, we analytically derive the distribution of genotype network sizes for a hierarchy of models which successively incorporate features of increasingly realistic sequence-to-structure genotype-phenotype maps. The main feature of these models relies on the characterization of each phenotype through a prototypical sequence whose sites admit a variable fraction of letters of the alphabet. Our models interpolate between two limit distributions: a power-law distribution, when the ordering of sites in the prototypical sequence is strongly constrained, and a lognormal distribution, as suggested for RNA, when different orderings of the same set of sites yield different phenotypes. Our main result is the qualitative and quantitative identification of those features of sequence-to-structure maps that lead to different distributions of genotype network sizes. © 2017 The Author(s).

Disrupting the Implementation Gap with Digital Technology in Healthcare Distance Education: Critical Insights from an e-Mentoring Intensional Network Practitioner Research Project

Science.gov (United States)

Singh, Gurmit

2013-01-01

Effective professional distance education is urgently needed to develop a well-trained workforce and improve impact on healthcare. However, distance education initiatives have had mixed results in improving practice. Often, successful implementation fails to leverage insights on the social and emergent nature of learning in networks. This paper…

Data Access Based on a Guide Map of the Underwater Wireless Sensor Network.

Science.gov (United States)

Wei, Zhengxian; Song, Min; Yin, Guisheng; Song, Houbing; Wang, Hongbin; Ma, Xuefei; Cheng, Albert M K

2017-10-17

Underwater wireless sensor networks (UWSNs) represent an area of increasing research interest, as data storage, discovery, and query of UWSNs are always challenging issues. In this paper, a data access based on a guide map (DAGM) method is proposed for UWSNs. In DAGM, the metadata describes the abstracts of data content and the storage location. The center ring is composed of nodes according to the shortest average data query path in the network in order to store the metadata, and the data guide map organizes, diffuses and synchronizes the metadata in the center ring, providing the most time-saving and energy-efficient data query service for the user. For this method, firstly the data is stored in the UWSN. The storage node is determined, the data is transmitted from the sensor node (data generation source) to the storage node, and the metadata is generated for it. Then, the metadata is sent to the center ring node that is the nearest to the storage node and the data guide map organizes the metadata, diffusing and synchronizing it to the other center ring nodes. Finally, when there is query data in any user node, the data guide map will select a center ring node nearest to the user to process the query sentence, and based on the shortest transmission delay and lowest energy consumption, data transmission routing is generated according to the storage location abstract in the metadata. Hence, specific application data transmission from the storage node to the user is completed. The simulation results demonstrate that DAGM has advantages with respect to data access time and network energy consumption.

Foreground removal from Planck Sky Model temperature maps using a MLP neural network

Science.gov (United States)

Nørgaard-Nielsen, H. U.; Hebert, K.

2009-08-01

Unfortunately, the Cosmic Microwave Background (CMB) radiation is contaminated by emission originating in the Milky Way (synchrotron, free-free and dust emission). Since the cosmological information is statistically in nature, it is essential to remove this foreground emission and leave the CMB with no systematic errors. To demonstrate the feasibility of a simple multilayer perceptron (MLP) neural network for extracting the CMB temperature signal, we have analyzed a specific data set, namely the Planck Sky Model maps, developed for evaluation of different component separation methods before including them in the Planck data analysis pipeline. It is found that a MLP neural network can provide a CMB map of about 80 % of the sky to a very high degree uncorrelated with the foreground components. Also the derived power spectrum shows little evidence for systematic errors.

Mapping cell populations in flow cytometry data for cross-sample comparison using the Friedman-Rafsky test statistic as a distance measure.

Science.gov (United States)

Hsiao, Chiaowen; Liu, Mengya; Stanton, Rick; McGee, Monnie; Qian, Yu; Scheuermann, Richard H

2016-01-01

Flow cytometry (FCM) is a fluorescence-based single-cell experimental technology that is routinely applied in biomedical research for identifying cellular biomarkers of normal physiological responses and abnormal disease states. While many computational methods have been developed that focus on identifying cell populations in individual FCM samples, very few have addressed how the identified cell populations can be matched across samples for comparative analysis. This article presents FlowMap-FR, a novel method for cell population mapping across FCM samples. FlowMap-FR is based on the Friedman-Rafsky nonparametric test statistic (FR statistic), which quantifies the equivalence of multivariate distributions. As applied to FCM data by FlowMap-FR, the FR statistic objectively quantifies the similarity between cell populations based on the shapes, sizes, and positions of fluorescence data distributions in the multidimensional feature space. To test and evaluate the performance of FlowMap-FR, we simulated the kinds of biological and technical sample variations that are commonly observed in FCM data. The results show that FlowMap-FR is able to effectively identify equivalent cell populations between samples under scenarios of proportion differences and modest position shifts. As a statistical test, FlowMap-FR can be used to determine whether the expression of a cellular marker is statistically different between two cell populations, suggesting candidates for new cellular phenotypes by providing an objective statistical measure. In addition, FlowMap-FR can indicate situations in which inappropriate splitting or merging of cell populations has occurred during gating procedures. We compared the FR statistic with the symmetric version of Kullback-Leibler divergence measure used in a previous population matching method with both simulated and real data. The FR statistic outperforms the symmetric version of KL-distance in distinguishing equivalent from nonequivalent cell

Mapping structural covariance networks of facial emotion recognition in early psychosis: A pilot study.

Science.gov (United States)

Buchy, Lisa; Barbato, Mariapaola; Makowski, Carolina; Bray, Signe; MacMaster, Frank P; Deighton, Stephanie; Addington, Jean

2017-11-01

People with psychosis show deficits recognizing facial emotions and disrupted activation in the underlying neural circuitry. We evaluated associations between facial emotion recognition and cortical thickness using a correlation-based approach to map structural covariance networks across the brain. Fifteen people with an early psychosis provided magnetic resonance scans and completed the Penn Emotion Recognition and Differentiation tasks. Fifteen historical controls provided magnetic resonance scans. Cortical thickness was computed using CIVET and analyzed with linear models. Seed-based structural covariance analysis was done using the mapping anatomical correlations across the cerebral cortex methodology. To map structural covariance networks involved in facial emotion recognition, the right somatosensory cortex and bilateral fusiform face areas were selected as seeds. Statistics were run in SurfStat. Findings showed increased cortical covariance between the right fusiform face region seed and right orbitofrontal cortex in controls than early psychosis subjects. Facial emotion recognition scores were not significantly associated with thickness in any region. A negative effect of Penn Differentiation scores on cortical covariance was seen between the left fusiform face area seed and right superior parietal lobule in early psychosis subjects. Results suggest that facial emotion recognition ability is related to covariance in a temporal-parietal network in early psychosis. Copyright © 2017 Elsevier B.V. All rights reserved.

Recurrent Neural Networks to Correct Satellite Image Classification Maps

Science.gov (United States)

Maggiori, Emmanuel; Charpiat, Guillaume; Tarabalka, Yuliya; Alliez, Pierre

2017-09-01

While initially devised for image categorization, convolutional neural networks (CNNs) are being increasingly used for the pixelwise semantic labeling of images. However, the proper nature of the most common CNN architectures makes them good at recognizing but poor at localizing objects precisely. This problem is magnified in the context of aerial and satellite image labeling, where a spatially fine object outlining is of paramount importance. Different iterative enhancement algorithms have been presented in the literature to progressively improve the coarse CNN outputs, seeking to sharpen object boundaries around real image edges. However, one must carefully design, choose and tune such algorithms. Instead, our goal is to directly learn the iterative process itself. For this, we formulate a generic iterative enhancement process inspired from partial differential equations, and observe that it can be expressed as a recurrent neural network (RNN). Consequently, we train such a network from manually labeled data for our enhancement task. In a series of experiments we show that our RNN effectively learns an iterative process that significantly improves the quality of satellite image classification maps.

The Resource Mapping Algorithm of Wireless Virtualized Networks for Saving Energy in Ultradense Small Cells

Directory of Open Access Journals (Sweden)

Sai Zou

2015-01-01

Full Text Available As the current network is designed for peak loads, it results in insufficient resource utilization and energy waste. Virtualized technology makes it possible that intelligent energy perception network could be deployed and resource sharing could become an effective energy saving technology. How to make more small cells into sleeping state for energy saving in ultradense small cell system has become a research hot spot. Based on the mapping feature of virtualized network, a new wireless resource mapping algorithm for saving energy in ultradense small cells has been put forward when wireless resource amount is satisfied in every small cell. First of all, the method divides the virtual cells. Again through the alternate updating between small cell mapping and wireless resource allocation, least amount of small cells is used and other small cells turn into sleeping state on the premise of guaranteeing users’ QoS. Next, the energy consumption of the wireless access system, wireless resource utilization, and the convergence of the proposed algorithm are analyzed in theory. Finally, the simulation results demonstrate that the algorithm can effectively reduce the system energy consumption and required wireless resource amount under the condition of satisfying users’ QoS.

Stream network responses to evapotranspiration in mountain systems: evidence from spatially-distributed network mapping and sapflow measurements

Science.gov (United States)

Godsey, S.; Whiting, J. A.; Reinhardt, K.

2015-12-01

Stream networks respond to decreased inputs by shrinking from their headwaters and disconnecting along their length. Both the relative stability of the stream network and the degree of disconnection along the network length can strongly affect stream ecology, including fish migration and nutrient spiraling. Previous data suggests that stream network lengths decrease measurably as discharge decreases, and that evapotranspiration may be an important control on stream network persistence. We hypothesized that changes in sapflow timing and magnitude across a gradient from rain-dominated to snow-dominated elevations would be reflected in the stability of the stream network in a steep watershed draining to the Middle Fork Salmon in central Idaho. We expected that the relative timing of water availability across the gradient would drive differences in water delivery to both trees and the stream network. Here we present results that highlight the stability of sapflow timing across the gradient and persistence of the stream network at this site. We discuss geologic controls on network stability and present a conceptual framework identifying characteristics of stable flowheads. We test this framework at four sites in central Idaho with mapped stream networks. We also discuss late summer sapflow patterns across the elevation gradient and their linkages to soil and atmospheric characteristics. Finally, we compare these patterns to those observed at other sites and discuss the role of vegetation in controlling spatiotemporal patterns across the stream network.

Mahalanobis Distance Based Iterative Closest Point

DEFF Research Database (Denmark)

Hansen, Mads Fogtmann; Blas, Morten Rufus; Larsen, Rasmus

2007-01-01

the notion of a mahalanobis distance map upon a point set with associated covariance matrices which in addition to providing correlation weighted distance implicitly provides a method for assigning correspondence during alignment. This distance map provides an easy formulation of the ICP problem that permits...... a fast optimization. Initially, the covariance matrices are set to the identity matrix, and all shapes are aligned to a randomly selected shape (equivalent to standard ICP). From this point the algorithm iterates between the steps: (a) obtain mean shape and new estimates of the covariance matrices from...... the aligned shapes, (b) align shapes to the mean shape. Three different methods for estimating the mean shape with associated covariance matrices are explored in the paper. The proposed methods are validated experimentally on two separate datasets (IMM face dataset and femur-bones). The superiority of ICP...

Staff Recall Travel Time for ST Elevation Myocardial Infarction Impacted by Traffic Congestion and Distance: A Digitally Integrated Map Software Study.

Science.gov (United States)

Cole, Justin; Beare, Richard; Phan, Thanh G; Srikanth, Velandai; MacIsaac, Andrew; Tan, Christianne; Tong, David; Yee, Susan; Ho, Jesslyn; Layland, Jamie

2017-01-01

Recent evidence suggests hospitals fail to meet guideline specified time to percutaneous coronary intervention (PCI) for a proportion of ST elevation myocardial infarction (STEMI) presentations. Implicit in achieving this time is the rapid assembly of crucial catheter laboratory staff. As a proof-of-concept, we set out to create regional maps that graphically show the impact of traffic congestion and distance to destination on staff recall travel times for STEMI, thereby producing a resource that could be used by staff to improve reperfusion time for STEMI. Travel times for staff recalled to one inner and one outer metropolitan hospital at midnight, 6 p.m., and 7 a.m. were estimated using Google Maps Application Programming Interface. Computer modeling predictions were overlaid on metropolitan maps showing color coded staff recall travel times for STEMI, occurring within non-peak and peak hour traffic congestion times. Inner metropolitan hospital staff recall travel times were more affected by traffic congestion compared with outer metropolitan times, and the latter was more affected by distance. The estimated mean travel times to hospital during peak hour were greater than midnight travel times by 13.4 min to the inner and 6.0 min to the outer metropolitan hospital at 6 p.m. ( p  travel time can predict optimal residence of staff when on-call for PCI.

Gender differences in working memory networks: a BrainMap meta-analysis.

Science.gov (United States)

Hill, Ashley C; Laird, Angela R; Robinson, Jennifer L

2014-10-01

Gender differences in psychological processes have been of great interest in a variety of fields. While the majority of research in this area has focused on specific differences in relation to test performance, this study sought to determine the underlying neurofunctional differences observed during working memory, a pivotal cognitive process shown to be predictive of academic achievement and intelligence. Using the BrainMap database, we performed a meta-analysis and applied activation likelihood estimation to our search set. Our results demonstrate consistent working memory networks across genders, but also provide evidence for gender-specific networks whereby females consistently activate more limbic (e.g., amygdala and hippocampus) and prefrontal structures (e.g., right inferior frontal gyrus), and males activate a distributed network inclusive of more parietal regions. These data provide a framework for future investigations using functional or effective connectivity methods to elucidate the underpinnings of gender differences in neural network recruitment during working memory tasks. Copyright © 2014 Elsevier B.V. All rights reserved.

Enhancement of Adaptive Cluster Hierarchical Routing Protocol using Distance and Energy for Wireless Sensor Networks

International Nuclear Information System (INIS)

Nawar, N.M.; Soliman, S.E.; Kelash, H.M.; Ayad, N.M.

2014-01-01

The application of wireless networking is widely used in nuclear applications. This includes reactor control and fire dedication system. This paper is devoted to the application of this concept in the intrusion system of the Radioisotope Production Facility (RPF) of the Egyptian Atomic Energy Authority. This includes the tracking, monitoring and control components of this system. The design and implementation of wireless sensor networks has become a hot area of research due to the extensive use of sensor networks to enable applications that connect the physical world to the virtual world [1-2]. The original LEACH is named a communication protocol (clustering-based); the extended LEACH’s stochastic cluster head selection algorithm by a deterministic component. Depending on the network configuration an increase of network lifetime can be accomplished [3]. The proposed routing mechanisms after enhancement divide the nodes into clusters. A cluster head performs its task which is considerably more energy-intensive than the rest of the nodes inside sensor network. So, nodes rotate tasks at different rounds between a cluster head and other sensors throughout the lifetime of the network to balance the energy dissipation [4-5].The performance improvement when using routing protocol after enhancement of the algorithm which takes into consideration the distance and the remaining energy for choosing the cluster head by obtains from the advertise message. Network Simulator (Ns2 simulator) is used to prove that LEACH after enhancement performs better than the original LEACH protocol in terms of Average Energy, Network Life Time, Delay, Throughput and Overhead.

Overlapping community detection based on link graph using distance dynamics

Science.gov (United States)

Chen, Lei; Zhang, Jing; Cai, Li-Jun

2018-01-01

The distance dynamics model was recently proposed to detect the disjoint community of a complex network. To identify the overlapping structure of a network using the distance dynamics model, an overlapping community detection algorithm, called L-Attractor, is proposed in this paper. The process of L-Attractor mainly consists of three phases. In the first phase, L-Attractor transforms the original graph to a link graph (a new edge graph) to assure that one node has multiple distances. In the second phase, using the improved distance dynamics model, a dynamic interaction process is introduced to simulate the distance dynamics (shrink or stretch). Through the dynamic interaction process, all distances converge, and the disjoint community structure of the link graph naturally manifests itself. In the third phase, a recovery method is designed to convert the disjoint community structure of the link graph to the overlapping community structure of the original graph. Extensive experiments are conducted on the LFR benchmark networks as well as real-world networks. Based on the results, our algorithm demonstrates higher accuracy and quality than other state-of-the-art algorithms.

Fractional Snow Cover Mapping by Artificial Neural Networks and Support Vector Machines

Science.gov (United States)

Çiftçi, B. B.; Kuter, S.; Akyürek, Z.; Weber, G.-W.

2017-11-01

Snow is an important land cover whose distribution over space and time plays a significant role in various environmental processes. Hence, snow cover mapping with high accuracy is necessary to have a real understanding for present and future climate, water cycle, and ecological changes. This study aims to investigate and compare the design and use of artificial neural networks (ANNs) and support vector machines (SVMs) algorithms for fractional snow cover (FSC) mapping from satellite data. ANN and SVM models with different model building settings are trained by using Moderate Resolution Imaging Spectroradiometer surface reflectance values of bands 1-7, normalized difference snow index and normalized difference vegetation index as predictor variables. Reference FSC maps are generated from higher spatial resolution Landsat ETM+ binary snow cover maps. Results on the independent test data set indicate that the developed ANN model with hyperbolic tangent transfer function in the output layer and the SVM model with radial basis function kernel produce high FSC mapping accuracies with the corresponding values of R = 0.93 and R = 0.92, respectively.

A Fuzzy Neural Network Based on Non-Euclidean Distance Clustering for Quality Index Model in Slashing Process

Directory of Open Access Journals (Sweden)

Yuxian Zhang

2015-01-01

Full Text Available The quality index model in slashing process is difficult to build by reason of the outliers and noise data from original data. To the above problem, a fuzzy neural network based on non-Euclidean distance clustering is proposed in which the input space is partitioned into many local regions by the fuzzy clustering based on non-Euclidean distance so that the computation complexity is decreased, and fuzzy rule number is determined by validity function based on both the separation and the compactness among clusterings. Then, the premise parameters and consequent parameters are trained by hybrid learning algorithm. The parameters identification is realized; meanwhile the convergence condition of consequent parameters is obtained by Lyapunov function. Finally, the proposed method is applied to build the quality index model in slashing process in which the experimental data come from the actual slashing process. The experiment results show that the proposed fuzzy neural network for quality index model has lower computation complexity and faster convergence time, comparing with GP-FNN, BPNN, and RBFNN.

Image Fusion Based on the Self-Organizing Feature Map Neural Networks

Institute of Scientific and Technical Information of China (English)

ZHANG Zhaoli; SUN Shenghe

2001-01-01

This paper presents a new image datafusion scheme based on the self-organizing featuremap (SOFM) neural networks.The scheme consists ofthree steps:(1) pre-processing of the images,whereweighted median filtering removes part of the noisecomponents corrupting the image,(2) pixel clusteringfor each image using two-dimensional self-organizingfeature map neural networks,and (3) fusion of the im-ages obtained in Step (2) utilizing fuzzy logic,whichsuppresses the residual noise components and thusfurther improves the image quality.It proves thatsuch a three-step combination offers an impressive ef-fectiveness and performance improvement,which isconfirmed by simulations involving three image sen-sors (each of which has a different noise structure).

MAP3S precipitation chemistry network: fourth periodic summary report (1980)

Energy Technology Data Exchange (ETDEWEB)

1981-12-01

This, the fourth in a series of summary reports, contains complete field and chemical data from the MAP3S/RAINE (Multistate Atmospheric Power Production Pollution Studies) Precipitation Chemistry Network for the year 1980. The 1980 data were added to the previous data base, and an update of the previous statistical summary completed. Included are basic statistics, time trend analyses, and monthly averages.

Combination of evidence in recommendation systems characterized by distance functions

Energy Technology Data Exchange (ETDEWEB)

Rocha, L. M. (Luis Mateus)

2002-01-01

Recommendation systems for different Document Networks (DN) such as the World Wide Web (WWW), Digitnl Libarries, or Scientific Databases, often make use of distance functions extracted from relationships among documents and between documents and semantic tags. For instance, documents In the WWW are related via a hyperlink network, while documents in bibliographic databases are related by citation and collaboration networks.Furthermore, documents can be related to semantic tags such as keywords used to describe their content, The distance functions computed from these relations establish associative networks among items of the DN, and allow recommendation systems to identify relevant associations for iudividoal users. The process of recommendation can be improved by integrating associative data from different sources. Thus we are presented with a problem of combining evidence (about assochaons between items) from different sonrces characterized by distance functions. In this paper we summarize our work on (1) inferring associations from semi-metric distance functions and (2) combining evidence from different (distance) associative DN.

Distance Learning: Are We Being Realistic?

Science.gov (United States)

Oblinger, Diana; Kidwell, Jill

2000-01-01

Presents conceptual frameworks for discussing distance education. Considers the networked environment; the higher education market; rationales for distance education, including expanding access to educational and training needs; learner segments, including lifelong learners and professional development; indicators of institutional readiness;…

Synergy Maps: exploring compound combinations using network-based visualization.

Science.gov (United States)

Lewis, Richard; Guha, Rajarshi; Korcsmaros, Tamás; Bender, Andreas

2015-01-01

The phenomenon of super-additivity of biological response to compounds applied jointly, termed synergy, has the potential to provide many therapeutic benefits. Therefore, high throughput screening of compound combinations has recently received a great deal of attention. Large compound libraries and the feasibility of all-pairs screening can easily generate large, information-rich datasets. Previously, these datasets have been visualized using either a heat-map or a network approach-however these visualizations only partially represent the information encoded in the dataset. A new visualization technique for pairwise combination screening data, termed "Synergy Maps", is presented. In a Synergy Map, information about the synergistic interactions of compounds is integrated with information about their properties (chemical structure, physicochemical properties, bioactivity profiles) to produce a single visualization. As a result the relationships between compound and combination properties may be investigated simultaneously, and thus may afford insight into the synergy observed in the screen. An interactive web app implementation, available at http://richlewis42.github.io/synergy-maps, has been developed for public use, which may find use in navigating and filtering larger scale combination datasets. This tool is applied to a recent all-pairs dataset of anti-malarials, tested against Plasmodium falciparum, and a preliminary analysis is given as an example, illustrating the disproportionate synergism of histone deacetylase inhibitors previously described in literature, as well as suggesting new hypotheses for future investigation. Synergy Maps improve the state of the art in compound combination visualization, by simultaneously representing individual compound properties and their interactions. The web-based tool allows straightforward exploration of combination data, and easier identification of correlations between compound properties and interactions.

Invertebrate diversity classification using self-organizing map neural network: with some special topological functions

Directory of Open Access Journals (Sweden)

WenJun Zhang

2014-06-01

Full Text Available In present study we used self-organizing map (SOM neural network to conduct the non-supervisory clustering of invertebrate orders in rice field. Four topological functions, i.e., cossintopf, sincostopf, acossintopf, and expsintopf, established on the template in toolbox of Matlab, were used in SOM neural network learning. Results showed that clusters were different when using different topological functions because different topological functions will generate different spatial structure of neurons in neural network. We may chose these functions and results based on comparison with the practical situation.

MOST-visualization: software for producing automated textbook-style maps of genome-scale metabolic networks.

Science.gov (United States)

Kelley, James J; Maor, Shay; Kim, Min Kyung; Lane, Anatoliy; Lun, Desmond S

2017-08-15

Visualization of metabolites, reactions and pathways in genome-scale metabolic networks (GEMs) can assist in understanding cellular metabolism. Three attributes are desirable in software used for visualizing GEMs: (i) automation, since GEMs can be quite large; (ii) production of understandable maps that provide ease in identification of pathways, reactions and metabolites; and (iii) visualization of the entire network to show how pathways are interconnected. No software currently exists for visualizing GEMs that satisfies all three characteristics, but MOST-Visualization, an extension of the software package MOST (Metabolic Optimization and Simulation Tool), satisfies (i), and by using a pre-drawn overview map of metabolism based on the Roche map satisfies (ii) and comes close to satisfying (iii). MOST is distributed for free on the GNU General Public License. The software and full documentation are available at http://most.ccib.rutgers.edu/. dslun@rutgers.edu. Supplementary data are available at Bioinformatics online. © The Author (2017). Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com

The smart grid research network: Road map for Smart Grid research, development and demonstration up to 2020

Energy Technology Data Exchange (ETDEWEB)

Troi, A. [Technical Univ. of Denmark. DTU Electrical Engineering, DTU Risoe Campus, Roskilde (Denmark); Noerregaard Joergensen, B. [Syddansk Univ. (SDU), Odense (Denmark); Mahler Larsen, E. [Technical Univ. of Denmark. DTU Electrical Engineering, Kgs. Lyngby (Denmark)] [and others

2013-01-15

This road map is a result of part-recommendation no. 25 in 'MAIN REPORT - The Smart Grid Network's recommendations', written by the Smart Grid Network for the Danish Ministry of Climate, Energy and Building in October 2011. This part-recommendation states: ''Part-recommendation 25 - A road map for Smart Grid research, development and demonstration It is recommended that the electricity sector invite the Ministry to participate in the creation of a road map to ensure that solutions are implemented and coordinated with related policy areas. The sector should also establish a fast-acting working group with representatives from universities, distribution companies and the electric industry, in order to produce a mutual, binding schedule for the RDD of the Smart Grid in Denmark. Time prioritisation of part-recommendation: 2011-2012 Responsibility for implementation of part-recommendation: Universities, along with relevant electric-industry actors, should establish a working group for the completion of a consolidated road map by the end of 2012.'' In its work on this report, the Smart Grid Research Network has focused particularly on part-recommendations 26, 27 and 28 in 'MAIN REPORT - The Smart Grid Network's recommendations', which relate to strengthening and marketing the research infrastructure that will position Denmark as the global hub for Smart Grid development; strengthening basic research into the complex relationships in electric systems with large quantities of independent parties; and improved understanding of consumer behaviour and social economics. Naturally the work has spread to related areas along the way. The work has been conducted by the Smart Grid Research Network. (Author)

Indoor Positioning System Using Depth Maps and Wireless Networks

Directory of Open Access Journals (Sweden)

Jaime Duque Domingo

2016-01-01

Full Text Available This work presents a new Indoor Positioning System (IPS based on the combination of WiFi Positioning System (WPS and depth maps, for estimating the location of people. The combination of both technologies improves the efficiency of existing methods, based uniquely on wireless positioning techniques. While other positioning systems force users to wear special devices, the system proposed in this paper just requires the use of smartphones, besides the installation of RGB-D sensors in the sensing area. Furthermore, the system is not intrusive, being not necessary to know people’s identity. The paper exposes the method developed for putting together and exploiting both types of sensory information with positioning purposes: the measurements of the level of the signal received from different access points (APs of the wireless network and the depth maps provided by the RGB-D cameras. The obtained results show a significant improvement in terms of positioning with respect to common WiFi-based systems.

No Man is an Island: Social Distance, Network Flow, and Other-Regarding Behaviors in a Natural Field Experiment

Directory of Open Access Journals (Sweden)

XIAOYE LI

2012-01-01

Full Text Available A natural field experiment is designed to explore the impacts of social distanceand network flow on other-regarding behaviors. A greater degree ofcommunication between the voluntary organization and volunteers was found toreduce their social distance and thereby improve volunteering commitment. Theimprovement was even more notable if the party initiating communication was thevoluntary organization. Two other practical means of lessening social distancewere for volunteers to learn more about other volunteers, and for informationtobe dispersed throughout the organization more rapidly. Additionally, this studyshows a reversed “U-shaped” relationship between network flow and volunteeringcommitment.

A comparison of genetic map distance and linkage disequilibrium between 15 polymorphic dinucleotide repeat loci in two populations

Energy Technology Data Exchange (ETDEWEB)

Urbanek, M.; Goldman, D.; Long, J.C. [Lab. of Neurogenetics, Rockville, MD (United States)

1994-09-01

Linkage disequilibrium has recently been used to map the diastrophic dysplasia gene in a Finnish sample. One advantage of this method is that the large pedigrees required by some other methods are unnecessary. Another advantage is that linkage disequilibrium mapping capitalizes on the cumulative history of recombination events, rather than those occurring within the sampled individuals. A potential limitation of linkage disequilibrium mapping is that linkage equilibrium is likely to prevail in all but the most isolated populations, e.g., those which have recently experienced founder effects or severe population bottlenecks. In order to test the method`s generality, we examined patterns of linkage disequilibrium between pairs of loci within a known genetic map. Two populations were analyzed. The first population, Navajo Indians (N=45), is an isolate that experienced a severe bottleneck in the 1860`s. The second population, Maryland Caucasians (N=45), is cosmopolitan. We expected the Navajo sample to display more linkage disequilibrium than the Caucasian sample, and possibly that the Navajo disequilibrium pattern would reflect the genetic map. Linkage disequilibrium coefficients were estimated between pairs of alleles at different loci using maximum likelihood. The genetic isolate structure of Navajo Indians is confirmed by the DNA typings. Heterozygosity is lower than in the Caucasians, and fewer different alleles are observed. However, a relationship between genetic map distance and linkage disequilibrium could be discerned in neither the Navajo nor the Maryland samples. Slightly more linkage disequilibrium was observed in the Navajos, but both data sets were characterized by very low disequilibrium levels. We tentatively conclude that linkage disequilibrium mapping with dinucleotide repeats will only be useful with close linkage between markers and diseases, even in very isolated populations.

A Replica Detection Scheme Based on the Deviation in Distance Traveled Sliding Window for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Alekha Kumar Mishra

2017-01-01

Full Text Available Node replication attack possesses a high level of threat in wireless sensor networks (WSNs and it is severe when the sensors are mobile. A limited number of replica detection schemes in mobile WSNs (MWSNs have been reported till date, where most of them are centralized in nature. The centralized detection schemes use time-location claims and the base station (BS is solely responsible for detecting replica. Therefore, these schemes are prone to single point of failure. There is also additional communication overhead associated with sending time-location claims to the BS. A distributed detection mechanism is always a preferred solution to the above kind of problems due to significantly lower communication overhead than their counterparts. In this paper, we propose a distributed replica detection scheme for MWSNs. In this scheme, the deviation in the distance traveled by a node and its replica is recorded by the observer nodes. Every node is an observer node for some nodes in the network. Observers are responsible for maintaining a sliding window of recent time-distance broadcast of the nodes. A replica is detected by an observer based on the degree of violation computed from the deviations recorded using the time-distance sliding window. The analysis and simulation results show that the proposed scheme is able to achieve higher detection probability compared to distributed replica detection schemes such as Efficient Distributed Detection (EDD and Multi-Time-Location Storage and Diffusion (MTLSD.

Distance-Based Phylogenetic Methods Around a Polytomy.

Science.gov (United States)

Davidson, Ruth; Sullivant, Seth

2014-01-01

Distance-based phylogenetic algorithms attempt to solve the NP-hard least-squares phylogeny problem by mapping an arbitrary dissimilarity map representing biological data to a tree metric. The set of all dissimilarity maps is a Euclidean space properly containing the space of all tree metrics as a polyhedral fan. Outputs of distance-based tree reconstruction algorithms such as UPGMA and neighbor-joining are points in the maximal cones in the fan. Tree metrics with polytomies lie at the intersections of maximal cones. A phylogenetic algorithm divides the space of all dissimilarity maps into regions based upon which combinatorial tree is reconstructed by the algorithm. Comparison of phylogenetic methods can be done by comparing the geometry of these regions. We use polyhedral geometry to compare the local nature of the subdivisions induced by least-squares phylogeny, UPGMA, and neighbor-joining when the true tree has a single polytomy with exactly four neighbors. Our results suggest that in some circumstances, UPGMA and neighbor-joining poorly match least-squares phylogeny.

Pareto distance for multi-layer network analysis

DEFF Research Database (Denmark)

Magnani, Matteo; Rossi, Luca

2013-01-01

services, e.g., Facebook, Twitter, LinkedIn and Foursquare. As a result, the analysis of on-line social networks requires a wider scope and, more technically speaking, models for the representation of this fragmented scenario. The recent introduction of more realistic layered models has however determined......Social Network Analysis has been historically applied to single networks, e.g., interaction networks between co-workers. However, the advent of on-line social network sites has emphasized the stratified structure of our social experience. Individuals usually spread their identities over multiple...

A Mobile Sensor Network to Map CO2 in Urban Environments

Science.gov (United States)

Lee, J.; Christen, A.; Nesic, Z.; Ketler, R.

2014-12-01

Globally, an estimated 80% of all fuel-based CO2 emissions into the atmosphere are attributable to cities, but there is still a lack of tools to map, visualize and monitor emissions to the scales at which emissions reduction strategies can be implemented - the local and urban scale. Mobile CO2 sensors, such as those attached to taxis and other existing mobile platforms, may be a promising way to observe and map CO2 mixing ratios across heterogenous urban environments with a limited number of sensors. Emerging modular open source technologies, and inexpensive compact sensor components not only enable rapid prototyping and replication, but also are allowing for the miniaturization and mobilization of traditionally fixed sensor networks. We aim to optimize the methods and technologies for monitoring CO2 in cities using a network of CO2 sensors deployable on vehicles and bikes. Our sensor technology is contained in a compact weather-proof case (35.8cm x 27.8cm x 11.8cm), powered independently by battery or by car, and includes the Li-Cor Li-820 infrared gas analyzer (Licor Inc, lincoln, NB, USA), Arduino Mega microcontroller (Arduino CC, Italy) and Adafruit GPS (Adafruit Technologies, NY, USA), and digital air temperature thermometer which measure CO2 mixing ratios (ppm), geolocation and speed, pressure and temperature, respectively at 1-second intervals. With the deployment of our sensor technology, we will determine if such a semi-autonomous mobile approach to monitoring CO2 in cities can determine excess urban CO2 mixing ratios (i.e. the 'urban CO2 dome') when compared to values measured at a fixed, remote background site. We present results from a pilot study in Vancouver, BC, where the a network of our new sensors was deployed both in fixed network and in a mobile campaign and examine the spatial biases of the two methods.

Landslide Susceptibility Mapping of Tegucigalpa, Honduras Using Artificial Neural Network, Bayesian Network and Decision Trees

Science.gov (United States)

Garcia Urquia, E. L.; Braun, A.; Yamagishi, H.

2016-12-01

Tegucigalpa, the capital city of Honduras, experiences rainfall-induced landslides on a yearly basis. The high precipitation regime and the rugged topography the city has been built in couple with the lack of a proper urban expansion plan to contribute to the occurrence of landslides during the rainy season. Thousands of inhabitants live at risk of losing their belongings due to the construction of precarious shelters in landslide-prone areas on mountainous terrains and next to the riverbanks. Therefore, the city is in the need for landslide susceptibility and hazard maps to aid in the regulation of future development. Major challenges in the context of highly dynamic urbanizing areas are the overlap of natural and anthropogenic slope destabilizing factors, as well as the availability and accuracy of data. Data-driven multivariate techniques have proven to be powerful in discovering interrelations between factors, identifying important factors in large datasets, capturing non-linear problems and coping with noisy and incomplete data. This analysis focuses on the creation of a landslide susceptibility map using different methods from the field of data mining, Artificial Neural Networks (ANN), Bayesian Networks (BN) and Decision Trees (DT). The input dataset of the study contains geomorphological and hydrological factors derived from a digital elevation model with a 10 m resolution, lithological factors derived from a geological map, and anthropogenic factors, such as information on the development stage of the neighborhoods in Tegucigalpa and road density. Moreover, a landslide inventory map that was developed in 2014 through aerial photo interpretation was used as target variable in the analysis. The analysis covers an area of roughly 100 km2, while 8.95 km2 are occupied by landslides. In a first step, the dataset was explored by assessing and improving the data quality, identifying unimportant variables and finding interrelations. Then, based on a training

Mapping dynamic social networks in real life using participants' own smartphones

Directory of Open Access Journals (Sweden)

Tjeerd W. Boonstra

2015-11-01

Full Text Available Interpersonal relationships are vital for our daily functioning and wellbeing. Social networks may form the primary means by which environmental influences determine individual traits. Several studies have shown the influence of social networks on decision-making, behaviors and wellbeing. Smartphones have great potential for measuring social networks in a real world setting. Here we tested the feasibility of using people's own smartphones as a data collection platform for face-to-face interactions. We developed an application for iOS and Android to collect Bluetooth data and acquired one week of data from 14 participants in our organization. The Bluetooth scanning statistics were used to quantify the time-resolved connection strength between participants and define the weights of a dynamic social network. We used network metrics to quantify changes in network topology over time and non-negative matrix factorization to identify cliques or subgroups that reoccurred during the week. The scanning rate varied considerably between smartphones running Android and iOS and egocentric networks metrics were correlated with the scanning rate. The time courses of two identified subgroups matched with two meetings that took place that week. These findings demonstrate the feasibility of using participants' own smartphones to map social network, whilst identifying current limitations of using generic smartphones. The bias introduced by variations in scanning rate and missing data is an important limitation that needs to be addressed in future studies.

Trajectory mapping of middle atmospheric water vapor by a mini network of NDACC instruments

Directory of Open Access Journals (Sweden)

M. Lainer

2015-08-01

Full Text Available The important task to observe the global coverage of middle atmospheric trace gases like water vapor or ozone usually is accomplished by satellites. Climate and atmospheric studies rely upon the knowledge of trace gas distributions throughout the stratosphere and mesosphere. Many of these gases are currently measured from satellites, but it is not clear whether this capability will be maintained in the future. This could lead to a significant knowledge gap of the state of the atmosphere. We explore the possibilities of mapping middle atmospheric water vapor in the Northern Hemisphere by using Lagrangian trajectory calculations and water vapor profile data from a small network of five ground-based microwave radiometers. Four of them are operated within the frame of NDACC (Network for the Detection of Atmospheric Composition Change. Keeping in mind that the instruments are based on different hardware and calibration setups, a height-dependent bias of the retrieved water vapor profiles has to be expected among the microwave radiometers. In order to correct and harmonize the different data sets, the Microwave Limb Sounder (MLS on the Aura satellite is used to serve as a kind of traveling standard. A domain-averaging TM (trajectory mapping method is applied which simplifies the subsequent validation of the quality of the trajectory-mapped water vapor distribution towards direct satellite observations. Trajectories are calculated forwards and backwards in time for up to 10 days using 6 hourly meteorological wind analysis fields. Overall, a total of four case studies of trajectory mapping in different meteorological regimes are discussed. One of the case studies takes place during a major sudden stratospheric warming (SSW accompanied by the polar vortex breakdown; a second takes place after the reformation of stable circulation system. TM cases close to the fall equinox and June solstice event from the year 2012 complete the study, showing the high

Traveling salesman problems with PageRank Distance on complex networks reveal community structure

Science.gov (United States)

Jiang, Zhongzhou; Liu, Jing; Wang, Shuai

2016-12-01

In this paper, we propose a new algorithm for community detection problems (CDPs) based on traveling salesman problems (TSPs), labeled as TSP-CDA. Since TSPs need to find a tour with minimum cost, cities close to each other are usually clustered in the tour. This inspired us to model CDPs as TSPs by taking each vertex as a city. Then, in the final tour, the vertices in the same community tend to cluster together, and the community structure can be obtained by cutting the tour into a couple of paths. There are two challenges. The first is to define a suitable distance between each pair of vertices which can reflect the probability that they belong to the same community. The second is to design a suitable strategy to cut the final tour into paths which can form communities. In TSP-CDA, we deal with these two challenges by defining a PageRank Distance and an automatic threshold-based cutting strategy. The PageRank Distance is designed with the intrinsic properties of CDPs in mind, and can be calculated efficiently. In the experiments, benchmark networks with 1000-10,000 nodes and varying structures are used to test the performance of TSP-CDA. A comparison is also made between TSP-CDA and two well-established community detection algorithms. The results show that TSP-CDA can find accurate community structure efficiently and outperforms the two existing algorithms.

Route planning with transportation network maps: an eye-tracking study.

Science.gov (United States)

Grison, Elise; Gyselinck, Valérie; Burkhardt, Jean-Marie; Wiener, Jan Malte

2017-09-01

Planning routes using transportation network maps is a common task that has received little attention in the literature. Here, we present a novel eye-tracking paradigm to investigate psychological processes and mechanisms involved in such a route planning. In the experiment, participants were first presented with an origin and destination pair before we presented them with fictitious public transportation maps. Their task was to find the connecting route that required the minimum number of transfers. Based on participants' gaze behaviour, each trial was split into two phases: (1) the search for origin and destination phase, i.e., the initial phase of the trial until participants gazed at both origin and destination at least once and (2) the route planning and selection phase. Comparisons of other eye-tracking measures between these phases and the time to complete them, which depended on the complexity of the planning task, suggest that these two phases are indeed distinct and supported by different cognitive processes. For example, participants spent more time attending the centre of the map during the initial search phase, before directing their attention to connecting stations, where transitions between lines were possible. Our results provide novel insights into the psychological processes involved in route planning from maps. The findings are discussed in relation to the current theories of route planning.

Characterization of the spatial structure of local functional connectivity using multi-distance average correlation measures.

Science.gov (United States)

Macia, Didac; Pujol, Jesus; Blanco-Hinojo, Laura; Martínez-Vilavella, Gerard; Martín-Santos, Rocío; Deus, Joan

2018-04-24

There is ample evidence from basic research in neuroscience of the importance of local cortico-cortical networks. Millimetric resolution is achievable with current functional MRI (fMRI) scanners and sequences, and consequently a number of "local" activity similarity measures have been defined to describe patterns of segregation and integration at this spatial scale. We have introduced the use of Iso-Distant local Average Correlation (IDAC), easily defined as the average fMRI temporal correlation of a given voxel with other voxels placed at increasingly separated iso-distant intervals, to characterize the curve of local fMRI signal similarities. IDAC curves can be statistically compared using parametric multivariate statistics. Furthermore, by using RGB color-coding to display jointly IDAC values belonging to three different distance lags, IDAC curves can also be displayed as multi-distance IDAC maps. We applied IDAC analysis to a sample of 41 subjects scanned under two different conditions, a resting state and an auditory-visual continuous stimulation. Multi-distance IDAC mapping was able to discriminate between gross anatomo-functional cortical areas and, moreover, was sensitive to modulation between the two brain conditions in areas known to activate and de-activate during audio-visual tasks. Unlike previous fMRI local similarity measures already in use, our approach draws special attention to the continuous smooth pattern of local functional connectivity.

Determination of the complexity of distance weights in Mexican city systems

Directory of Open Access Journals (Sweden)

Igor Lugo

2017-03-01

Full Text Available This study tests distance weights based on the economic geography assumption of straight lines and the complex networks approach of empirical road segments in the Mexican system of cities to determine the best distance specification. We generated network graphs by using geospatial data and computed weights by measuring shortest paths, thereby characterizing their probability distributions and comparing them with spatial null models. Findings show that distributions are sufficiently different and are associated with asymmetrical beta distributions. Straight lines over- and underestimated distances compared to the empirical data, and they showed compatibility with random models. Therefore, accurate distance weights depend on the type of the network specification.

Map as a Service: A Framework for Visualising and Maximising Information Return from Multi-ModalWireless Sensor Networks

Directory of Open Access Journals (Sweden)

Mohammad Hammoudeh

2015-09-01

Full Text Available This paper presents a distributed information extraction and visualisation service, called the mapping service, for maximising information return from large-scale wireless sensor networks. Such a service would greatly simplify the production of higher-level, information-rich, representations suitable for informing other network services and the delivery of field information visualisations. The mapping service utilises a blend of inductive and deductive models to map sense data accurately using externally available knowledge. It utilises the special characteristics of the application domain to render visualisations in a map format that are a precise reflection of the concrete reality. This service is suitable for visualising an arbitrary number of sense modalities. It is capable of visualising from multiple independent types of the sense data to overcome the limitations of generating visualisations from a single type of sense modality. Furthermore, the mapping service responds dynamically to changes in the environmental conditions, which may affect the visualisation performance by continuously updating the application domain model in a distributed manner. Finally, a distributed self-adaptation function is proposed with the goal of saving more power and generating more accurate data visualisation. We conduct comprehensive experimentation to evaluate the performance of our mapping service and show that it achieves low communication overhead, produces maps of high fidelity, and further minimises the mapping predictive error dynamically through integrating the application domain model in the mapping service.

Resting state cortico-cerebellar functional connectivity networks: A comparison of anatomical and self-organizing map approaches

Directory of Open Access Journals (Sweden)

Jessica A Bernard

2012-08-01

Full Text Available The cerebellum plays a role in a wide variety of complex behaviors. In order to better understand the role of the cerebellum in human behavior, it is important to know how this structure interacts with cortical and other subcortical regions of the brain. To date, several studies have investigated the cerebellum using resting-state functional connectivity magnetic resonance imaging (fcMRI; Buckner et al., 2011; Krienen & Buckner, 2009; O’Reilly et al., 2009. However, none of this work has taken an anatomically-driven approach. Furthermore, though detailed maps of cerebral cortex and cerebellum networks have been proposed using different network solutions based on the cerebral cortex (Buckner et al., 2011, it remains unknown whether or not an anatomical lobular breakdown best encompasses the networks of the cerebellum. Here, we used fcMRI to create an anatomically-driven cerebellar connectivity atlas. Timecourses were extracted from the lobules of the right hemisphere and vermis. We found distinct networks for the individual lobules with a clear division into motor and non-motor regions. We also used a self-organizing map algorithm to parcellate the cerebellum. This allowed us to investigate redundancy and independence of the anatomically identified cerebellar networks. We found that while anatomical boundaries in the anterior cerebellum provide functional subdivisions of a larger motor grouping defined using our self-organizing map algorithm, in the posterior cerebellum, the lobules were made up of sub-regions associated with distinct functional networks. Together, our results indicate that the lobular boundaries of the human cerebellum are not indicative of functional boundaries, though anatomical divisions can be useful, as is the case of the anterior cerebellum. Additionally, driving the analyses from the cerebellum is key to determining the complete picture of functional connectivity within the structure.

Minimum Map of Social Institutional Network: a multidimensional strategy for research in Nursing.

Science.gov (United States)

Carlos, Diene Monique; Pádua, Elisabete Matallo Marchesini de; Nakano, Ana Márcia Spanó; Ferriani, Maria das Graças Carvalho

2016-06-01

To analyze the use of methodological strategies in qualitative research - Minimum Maps of Social Institutional Network, as proposed to understand the phenomena in the multidimensional perspective. Methodological theoretical essay in which we aimed to reflect on the use of innovative methodological strategies in nursing research, supported in Complex Paradigm fundamentals. The minimum map of Social Institutional External Network aims to identify institutional linkages and gaps for the intervention work of the surveyed institutions. The use of these maps provided important advances in know-how qualitative research in Health and Nursing. In this perspective, the use of minimum Social Intitutional Network maps can be stimulated and enhanced to meet the current demands of the contemporary world, particularly for its flexibility in adapting to various research subjects; breadth and depth of discussion; and possibilities with health services. Analisar o uso de estratégias metodológicas em pesquisas qualitativas - Mapa mínimo da Rede Social Institucional, como proposta para compreender os fenômenos na perspectiva multidimensional. Ensaio teórico metodológico em que buscou-se refletir sobre o uso de estratégias metodológicas inovadoras de pesquisa na enfermagem, sustentada nos fundamentos do Pensamento Complexo. O mapa mínimo da Rede Social Institucional Externa tem o objetivo de identificar os vínculos institucionais e lacunas para o trabalho de intervenção das instituições pesquisadas. O uso destes mapas proporcionou avanços importantes no saber-fazer pesquisa qualitativa em Saúde e Enfermagem. Nessa perspectiva, o uso de mapas mínimos da Rede Social Institucional pode ser estimulado e potencializado para responder às atuais demandas da contemporaneidade, em especial pela sua flexibilidade na adequação a diversos objetos de pesquisa; amplitude e profundidade de discussão; e possibilidades de articulação com a prática dos serviços.

Project Work in Networked Distance Education

DEFF Research Database (Denmark)

Knudsen, Morten; Helbo, Jan; Jensen, Lars Peter

2000-01-01

devoted to courses and the other half to project work. A computer conference system, LuvitÒ provides facilities for the courses, as well as structured synchronous and asynchronous communication. Eight times per year two-day seminars are held at the university for intensive lectures, project work......Problem oriented project work has been the foundation for the educational system at Aalborg University since its start 25 years ago. The duration of each student project is one semester, and the students spend half of their time working on the project in groups of typically 5-6 persons....... As the experience since then has proven this to be a very successful innovation in higher education [1], it seems to be an obvious idea also to base our new distance educations on the project study form. Traditionally, however, distance education has been characterized by one-way communication and self...

The North Alabama Lightning Mapping Array (LMA): A Network Overview

Science.gov (United States)

Blakeslee, R. J.; Bailey, J.; Buechler, D.; Goodman, S. J.; McCaul, E. W., Jr.; Hall, J.

2005-01-01

The North Alabama Lightning Mapping Array (LMA) is s a 3-D VHF regional lightning detection system that provides on-orbit algorithm validation and instrument performance assessments for the NASA Lightning Imaging Sensor, as well as information on storm kinematics and updraft evolution that offers the potential to improve severe storm warning lead time by up t o 50% and decrease te false alarm r a t e ( for non-tornado producing storms). In support of this latter function, the LMA serves as a principal component of a severe weather test bed to infuse new science and technology into the short-term forecasting of severe and hazardous weather, principally within nearby National Weather Service forecast offices. The LMA, which became operational i n November 2001, consists of VHF receivers deployed across northern Alabama and a base station located at the National Space Science and Technology Center (NSSTC), which is on t h e campus of the University of Alabama in Huntsville. The LMA system locates the sources of impulsive VHF radio signals s from lightning by accurately measuring the time that the signals aririve at the different receiving stations. Each station's records the magnitude and time of the peak lightning radiation signal in successive 80 ms intervals within a local unused television channel (channel 5, 76-82 MHz in our case ) . Typically hundreds of sources per flash can be reconstructed, which i n t u r n produces accurate 3-dimensional lightning image maps (nominally network topology and the links have an effective data throughput rate ranging from 600 kbits s -1 t o 1.5 %its s -1. This presentation provides an overview of t h e North Alabama network, the data processing (both real-time and post processing) and network statistics.

Retrieval algorithm for rainfall mapping from microwave links in a cellular communication network

NARCIS (Netherlands)

Overeem, Aart; Leijnse, Hidde; Uijlenhoet, Remko

2016-01-01

Microwave links in commercial cellular communication networks hold a promise for areal rainfall monitoring and could complement rainfall estimates from ground-based weather radars, rain gauges, and satellites. It has been shown that country-wide (≈ 35 500 km²) 15 min rainfall maps can

Resistance Distances in Vertex-Face Graphs

Science.gov (United States)

Shangguan, Yingmin; Chen, Haiyan

2018-01-01

The computation of two-point resistances in networks is a classical problem in electric circuit theory and graph theory. Let G be a triangulation graph with n vertices embedded on an orientable surface. Define K(G) to be the graph obtained from G by inserting a new vertex vϕ to each face ϕ of G and adding three new edges (u, vϕ), (v, vϕ) and (w, vϕ), where u, v and w are three vertices on the boundary of ϕ. In this paper, using star-triangle transformation and resistance local-sum rules, explicit relations between resistance distances in K(G) and those in G are obtained. These relations enable us to compute resistance distance between any two points of Kk(G) recursively. As explanation examples, some resistances in several networks are computed, including the modified Apollonian network and networks constructed from tetrahedron, octahedron and icosahedron, respectively.

Distributed Sensor Fusion for Scalar Field Mapping Using Mobile Sensor Networks.

Science.gov (United States)

La, Hung Manh; Sheng, Weihua

2013-04-01

In this paper, autonomous mobile sensor networks are deployed to measure a scalar field and build its map. We develop a novel method for multiple mobile sensor nodes to build this map using noisy sensor measurements. Our method consists of two parts. First, we develop a distributed sensor fusion algorithm by integrating two different distributed consensus filters to achieve cooperative sensing among sensor nodes. This fusion algorithm has two phases. In the first phase, the weighted average consensus filter is developed, which allows each sensor node to find an estimate of the value of the scalar field at each time step. In the second phase, the average consensus filter is used to allow each sensor node to find a confidence of the estimate at each time step. The final estimate of the value of the scalar field is iteratively updated during the movement of the mobile sensors via weighted average. Second, we develop the distributed flocking-control algorithm to drive the mobile sensors to form a network and track the virtual leader moving along the field when only a small subset of the mobile sensors know the information of the leader. Experimental results are provided to demonstrate our proposed algorithms.

Mapping cortical mesoscopic networks of single spiking cortical or sub-cortical neurons.

Science.gov (United States)

Xiao, Dongsheng; Vanni, Matthieu P; Mitelut, Catalin C; Chan, Allen W; LeDue, Jeffrey M; Xie, Yicheng; Chen, Andrew Cn; Swindale, Nicholas V; Murphy, Timothy H

2017-02-04

Understanding the basis of brain function requires knowledge of cortical operations over wide-spatial scales, but also within the context of single neurons. In vivo, wide-field GCaMP imaging and sub-cortical/cortical cellular electrophysiology were used in mice to investigate relationships between spontaneous single neuron spiking and mesoscopic cortical activity. We make use of a rich set of cortical activity motifs that are present in spontaneous activity in anesthetized and awake animals. A mesoscale spike-triggered averaging procedure allowed the identification of motifs that are preferentially linked to individual spiking neurons by employing genetically targeted indicators of neuronal activity. Thalamic neurons predicted and reported specific cycles of wide-scale cortical inhibition/excitation. In contrast, spike-triggered maps derived from single cortical neurons yielded spatio-temporal maps expected for regional cortical consensus function. This approach can define network relationships between any point source of neuronal spiking and mesoscale cortical maps.

Network Unfolding Map by Vertex-Edge Dynamics Modeling.

Science.gov (United States)

Verri, Filipe Alves Neto; Urio, Paulo Roberto; Zhao, Liang

2018-02-01

The emergence of collective dynamics in neural networks is a mechanism of the animal and human brain for information processing. In this paper, we develop a computational technique using distributed processing elements in a complex network, which are called particles, to solve semisupervised learning problems. Three actions govern the particles' dynamics: generation, walking, and absorption. Labeled vertices generate new particles that compete against rival particles for edge domination. Active particles randomly walk in the network until they are absorbed by either a rival vertex or an edge currently dominated by rival particles. The result from the model evolution consists of sets of edges arranged by the label dominance. Each set tends to form a connected subnetwork to represent a data class. Although the intrinsic dynamics of the model is a stochastic one, we prove that there exists a deterministic version with largely reduced computational complexity; specifically, with linear growth. Furthermore, the edge domination process corresponds to an unfolding map in such way that edges "stretch" and "shrink" according to the vertex-edge dynamics. Consequently, the unfolding effect summarizes the relevant relationships between vertices and the uncovered data classes. The proposed model captures important details of connectivity patterns over the vertex-edge dynamics evolution, in contrast to the previous approaches, which focused on only vertex or only edge dynamics. Computer simulations reveal that the new model can identify nonlinear features in both real and artificial data, including boundaries between distinct classes and overlapping structures of data.

Shallow and deep convolutional networks for saliency prediction

OpenAIRE

Pan, Junting; Sayrol Clols, Elisa; Giró Nieto, Xavier; McGuinness, Kevin; O'Connor, Noel

2016-01-01

The prediction of salient areas in images has been traditionally addressed with hand-crafted features based on neuroscience principles. This paper, however, addresses the problem with a completely data-driven approach by training a convolutional neural network (convnet). The learning process is formulated as a minimization of a loss function that measures the Euclidean distance of the predicted saliency map with the provided ground truth. The recent publication of large datasets of saliency p...

Long distance quantum teleportation

Science.gov (United States)

Xia, Xiu-Xiu; Sun, Qi-Chao; Zhang, Qiang; Pan, Jian-Wei

2018-01-01

Quantum teleportation is a core protocol in quantum information science. Besides revealing the fascinating feature of quantum entanglement, quantum teleportation provides an ultimate way to distribute quantum state over extremely long distance, which is crucial for global quantum communication and future quantum networks. In this review, we focus on the long distance quantum teleportation experiments, especially those employing photonic qubits. From the viewpoint of real-world application, both the technical advantages and disadvantages of these experiments are discussed.

An Efficient Method for Mapping High-Resolution Global River Discharge Based on the Algorithms of Drainage Network Extraction

Directory of Open Access Journals (Sweden)

Jiaye Li

2018-04-01

Full Text Available River discharge, which represents the accumulation of surface water flowing into rivers and ultimately into the ocean or other water bodies, may have great impacts on water quality and the living organisms in rivers. However, the global knowledge of river discharge is still poor and worth exploring. This study proposes an efficient method for mapping high-resolution global river discharge based on the algorithms of drainage network extraction. Using the existing global runoff map and digital elevation model (DEM data as inputs, this method consists of three steps. First, the pixels of the runoff map and the DEM data are resampled into the same resolution (i.e., 0.01-degree. Second, the flow direction of each pixel of the DEM data (identified by the optimal flow path method used in drainage network extraction is determined and then applied to the corresponding pixel of the runoff map. Third, the river discharge of each pixel of the runoff map is calculated by summing the runoffs of all the pixels in the upstream of this pixel, similar to the upslope area accumulation step in drainage network extraction. Finally, a 0.01-degree global map of the mean annual river discharge is obtained. Moreover, a 0.5-degree global map of the mean annual river discharge is produced to display the results with a more intuitive perception. Compared against the existing global river discharge databases, the 0.01-degree map is of a generally high accuracy for the selected river basins, especially for the Amazon River basin with the lowest relative error (RE of 0.3% and the Yangtze River basin within the RE range of ±6.0%. However, it is noted that the results of the Congo and Zambezi River basins are not satisfactory, with RE values over 90%, and it is inferred that there may be some accuracy problems with the runoff map in these river basins.

Forward and reverse mapping for milling process using artificial neural networks

Directory of Open Access Journals (Sweden)

Rashmi L. Malghan

2018-02-01

Full Text Available The data set presented is related to the milling process of AA6061-4.5%Cu-5%SiCp composite. The data primarily concentrates on predicting values of some machining responses, such as cutting force, surface finish and power utilization utilizing using forward back propagation neural network based approach, i.e. ANN based on three process parameters, such as spindle speed, feed rate and depth of cut.The comparing reverse model is likewise created to prescribe the ideal settings of processing parameters for accomplishing the desired responses as indicated by the necessities of the end clients. These modelling approaches are very proficient to foresee the benefits of machining responses and also process parameter settings in light of the experimental technique. Keywords: ANN, Forward mapping, Reverse mapping, Milling process

A unified approach to mapping and routing on a network-on-chip for both best-effort and guaranteed service traffic

NARCIS (Netherlands)

Hansson, M.A.; Goossens, K.G.W.; Radulescu, A.

2007-01-01

One of the key steps in Network-on-Chip-based design is spatial mapping of cores and routing of the communication between those cores. Known solutions to the mapping and routing problems first map cores onto a topology and then route communication, using separate and possibly conflicting objective

A Unified Approach to Mapping and Routing on a Network-on-Chip for Both Best-Effort and Guaranteed Service Traffic

NARCIS (Netherlands)

Hansson, A.; Goossens, K.; R?dulescu, A.

2007-01-01

One of the key steps in Network-on-Chip-based design is spatial mapping of cores and routing of the communication between those cores. Known solutions to the mapping and routing problems first map cores onto a topology and then route communication, using separate and possibly conflicting objective

CytoViz: an artistic mapping of network measurements as living organisms in a VR application

Science.gov (United States)

López Silva, Brenda A.; Renambot, Luc

2007-02-01

CytoViz is an artistic, real-time information visualization driven by statistical information gathered during gigabit network transfers to the Scalable Adaptive Graphical Environment (SAGE) at various events. Data streams are mapped to cellular organisms defining their structure and behavior as autonomous agents. Network bandwidth drives the growth of each entity and the latency defines its physics-based independent movements. The collection of entity is bound within the 3D representation of the local venue. This visual and animated metaphor allows the public to experience the complexity of high-speed network streams that are used in the scientific community. Moreover, CytoViz displays the presence of discoverable Bluetooth devices carried by nearby persons. The concept is to generate an event-specific, real-time visualization that creates informational 3D patterns based on actual local presence. The observed Bluetooth traffic is put in opposition of the wide-area networking traffic by overlaying 2D animations on top of the 3D world. Each device is mapped to an animation fading over time while displaying the name of the detected device and its unique physical address. CytoViz was publicly presented at two major international conferences in 2005 (iGrid2005 in San Diego, CA and SC05 in Seattle, WA).

Representing the environment 3.0. Maps, models, networks.

Directory of Open Access Journals (Sweden)

Letizia Bollini

2014-05-01

Full Text Available Web 3.0 is changing the world we live and perceive the environment anthropomorphized, making a stratifation of levels of experience and mediated by the devices. If the urban landscape is designed, shaped and planned space, there is a social landscape that overwrite the territory of values, representations shared images, narratives of personal and collective history. Mobile technology introduces an additional parameter, a kind of non-place, which allows the coexistence of the here and elsewhere in an sort of digital landscape. The maps, mental models, the system of social networks become, then, the way to present, represented and represent themselves in a kind of ideal coring of the co-presence of levels of physical, cognitive and collective space.

Mapping network development of international new ventures with the use of company e-mails

NARCIS (Netherlands)

Wakkee, I.A.M.

2006-01-01

International new ventures use e-mail frequently to communicate with globally dispersed contacts. In this paper we present and discuss a qualitative research method to map international network development based on company e-mails. Our approach also allows for combinations of inductive and deductive

Applying self-organizing map and modified radial based neural network for clustering and routing optimal path in wireless network

Science.gov (United States)

Hoomod, Haider K.; Kareem Jebur, Tuka

2018-05-01

Mobile ad hoc networks (MANETs) play a critical role in today’s wireless ad hoc network research and consist of active nodes that can be in motion freely. Because it consider very important problem in this network, we suggested proposed method based on modified radial basis function networks RBFN and Self-Organizing Map SOM. These networks can be improved by the use of clusters because of huge congestion in the whole network. In such a system, the performance of MANET is improved by splitting the whole network into various clusters using SOM. The performance of clustering is improved by the cluster head selection and number of clusters. Modified Radial Based Neural Network is very simple, adaptable and efficient method to increase the life time of nodes, packet delivery ratio and the throughput of the network will increase and connection become more useful because the optimal path has the best parameters from other paths including the best bitrate and best life link with minimum delays. Proposed routing algorithm depends on the group of factors and parameters to select the path between two points in the wireless network. The SOM clustering average time (1-10 msec for stall nodes) and (8-75 msec for mobile nodes). While the routing time range (92-510 msec).The proposed system is faster than the Dijkstra by 150-300%, and faster from the RBFNN (without modify) by 145-180%.

The Euclidean distance degree of an algebraic variety

NARCIS (Netherlands)

Draisma, J.; Horobet, E.; Ottaviani, G.; Sturmfels, B.; Thomas, R.R.

2013-01-01

The nearest point map of a real algebraic variety with respect to Euclidean distance is an algebraic function. For instance, for varieties of low rank matrices, the Eckart-Young Theorem states that this map is given by the singular value decomposition. This article develops a theory of such nearest

The Euclidean distance degree of an algebraic variety

NARCIS (Netherlands)

Draisma, J.; Horobet, E.; Ottaviani, G.; Sturmfels, B.; Thomas, R.R.

The nearest point map of a real algebraic variety with respect to Euclidean distance is an algebraic function. For instance, for varieties of low-rank matrices, the Eckart–Young Theorem states that this map is given by the singular value decomposition. This article develops a theory of such nearest

A fuzzy neural network model to forecast the percent cloud coverage and cloud top temperature maps

Directory of Open Access Journals (Sweden)

Y. Tulunay

2008-12-01

Full Text Available Atmospheric processes are highly nonlinear. A small group at the METU in Ankara has been working on a fuzzy data driven generic model of nonlinear processes. The model developed is called the Middle East Technical University Fuzzy Neural Network Model (METU-FNN-M. The METU-FNN-M consists of a Fuzzy Inference System (METU-FIS, a data driven Neural Network module (METU-FNN of one hidden layer and several neurons, and a mapping module, which employs the Bezier Surface Mapping technique. In this paper, the percent cloud coverage (%CC and cloud top temperatures (CTT are forecast one month ahead of time at 96 grid locations. The probable influence of cosmic rays and sunspot numbers on cloudiness is considered by using the METU-FNN-M.

Just a Facebook away: The use of social network sites for relationship maintenance in long-distance and geographically-close romantic relationships

NARCIS (Netherlands)

Billedo, C.J.; Kerkhof, P.; Finkenauer, C.

2015-01-01

Social networking sites (SNS) play an increasingly important role in maintaining geographically close romantic relationships (GCRR). However, knowledge about SNS use in long-distance romantic relationships (LDRR) is still lacking. The present study examined the relative importance of SNS in

WebVR——Web Virtual Reality Engine Based on P2P network

OpenAIRE

zhihan LV; Tengfei Yin; Yong Han; Yong Chen; Ge Chen

2011-01-01

WebVR, a multi-user online virtual reality engine, is introduced. The main contributions are mapping the geographical space and virtual space to the P2P overlay network space, and dividing the three spaces by quad-tree method. The geocoding is identified with Hash value, which is used to index the user list, terrain data, and the model object data. Sharing of data through improved Kademlia network model is designed and implemented. In this model, XOR algorithm is used to calculate the distanc...

Nonlinear gap junctions enable long-distance propagation of pulsating calcium waves in astrocyte networks.

Directory of Open Access Journals (Sweden)

Mati Goldberg

Full Text Available A new paradigm has recently emerged in brain science whereby communications between glial cells and neuron-glia interactions should be considered together with neurons and their networks to understand higher brain functions. In particular, astrocytes, the main type of glial cells in the cortex, have been shown to communicate with neurons and with each other. They are thought to form a gap-junction-coupled syncytium supporting cell-cell communication via propagating Ca(2+ waves. An identified mode of propagation is based on cytoplasm-to-cytoplasm transport of inositol trisphosphate (IP(3 through gap junctions that locally trigger Ca(2+ pulses via IP(3-dependent Ca(2+-induced Ca(2+ release. It is, however, currently unknown whether this intracellular route is able to support the propagation of long-distance regenerative Ca(2+ waves or is restricted to short-distance signaling. Furthermore, the influence of the intracellular signaling dynamics on intercellular propagation remains to be understood. In this work, we propose a model of the gap-junctional route for intercellular Ca(2+ wave propagation in astrocytes. Our model yields two major predictions. First, we show that long-distance regenerative signaling requires nonlinear coupling in the gap junctions. Second, we show that even with nonlinear gap junctions, long-distance regenerative signaling is favored when the internal Ca(2+ dynamics implements frequency modulation-encoding oscillations with pulsating dynamics, while amplitude modulation-encoding dynamics tends to restrict the propagation range. As a result, spatially heterogeneous molecular properties and/or weak couplings are shown to give rise to rich spatiotemporal dynamics that support complex propagation behaviors. These results shed new light on the mechanisms implicated in the propagation of Ca(2+ waves across astrocytes and the precise conditions under which glial cells may participate in information processing in the brain.

Personality Homophily and Geographic Distance in Facebook.

Science.gov (United States)

Noë, Nyala; Whitaker, Roger M; Allen, Stuart M

2018-05-24

Personality homophily remains an understudied aspect of social networks, with the traditional focus concerning sociodemographic variables as the basis for assortativity, rather than psychological dispositions. We consider the effect of personality homophily on one of the biggest constraints to human social networks: geographic distance. We use the Big five model of personality to make predictions for each of the five facets: Openness to experience, Conscientiousness, Extraversion, Agreeableness, and Neuroticism. Using a network of 313,669 Facebook users, we investigate the difference in geographic distance between homophilous pairs, in which both users scored similarly on a particular facet, and mixed pairs. In accordance with our hypotheses, we find that pairs of open and conscientious users are geographically further apart than mixed pairs. Pairs of extraverts, on the other hand, tend to be geographically closer together. We find mixed results for the Neuroticism facet, and no significant effects for the Agreeableness facet. The results are discussed in the context of personality homophily and the impact of geographic distance on social connections.

An expert-based approach to forest road network planning by combining Delphi and spatial multi-criteria evaluation.

Science.gov (United States)

Hayati, Elyas; Majnounian, Baris; Abdi, Ehsan; Sessions, John; Makhdoum, Majid

2013-02-01

Changes in forest landscapes resulting from road construction have increased remarkably in the last few years. On the other hand, the sustainable management of forest resources can only be achieved through a well-organized road network. In order to minimize the environmental impacts of forest roads, forest road managers must design the road network efficiently and environmentally as well. Efficient planning methodologies can assist forest road managers in considering the technical, economic, and environmental factors that affect forest road planning. This paper describes a three-stage methodology using the Delphi method for selecting the important criteria, the Analytic Hierarchy Process for obtaining the relative importance of the criteria, and finally, a spatial multi-criteria evaluation in a geographic information system (GIS) environment for identifying the lowest-impact road network alternative. Results of the Delphi method revealed that ground slope, lithology, distance from stream network, distance from faults, landslide susceptibility, erosion susceptibility, geology, and soil texture are the most important criteria for forest road planning in the study area. The suitability map for road planning was then obtained by combining the fuzzy map layers of these criteria with respect to their weights. Nine road network alternatives were designed using PEGGER, an ArcView GIS extension, and finally, their values were extracted from the suitability map. Results showed that the methodology was useful for identifying road that met environmental and cost considerations. Based on this work, we suggest future work in forest road planning using multi-criteria evaluation and decision making be considered in other regions and that the road planning criteria identified in this study may be useful.

Spatial interpolation and radiological mapping of ambient gamma dose rate by using artificial neural networks and fuzzy logic methods.

Science.gov (United States)

Yeşilkanat, Cafer Mert; Kobya, Yaşar; Taşkın, Halim; Çevik, Uğur

2017-09-01

The aim of this study was to determine spatial risk dispersion of ambient gamma dose rate (AGDR) by using both artificial neural network (ANN) and fuzzy logic (FL) methods, compare the performances of methods, make dose estimations for intermediate stations with no previous measurements and create dose rate risk maps of the study area. In order to determine the dose distribution by using artificial neural networks, two main networks and five different network structures were used; feed forward ANN; Multi-layer perceptron (MLP), Radial basis functional neural network (RBFNN), Quantile regression neural network (QRNN) and recurrent ANN; Jordan networks (JN), Elman networks (EN). In the evaluation of estimation performance obtained for the test data, all models appear to give similar results. According to the cross-validation results obtained for explaining AGDR distribution, Pearson's r coefficients were calculated as 0.94, 0.91, 0.89, 0.91, 0.91 and 0.92 and RMSE values were calculated as 34.78, 43.28, 63.92, 44.86, 46.77 and 37.92 for MLP, RBFNN, QRNN, JN, EN and FL, respectively. In addition, spatial risk maps showing distributions of AGDR of the study area were created by all models and results were compared with geological, topological and soil structure. Copyright © 2017 Elsevier Ltd. All rights reserved.

The importance of distance to resources in the spatial modelling of bat foraging habitat.

Directory of Open Access Journals (Sweden)

Ana Rainho

Full Text Available Many bats are threatened by habitat loss, but opportunities to manage their habitats are now increasing. Success of management depends greatly on the capacity to determine where and how interventions should take place, so models predicting how animals use landscapes are important to plan them. Bats are quite distinctive in the way they use space for foraging because (i most are colonial central-place foragers and (ii exploit scattered and distant resources, although this increases flying costs. To evaluate how important distances to resources are in modelling foraging bat habitat suitability, we radio-tracked two cave-dwelling species of conservation concern (Rhinolophus mehelyi and Miniopterus schreibersii in a Mediterranean landscape. Habitat and distance variables were evaluated using logistic regression modelling. Distance variables greatly increased the performance of models, and distance to roost and to drinking water could alone explain 86 and 73% of the use of space by M. schreibersii and R. mehelyi, respectively. Land-cover and soil productivity also provided a significant contribution to the final models. Habitat suitability maps generated by models with and without distance variables differed substantially, confirming the shortcomings of maps generated without distance variables. Indeed, areas shown as highly suitable in maps generated without distance variables proved poorly suitable when distance variables were also considered. We concluded that distances to resources are determinant in the way bats forage across the landscape, and that using distance variables substantially improves the accuracy of suitability maps generated with spatially explicit models. Consequently, modelling with these variables is important to guide habitat management in bats and similarly mobile animals, particularly if they are central-place foragers or depend on spatially scarce resources.

Geodesic distance in planar graphs

International Nuclear Information System (INIS)

Bouttier, J.; Di Francesco, P.; Guitter, E.

2003-01-01

We derive the exact generating function for planar maps (genus zero fatgraphs) with vertices of arbitrary even valence and with two marked points at a fixed geodesic distance. This is done in a purely combinatorial way based on a bijection with decorated trees, leading to a recursion relation on the geodesic distance. The latter is solved exactly in terms of discrete soliton-like expressions, suggesting an underlying integrable structure. We extract from this solution the fractal dimensions at the various (multi)-critical points, as well as the precise scaling forms of the continuum two-point functions and the probability distributions for the geodesic distance in (multi)-critical random surfaces. The two-point functions are shown to obey differential equations involving the residues of the KdV hierarchy

Directional semivariogram analysis to identify and rank controls on the spatial variability of fracture networks

Science.gov (United States)

Hanke, John R.; Fischer, Mark P.; Pollyea, Ryan M.

2018-03-01

In this study, the directional semivariogram is deployed to investigate the spatial variability of map-scale fracture network attributes in the Paradox Basin, Utah. The relative variability ratio (R) is introduced as the ratio of integrated anisotropic semivariogram models, and R is shown to be an effective metric for quantifying the magnitude of spatial variability for any two azimuthal directions. R is applied to a GIS-based data set comprising roughly 1200 fractures, in an area which is bounded by a map-scale anticline and a km-scale normal fault. This analysis reveals that proximity to the fault strongly influences the magnitude of spatial variability for both fracture intensity and intersection density within 1-2 km. Additionally, there is significant anisotropy in the spatial variability, which is correlated with trends of the anticline and fault. The direction of minimum spatial correlation is normal to the fault at proximal distances, and gradually rotates and becomes subparallel to the fold axis over the same 1-2 km distance away from the fault. We interpret these changes to reflect varying scales of influence of the fault and the fold on fracture network development: the fault locally influences the magnitude and variability of fracture network attributes, whereas the fold sets the background level and structure of directional variability.

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.

Comparison between artificial neural networks and maximum likelihood classification in digital soil mapping

Directory of Open Access Journals (Sweden)

César da Silva Chagas

2013-04-01

Full Text Available Soil surveys are the main source of spatial information on soils and have a range of different applications, mainly in agriculture. The continuity of this activity has however been severely compromised, mainly due to a lack of governmental funding. The purpose of this study was to evaluate the feasibility of two different classifiers (artificial neural networks and a maximum likelihood algorithm in the prediction of soil classes in the northwest of the state of Rio de Janeiro. Terrain attributes such as elevation, slope, aspect, plan curvature and compound topographic index (CTI and indices of clay minerals, iron oxide and Normalized Difference Vegetation Index (NDVI, derived from Landsat 7 ETM+ sensor imagery, were used as discriminating variables. The two classifiers were trained and validated for each soil class using 300 and 150 samples respectively, representing the characteristics of these classes in terms of the discriminating variables. According to the statistical tests, the accuracy of the classifier based on artificial neural networks (ANNs was greater than of the classic Maximum Likelihood Classifier (MLC. Comparing the results with 126 points of reference showed that the resulting ANN map (73.81 % was superior to the MLC map (57.94 %. The main errors when using the two classifiers were caused by: a the geological heterogeneity of the area coupled with problems related to the geological map; b the depth of lithic contact and/or rock exposure, and c problems with the environmental correlation model used due to the polygenetic nature of the soils. This study confirms that the use of terrain attributes together with remote sensing data by an ANN approach can be a tool to facilitate soil mapping in Brazil, primarily due to the availability of low-cost remote sensing data and the ease by which terrain attributes can be obtained.

Internet protocol network mapper

Science.gov (United States)

Youd, David W.; Colon III, Domingo R.; Seidl, Edward T.

2016-02-23

A network mapper for performing tasks on targets is provided. The mapper generates a map of a network that specifies the overall configuration of the network. The mapper inputs a procedure that defines how the network is to be mapped. The procedure specifies what, when, and in what order the tasks are to be performed. Each task specifies processing that is to be performed for a target to produce results. The procedure may also specify input parameters for a task. The mapper inputs initial targets that specify a range of network addresses to be mapped. The mapper maps the network by, for each target, executing the procedure to perform the tasks on the target. The results of the tasks represent the mapping of the network defined by the initial targets.

Impacts of battery characteristics, driver preferences and road network features on travel costs of a plug-in hybrid electric vehicle (PHEV) for long-distance trips

International Nuclear Information System (INIS)

Arslan, Okan; Yıldız, Barış; Ekin Karaşan, Oya

2014-01-01

In a road network with refueling and fast charging stations, the minimum-cost driving path of a plug-in hybrid electric vehicle (PHEV) depends on factors such as location and availability of refueling/fast charging stations, capacity and cost of PHEV batteries, and driver tolerance towards extra mileage or additional stopping. In this paper, our focus is long-distance trips of PHEVs. We analyze the impacts of battery characteristics, often-overlooked driver preferences and road network features on PHEV travel costs for long-distance trips and compare the results with hybrid electric and conventional vehicles. We investigate the significance of these factors and derive critical managerial insights for shaping the future investment decisions about PHEVs and their infrastructure. In particular, our findings suggest that with a certain level of deployment of fast charging stations, well established cost and emission benefits of PHEVs for the short range trips can be extended to long distance. Drivers' stopping intolerance may hamper these benefits; however, increasing battery capacity may help overcome the adverse effects of this intolerance. - Highlights: • We investigate the travel costs of CVs, HEVs and PHEVs for long-distance trips. • We analyze the impacts of battery, driver and road network characteristics on the costs. • We provide critical managerial insights to shape the investment decisions about PHEVs. • Drivers' stopping intolerance may hamper the cost and emission benefits of PHEVs. • Negative effect of intolerance on cost may be overcome by battery capacity expansion

Mapping U.S. government tobacco control leadership: networked for success?

Science.gov (United States)

Leischow, Scott J; Luke, Douglas A; Mueller, Nancy; Harris, Jenine K; Ponder, Paris; Marcus, Stephen; Clark, Pamela I

2010-09-01

In order to better understand how tobacco control efforts are coordinated across agencies of the Department of Health and Human Services (DHHS), we assessed tobacco control-related communication between tobacco control leaders across DHHS. Cross-sectional surveys were collected from individuals representing 11 DHHS agencies, and social network analyses were used to assess linkages and map agencies' tobacco control communication. Individuals within the Office of the Secretary and Centers for Disease Control and Prevention (CDC) were most central to the network, and those of highest rank were most likely to be central to the network (F = 4.03, p = .024). The Centers for Medicare and Medicaid Services, Food and Drug Administration, Health Resources and Services Administration, and Substance Abuse and Mental Health Services Administration had no or almost no contact with other agencies. There was considerable between-agency contact variability, and the CDC was the most central agency. Tobacco control communication across DHHS agencies was present but extremely variable. This inconsistency may compromise the ability of the DHHS to address tobacco use, a critical public health problem, in a coordinated and efficient fashion. In light of the new leadership at DHHS, this analysis describes a systems approach that can be reimplemented as a means of understanding and improving communication and collaboration to improve public health.

Visualization maps for the evolution of research hotspots in the field of regional health information networks.

Science.gov (United States)

Wang, Yanjun; Zheng, Jianzhong; Zhang, Ailian; Zhou, Wei; Dong, Haiyuan

2018-03-01

The aim of this study was to reveal research hotspots in the field of regional health information networks (RHINs) and use visualization techniques to explore their evolution over time and differences between countries. We conducted a literature review for a 50-year period and compared the prevalence of certain index terms during the periods 1963-1993 and 1994-2014 and in six countries. We applied keyword frequency analysis, keyword co-occurrence analysis, multidimensional scaling analysis, and network visualization technology. The total number of keywords was found to increase with time. From 1994 to 2014, the research priorities shifted from hospital planning to community health planning. The number of keywords reflecting information-based research increased. The density of the knowledge network increased significantly, and partial keywords condensed into knowledge groups. All six countries focus on keywords including Information Systems; Telemedicine; Information Service; Medical Records Systems, Computerized; Internet; etc.; however, the level of development and some research priorities are different. RHIN research has generally increased in popularity over the past 50 years. The research hotspots are evolving and are at different levels of development in different countries. Knowledge network mapping and perceptual maps provide useful information for scholars, managers, and policy-makers.

Saliency U-Net: A regional saliency map-driven hybrid deep learning network for anomaly segmentation

Science.gov (United States)

Karargyros, Alex; Syeda-Mahmood, Tanveer

2018-02-01

Deep learning networks are gaining popularity in many medical image analysis tasks due to their generalized ability to automatically extract relevant features from raw images. However, this can make the learning problem unnecessarily harder requiring network architectures of high complexity. In case of anomaly detection, in particular, there is often sufficient regional difference between the anomaly and the surrounding parenchyma that could be easily highlighted through bottom-up saliency operators. In this paper we propose a new hybrid deep learning network using a combination of raw image and such regional maps to more accurately learn the anomalies using simpler network architectures. Specifically, we modify a deep learning network called U-Net using both the raw and pre-segmented images as input to produce joint encoding (contraction) and expansion paths (decoding) in the U-Net. We present results of successfully delineating subdural and epidural hematomas in brain CT imaging and liver hemangioma in abdominal CT images using such network.

Google Maps offers a new way to evaluate claudication.

Science.gov (United States)

Khambati, Husain; Boles, Kim; Jetty, Prasad

2017-05-01

Accurate determination of walking capacity is important for the clinical diagnosis and management plan for patients with peripheral arterial disease. The current "gold standard" of measurement is walking distance on a treadmill. However, treadmill testing is not always reflective of the patient's natural walking conditions, and it may not be fully accessible in every vascular clinic. The objective of this study was to determine whether Google Maps, the readily available GPS-based mapping tool, offers an accurate and accessible method of evaluating walking distances in vascular claudication patients. Patients presenting to the outpatient vascular surgery clinic between November 2013 and April 2014 at the Ottawa Hospital with vasculogenic calf, buttock, and thigh claudication symptoms were identified and prospectively enrolled in our study. Onset of claudication symptoms and maximal walking distance (MWD) were evaluated using four tools: history; Walking Impairment Questionnaire (WIQ), a validated claudication survey; Google Maps distance calculator (patients were asked to report their daily walking routes on the Google Maps-based tool runningmap.com, and walking distances were calculated accordingly); and treadmill testing for onset of symptoms and MWD, recorded in a double-blinded fashion. Fifteen patients were recruited for the study. Determination of walking distances using Google Maps proved to be more accurate than by both clinical history and WIQ, correlating highly with the gold standard of treadmill testing for both claudication onset (r = .805; P Google Maps tool was also efficient, with reporting times averaging below 4 minutes. For vascular claudicants with no other walking limitations, Google Maps is a promising new tool that combines the objective strengths of the treadmill test and incorporates real-world walking environments. It offers an accurate, efficient, inexpensive, and readily accessible way to assess walking distances in patients with

Quasar Parallax: a Method for Determining Direct Geometrical Distances to Quasars

OpenAIRE

Elvis, Martin; Karovska, Margarita

2002-01-01

We describe a novel method to determine direct geometrical distances to quasars that can measure the cosmological constant, Lambda, with minimal assumptions. This method is equivalent to geometric parallax, with the `standard length' being the size of the quasar broad emission line region (BELR) as determined from the light travel time measurements of reverberation mapping. The effect of non-zero Lambda on angular diameter is large, 40% at z=2, so mapping angular diameter distances vs. redshi...

Assessment of Convolution Neural Networks for Surficial Geology Mapping in the South Rae Geological Region, Northwest Territories, Canada

Directory of Open Access Journals (Sweden)

Rasim Latifovic

2018-02-01

Full Text Available Mapping of surficial geology is an important requirement for broadening the geoscience database of northern Canada. Surficial geology maps are an integral data source for mineral and energy exploration. Moreover, they provide information such as the location of gravels and sands, which are important for infrastructure development. Currently, surficial geology maps are produced through expert interpretation of aerial photography and field data. However, interpretation is known to be subjective, labour-intensive and difficult to repeat. The expert knowledge required for interpretation can be challenging to maintain and transfer. In this research, we seek to assess the potential of deep neural networks to aid surficial geology mapping by providing an objective surficial materials initial layer that experts can modify to speed map development and improve consistency between mapped areas. Such an approach may also harness expert knowledge in a way that is transferable to unmapped areas. For this purpose, we assess the ability of convolution neural networks (CNN to predict surficial geology classes under two sampling scenarios. In the first scenario, a CNN uses samples collected over the area to be mapped. In the second, a CNN trained over one area is then applied to locations where the available samples were not used in training the network. The latter case is important, as a collection of in situ training data can be costly. The evaluation of the CNN was carried out using aerial photos, Landsat reflectance, and high-resolution digital elevation data over five areas within the South Rae geological region of Northwest Territories, Canada. The results are encouraging, with the CNN generating average accuracy of 76% when locally trained. For independent test areas (i.e., trained over one area and applied over other, accuracy dropped to 59–70% depending on the classes selected for mapping. In the South Rae region, significant confusion was found

Nonlinear microrheology and molecular imaging to map microscale deformations of entangled DNA networks

Science.gov (United States)

Wu, Tsai-Chin; Anderson, Rae

We use active microrheology coupled to single-molecule fluorescence imaging to elucidate the microscale dynamics of entangled DNA. DNA naturally exists in a wide range of lengths and topologies, and is often confined in cell nucleui, forming highly concentrated and entangled biopolymer networks. Thus, DNA is the model polymer for understanding entangled polymer dynamics as well as the crowded environment of cells. These networks display complex viscoelastic properties that are not well understood, especially at the molecular-level and in response to nonlinear perturbations. Specifically, how microscopic stresses and strains propagate through entangled networks, and what molecular deformations lead to the network stress responses are unknown. To answer these important questions, we optically drive a microsphere through entangled DNA, perturbing the system far from equilibrium, while measuring the resistive force the DNA exerts on the bead during and after bead motion. We simultaneously image single fluorescent-labeled DNA molecules throughout the network to directly link the microscale stress response to molecular deformations. We characterize the deformation of the network from the molecular-level to the mesoscale, and map the stress propagation throughout the network. We further study the impact of DNA length (11 - 115 kbp) and topology (linear vs ring DNA) on deformation and propagation dynamics, exploring key nonlinear features such as tube dilation and power-law relaxation.

Mapping industrial networks as an approach to identify inter-organisational collaborative potential in new product development

DEFF Research Database (Denmark)

Parraguez, Pedro; Maier, Anja

2012-01-01

. Consequently, identifying and selecting potential partners to establish collaboration agreements can be a key activity in the new product development process. This paper explores the implications of mapping industrial networks with the purpose of identifying inter-organisational collaborative potential...

How do general practice residents use social networking sites in asynchronous distance learning?

Science.gov (United States)

Maisonneuve, Hubert; Chambe, Juliette; Lorenzo, Mathieu; Pelaccia, Thierry

2015-09-21

Blended learning environments - involving both face-to-face and remote interactions - make it easier to adapt learning programs to constraints such as residents' location and low teacher-student ratio. Social networking sites (SNS) such as Facebook®, while not originally intended to be used as learning environments, may be adapted for the distance-learning part of training programs. The purpose of our study was to explore the use of SNS for asynchronous distance learning in a blended learning environment as well as its influence on learners' face-to-face interactions. We conducted a qualitative study and carried out semi-structured interviews. We performed purposeful sampling for maximal variation to include eight general practice residents in 2(nd) and 3(rd) year training. A thematic analysis was performed. The social integration of SNS facilitates the engagement of users in their learning tasks. This may also stimulate students' interactions and group cohesion when members meet up in person. Most of the general practice residents who work in the blended learning environment we studied had a positive appraisal on their use of SNS. In particular, we report a positive impact on their engagement in learning and their participation in discussions during face-to-face instruction. Further studies are needed in order to evaluate the effectiveness of SNS in blended learning environments and the appropriation of SNS by teachers.

Social and Spatial Networks: Kinship Distance and Dwelling Unit Proximity in Rural Thailand

Science.gov (United States)

Verdery, Ashton M.; Entwisle, Barbara; Faust, Katherine; Rindfuss, Ronald R.

2013-01-01

We address a long hypothesized relationship between the proximity of individuals' dwelling units and their kinship association. Better understanding this relationship is important because of its implications for contact and association among members of a society. In this paper, we use a unique dataset from Nang Rong, Thailand which contains dwelling unit locations (GPS) and saturated kinship networks of all individuals living in 51 agricultural villages. After presenting arguments for a relationship between individuals’ dwelling unit locations and their kinship relations as well as the particulars of our case study, we introduce the data and describe our analytic approach. We analyze how kinship - considered as both a system linking collections of individuals in an extended kinship network and as dyadic links between pairs of individuals -patterns the proximity of dwelling units in rural villages. The results show that in general, extended kin live closer to one another than do unrelated individuals. Further, the degree of relatedness between kin correlates with the distance between their dwelling units. Close kin are more likely to co-reside, a fact which drives much of the relationship between kinship relatedness and dwelling unit proximity within villages. There is nevertheless suggestive evidence of a relationship between kinship association and dwelling unit proximity among kin who do not live together. PMID:23956489

Cooperation in health: mapping collaborative networks on the web.

Science.gov (United States)

Lang, Pamela Barreto; Gouveia, Fábio Castro; Leta, Jacqueline

2013-01-01

To map and investigate the relationships established on the web between leading health-research institutions around the world. Sample selection was based on the World Health Organization (WHO) Collaborating Centres (CCs). Data on the 768 active CCs in 89 countries were retrieved from the WHO's database. The final sample consisted of 190 institutions devoted to health sciences in 42 countries. Data on each institution's website were retrieved using webometric techniques (interlinking), and an asymmetric matrix was generated for social network analysis. The results showed that American and European institutions, such as the Centers for Disease Control and Prevention (CDC), the National Institutes of Health (NIH) and the National Institute of Health and Medical Research (INSERM), are the most highly connected on the web and have a higher capacity to attract hyperlinks. The Karolinska Institute (KI-SE) in Sweden is well placed as an articulation point between several integrants of the network and the component's core but lacks general recognition on the web by hyperlinks. Regarding the north-south divide, Mexico and Brazil appear to be key southern players on the web. The results showed that the hyperlinks exchanged between northern and southern countries present an abysmal gap: 99.49% of the hyperlinks provided by the North are directed toward the North itself, in contrast to 0.51% that are directed toward the South. Regarding the South, its institutions are more connected to its northern partners, with 98.46% of its hyperlinks directed toward the North, and mainly toward the United States, compared with 1.54% toward southern neighbors. It is advisable to strengthen integration policies on the web and to increase web networking through hyperlink exchange. In this way, the web could actually reflect international cooperation in health and help to legitimize and enhance the visibility of the many existing south-south collaboration networks.

Cooperation in health: mapping collaborative networks on the web.

Directory of Open Access Journals (Sweden)

Pamela Barreto Lang

Full Text Available OBJECTIVE: To map and investigate the relationships established on the web between leading health-research institutions around the world. METHODS: Sample selection was based on the World Health Organization (WHO Collaborating Centres (CCs. Data on the 768 active CCs in 89 countries were retrieved from the WHO's database. The final sample consisted of 190 institutions devoted to health sciences in 42 countries. Data on each institution's website were retrieved using webometric techniques (interlinking, and an asymmetric matrix was generated for social network analysis. FINDINGS: The results showed that American and European institutions, such as the Centers for Disease Control and Prevention (CDC, the National Institutes of Health (NIH and the National Institute of Health and Medical Research (INSERM, are the most highly connected on the web and have a higher capacity to attract hyperlinks. The Karolinska Institute (KI-SE in Sweden is well placed as an articulation point between several integrants of the network and the component's core but lacks general recognition on the web by hyperlinks. Regarding the north-south divide, Mexico and Brazil appear to be key southern players on the web. The results showed that the hyperlinks exchanged between northern and southern countries present an abysmal gap: 99.49% of the hyperlinks provided by the North are directed toward the North itself, in contrast to 0.51% that are directed toward the South. Regarding the South, its institutions are more connected to its northern partners, with 98.46% of its hyperlinks directed toward the North, and mainly toward the United States, compared with 1.54% toward southern neighbors. CONCLUSION: It is advisable to strengthen integration policies on the web and to increase web networking through hyperlink exchange. In this way, the web could actually reflect international cooperation in health and help to legitimize and enhance the visibility of the many existing south

Aspects Regarding the Establishment of the Scale Coefficient in the Case of Distances Measurements in an Geodetic Network

Directory of Open Access Journals (Sweden)

Mircea Ortelecan

2016-11-01

Full Text Available The paper analyzes the possibility to establish the coefficient of scale towards the total station scale triangulation network in the conduct of geodetic and topographic observations in the points with known coordinates (old points or points whose coordinates we want to determine (new points. The purpose of the study is undertaken to simplify computing operations to reduce distances measured from the topographic surface to the Stereo 70 projection plan.

Mapping atmospheric aerosols with a citizen science network of smartphone spectropolarimeters

Science.gov (United States)

Snik, Frans; Rietjens, Jeroen H. H.; Apituley, Arnoud; Volten, Hester; Mijling, Bas; Di Noia, Antonio; Heikamp, Stephanie; Heinsbroek, Ritse C.; Hasekamp, Otto P.; Smit, J. Martijn; Vonk, Jan; Stam, Daphne M.; Harten, Gerard; Boer, Jozua; Keller, Christoph U.

2014-10-01

To assess the impact of atmospheric aerosols on health, climate, and air traffic, aerosol properties must be measured with fine spatial and temporal sampling. This can be achieved by actively involving citizens and the technology they own to form an atmospheric measurement network. We establish this new measurement strategy by developing and deploying iSPEX, a low-cost, mass-producible optical add-on for smartphones with a corresponding app. The aerosol optical thickness (AOT) maps derived from iSPEX spectropolarimetric measurements of the daytime cloud-free sky by thousands of citizen scientists throughout the Netherlands are in good agreement with the spatial AOT structure derived from satellite imagery and temporal AOT variations derived from ground-based precision photometry. These maps show structures at scales of kilometers that are typical for urban air pollution, indicating the potential of iSPEX to provide information about aerosol properties at locations and at times that are not covered by current monitoring efforts.

A spectral method to detect community structure based on distance modularity matrix

Science.gov (United States)

Yang, Jin-Xuan; Zhang, Xiao-Dong

2017-08-01

There are many community organizations in social and biological networks. How to identify these community structure in complex networks has become a hot issue. In this paper, an algorithm to detect community structure of networks is proposed by using spectra of distance modularity matrix. The proposed algorithm focuses on the distance of vertices within communities, rather than the most weakly connected vertex pairs or number of edges between communities. The experimental results show that our method achieves better effectiveness to identify community structure for a variety of real-world networks and computer generated networks with a little more time-consumption.

The Barley Chromosome 5 Linkage Map

DEFF Research Database (Denmark)

Jensen, J.; Jørgensen, Jørgen Helms

1975-01-01

The distances between nine loci on barley chromosome 5 have been studied in five two-point tests, three three-point tests, and one four-point test. Our previous chromosome 5 linkage map, which contained eleven loci mapped from literature data (Jensen and Jørgensen 1975), is extended with four loci......-position is fixed on the map by a locus (necl), which has a good marker gene located centrally in the linkage group. The positions of the other loci are their distances in centimorgans from the 0-position; loci in the direction of the short chromosome arm are assigned positive values and those...

Mapping the space of genomic signatures.

Directory of Open Access Journals (Sweden)

Lila Kari

Full Text Available We propose a computational method to measure and visualize interrelationships among any number of DNA sequences allowing, for example, the examination of hundreds or thousands of complete mitochondrial genomes. An "image distance" is computed for each pair of graphical representations of DNA sequences, and the distances are visualized as a Molecular Distance Map: Each point on the map represents a DNA sequence, and the spatial proximity between any two points reflects the degree of structural similarity between the corresponding sequences. The graphical representation of DNA sequences utilized, Chaos Game Representation (CGR, is genome- and species-specific and can thus act as a genomic signature. Consequently, Molecular Distance Maps could inform species identification, taxonomic classifications and, to a certain extent, evolutionary history. The image distance employed, Structural Dissimilarity Index (DSSIM, implicitly compares the occurrences of oligomers of length up to k (herein k = 9 in DNA sequences. We computed DSSIM distances for more than 5 million pairs of complete mitochondrial genomes, and used Multi-Dimensional Scaling (MDS to obtain Molecular Distance Maps that visually display the sequence relatedness in various subsets, at different taxonomic levels. This general-purpose method does not require DNA sequence alignment and can thus be used to compare similar or vastly different DNA sequences, genomic or computer-generated, of the same or different lengths. We illustrate potential uses of this approach by applying it to several taxonomic subsets: phylum Vertebrata, (superkingdom Protista, classes Amphibia-Insecta-Mammalia, class Amphibia, and order Primates. This analysis of an extensive dataset confirms that the oligomer composition of full mtDNA sequences can be a source of taxonomic information. This method also correctly finds the mtDNA sequences most closely related to that of the anatomically modern human (the Neanderthal

Performance Analysis of Long-Reach Coherent Detection OFDM-PON Downstream Transmission Using m-QAM-Mapped OFDM Signal

Science.gov (United States)

Pandey, Gaurav; Goel, Aditya

2017-12-01

In this paper, orthogonal frequency division multiplexing (OFDM)-passive optical network (PON) downstream transmission is demonstrated over different lengths of fiber at remote node (RN) for different m-QAM (quadrature amplitude modulation)-mapped OFDM signal (m=4, 16, 32 and 64) transmission from the central office (CO) for different data rates (10, 20 30 and 40 Gbps) using coherent detection at the user end or optical network unit (ONU). Investigation is performed with different number of subcarriers (32, 64, 128, 512 and 1,024), back-to-back optical signal-to-noise ratio (OSNR) along with transmitted and received constellation diagrams for m-QAM-mapped coherent OFDM downstream transmission at different speeds over different transmission distances. Received optical power is calculated for different bit error rates (BERs) at different speeds using m-QAM-mapped coherent detection OFDM downstream transmission. No dispersion compensation is utilized in between the fiber span. Simulation results suggest the different lengths and data rates that can be used for different m-QAM-mapped coherent detection OFDM downstream transmission, and the proposed system may be implemented in next-generation high-speed PONs (NG-PONs).

Analysis on Invulnerability of Wireless Sensor Network towards Cascading Failures Based on Coupled Map Lattice

Directory of Open Access Journals (Sweden)

Xiuwen Fu

2018-01-01

Full Text Available Previous research of wireless sensor networks (WSNs invulnerability mainly focuses on the static topology, while ignoring the cascading process of the network caused by the dynamic changes of load. Therefore, given the realistic features of WSNs, in this paper we research the invulnerability of WSNs with respect to cascading failures based on the coupled map lattice (CML. The invulnerability and the cascading process of four types of network topologies (i.e., random network, small-world network, homogenous scale-free network, and heterogeneous scale-free network under various attack schemes (i.e., random attack, max-degree attack, and max-status attack are investigated, respectively. The simulation results demonstrate that the rise of interference R and coupling coefficient ε will increase the risks of cascading failures. Cascading threshold values Rc and εc exist, where cascading failures will spread to the entire network when R>Rc or ε>εc. When facing a random attack or max-status attack, the network with higher heterogeneity tends to have a stronger invulnerability towards cascading failures. Conversely, when facing a max-degree attack, the network with higher uniformity tends to have a better performance. Besides that, we have also proved that the spreading speed of cascading failures is inversely proportional to the average path length of the network and the increase of average degree k can improve the network invulnerability.

Performance Analysis of Reuse Distance in Cooperative Broadcasting

Directory of Open Access Journals (Sweden)

Jimmi Grönkvist

2016-01-01

Full Text Available Cooperative broadcasting is a promising technique for robust broadcast with low overhead and delay in mobile ad hoc networks. The technique is attractive for mission-oriented mobile communication, where a majority of the traffic is of broadcast nature. In cooperative broadcasting, all nodes simultaneously retransmit packets. The receiver utilizes cooperative diversity in the simultaneously received signals. The retransmissions continue until all nodes are reached. After the packet has traveled a specific number of hops out from the source, denoted as reuse distance, the source node transmits a new broadcast packet in the time slot used for the previous broadcast packet. If the reuse distance is too small, interference causes packet loss in intermediate nodes. In the literature, a reuse distance of three is common. With an analysis based on a realistic interference model and real terrain data, we show that a reuse distance of at least four is necessary to avoid packet loss in sparsely connected networks, especially for high spectral efficiencies. For frequency hopping, widely used in military systems, we propose a novel method. This method almost eliminates interference for a reuse distance of three, increasing the throughput by 33% compared to systems with a reuse distance of four.

Mapping Speech Spectra from Throat Microphone to Close-Speaking Microphone: A Neural Network Approach

Directory of Open Access Journals (Sweden)

B. Yegnanarayana

2007-01-01

Full Text Available Speech recorded from a throat microphone is robust to the surrounding noise, but sounds unnatural unlike the speech recorded from a close-speaking microphone. This paper addresses the issue of improving the perceptual quality of the throat microphone speech by mapping the speech spectra from the throat microphone to the close-speaking microphone. A neural network model is used to capture the speaker-dependent functional relationship between the feature vectors (cepstral coefficients of the two speech signals. A method is proposed to ensure the stability of the all-pole synthesis filter. Objective evaluations indicate the effectiveness of the proposed mapping scheme. The advantage of this method is that the model gives a smooth estimate of the spectra of the close-speaking microphone speech. No distortions are perceived in the reconstructed speech. This mapping technique is also used for bandwidth extension of telephone speech.

Landslide susceptibility mapping using frequency ratio, logistic regression, artificial neural networks and their comparison: A case study from Kat landslides (Tokat—Turkey)

Science.gov (United States)

Yilmaz, Işık

2009-06-01

The purpose of this study is to compare the landslide susceptibility mapping methods of frequency ratio (FR), logistic regression and artificial neural networks (ANN) applied in the Kat County (Tokat—Turkey). Digital elevation model (DEM) was first constructed using GIS software. Landslide-related factors such as geology, faults, drainage system, topographical elevation, slope angle, slope aspect, topographic wetness index (TWI) and stream power index (SPI) were used in the landslide susceptibility analyses. Landslide susceptibility maps were produced from the frequency ratio, logistic regression and neural networks models, and they were then compared by means of their validations. The higher accuracies of the susceptibility maps for all three models were obtained from the comparison of the landslide susceptibility maps with the known landslide locations. However, respective area under curve (AUC) values of 0.826, 0.842 and 0.852 for frequency ratio, logistic regression and artificial neural networks showed that the map obtained from ANN model is more accurate than the other models, accuracies of all models can be evaluated relatively similar. The results obtained in this study also showed that the frequency ratio model can be used as a simple tool in assessment of landslide susceptibility when a sufficient number of data were obtained. Input process, calculations and output process are very simple and can be readily understood in the frequency ratio model, however logistic regression and neural networks require the conversion of data to ASCII or other formats. Moreover, it is also very hard to process the large amount of data in the statistical package.

Method and system for a network mapping service

Science.gov (United States)

Bynum, Leo

2017-10-17

A method and system of publishing a map includes providing access to a plurality of map data files or mapping services between at least one publisher and at least one subscriber; defining a map in a map context comprising parameters and descriptors to substantially duplicate a map by reference to mutually accessible data or mapping services, publishing a map to a channel in a table file on server; accessing the channel by at least one subscriber, transmitting the mapping context from the server to the at least one subscriber, executing the map context by the at least one subscriber, and generating the map on a display software associated with the at least one subscriber by reconstituting the map from the references and other data in the mapping context.

Editorial ~ Does "Lean Thinking" Relate to Network-based Distance Education

Directory of Open Access Journals (Sweden)

Peter S. Cookson

2003-10-01

Full Text Available Pointing to the “objectivised, rationalized, technologically-based interaction,” Peters (1973 referred to the then prevailing correspondence forms of distance education as “the most industrialized form of education” (p. 313. With such features as assembly line methods; division of labor; centralized processes of teaching materials development, production and dispatching; student admissions enrollment systems; automated registration, course allocation, and student support, and personnel management systems, distance education institutions demonstrated management structures and practices utilized in industrial and business organizations. Large numbers of courses and students were thus “processed” in correspondence, radio, and television-based distance education systems.

Virtual Distances Used for Optimization of Applicationsin the Pervasive Computing Domain

DEFF Research Database (Denmark)

Schougaard, Kari Rye

2004-01-01

This paper presents the notion of virtual distances -- communication proximity -- to describe the quality of a connection between two devices. We use virtual distances as the baisis of optimizations performed by a virtual machine where a part of an application can be moved to another device if th...... advantage of temporarily available resources at the current local area network or through ad-hoc networks...

Comparison between genetic algorithm and self organizing map to detect botnet network traffic

Science.gov (United States)

Yugandhara Prabhakar, Shinde; Parganiha, Pratishtha; Madhu Viswanatham, V.; Nirmala, M.

2017-11-01

In Cyber Security world the botnet attacks are increasing. To detect botnet is a challenging task. Botnet is a group of computers connected in a coordinated fashion to do malicious activities. Many techniques have been developed and used to detect and prevent botnet traffic and the attacks. In this paper, a comparative study is done on Genetic Algorithm (GA) and Self Organizing Map (SOM) to detect the botnet network traffic. Both are soft computing techniques and used in this paper as data analytics system. GA is based on natural evolution process and SOM is an Artificial Neural Network type, uses unsupervised learning techniques. SOM uses neurons and classifies the data according to the neurons. Sample of KDD99 dataset is used as input to GA and SOM.

Automated integration of genomic physical mapping data via parallel simulated annealing

Energy Technology Data Exchange (ETDEWEB)

Slezak, T.

1994-06-01

The Human Genome Center at the Lawrence Livermore National Laboratory (LLNL) is nearing closure on a high-resolution physical map of human chromosome 19. We have build automated tools to assemble 15,000 fingerprinted cosmid clones into 800 contigs with minimal spanning paths identified. These islands are being ordered, oriented, and spanned by a variety of other techniques including: Fluorescence Insitu Hybridization (FISH) at 3 levels of resolution, ECO restriction fragment mapping across all contigs, and a multitude of different hybridization and PCR techniques to link cosmid, YAC, AC, PAC, and Pl clones. The FISH data provide us with partial order and distance data as well as orientation. We made the observation that map builders need a much rougher presentation of data than do map readers; the former wish to see raw data since these can expose errors or interesting biology. We further noted that by ignoring our length and distance data we could simplify our problem into one that could be readily attacked with optimization techniques. The data integration problem could then be seen as an M x N ordering of our N cosmid clones which ``intersect`` M larger objects by defining ``intersection`` to mean either contig/map membership or hybridization results. Clearly, the goal of making an integrated map is now to rearrange the N cosmid clone ``columns`` such that the number of gaps on the object ``rows`` are minimized. Our FISH partially-ordered cosmid clones provide us with a set of constraints that cannot be violated by the rearrangement process. We solved the optimization problem via simulated annealing performed on a network of 40+ Unix machines in parallel, using a server/client model built on explicit socket calls. For current maps we can create a map in about 4 hours on the parallel net versus 4+ days on a single workstation. Our biologists are now using this software on a daily basis to guide their efforts toward final closure.

Adaptive Distance Protection for Microgrids

DEFF Research Database (Denmark)

Lin, Hengwei; Guerrero, Josep M.; Quintero, Juan Carlos Vasquez

2015-01-01

is adopted to accelerate the tripping speed of the relays on the weak lines. The protection methodology is tested on a mid-voltage microgrid network in Aalborg, Denmark. The results show that the adaptive distance protection methodology has good selectivity and sensitivity. What is more, this system also has......Due to the increasing penetration of distributed generation resources, more and more microgrids can be found in distribution systems. This paper proposes a phasor measurement unit based distance protection strategy for microgrids in distribution system. At the same time, transfer tripping scheme...

A fully convolutional network for weed mapping of unmanned aerial vehicle (UAV) imagery.

Science.gov (United States)

Huang, Huasheng; Deng, Jizhong; Lan, Yubin; Yang, Aqing; Deng, Xiaoling; Zhang, Lei

2018-01-01

Appropriate Site Specific Weed Management (SSWM) is crucial to ensure the crop yields. Within SSWM of large-scale area, remote sensing is a key technology to provide accurate weed distribution information. Compared with satellite and piloted aircraft remote sensing, unmanned aerial vehicle (UAV) is capable of capturing high spatial resolution imagery, which will provide more detailed information for weed mapping. The objective of this paper is to generate an accurate weed cover map based on UAV imagery. The UAV RGB imagery was collected in 2017 October over the rice field located in South China. The Fully Convolutional Network (FCN) method was proposed for weed mapping of the collected imagery. Transfer learning was used to improve generalization capability, and skip architecture was applied to increase the prediction accuracy. After that, the performance of FCN architecture was compared with Patch_based CNN algorithm and Pixel_based CNN method. Experimental results showed that our FCN method outperformed others, both in terms of accuracy and efficiency. The overall accuracy of the FCN approach was up to 0.935 and the accuracy for weed recognition was 0.883, which means that this algorithm is capable of generating accurate weed cover maps for the evaluated UAV imagery.

Drones, information technology, and distance: mapping the moral epistemology of remote fighting

NARCIS (Netherlands)

Coeckelbergh, Mark

2013-01-01

Ethical reflection on drone fighting suggests that this practice does not only create physical distance, but also moral distance: far removed from one’s opponent, it becomes easier to kill. This paper discusses this thesis, frames it as a moral-epistemological problem, and explores the role of

Correlation measure to detect time series distances, whence economy globalization

Science.gov (United States)

Miśkiewicz, Janusz; Ausloos, Marcel

2008-11-01

An instantaneous time series distance is defined through the equal time correlation coefficient. The idea is applied to the Gross Domestic Product (GDP) yearly increments of 21 rich countries between 1950 and 2005 in order to test the process of economic globalisation. Some data discussion is first presented to decide what (EKS, GK, or derived) GDP series should be studied. Distances are then calculated from the correlation coefficient values between pairs of series. The role of time averaging of the distances over finite size windows is discussed. Three network structures are next constructed based on the hierarchy of distances. It is shown that the mean distance between the most developed countries on several networks actually decreases in time, -which we consider as a proof of globalization. An empirical law is found for the evolution after 1990, similar to that found in flux creep. The optimal observation time window size is found ≃15 years.

Mapping one strong 'Ohana: using network analysis and GIS to enhance the effectiveness of a statewide coalition to prevent child abuse and neglect.

Science.gov (United States)

Cardazone, Gina; U Sy, Angela; Chik, Ivan; Corlew, Laura Kate

2014-06-01

Network analysis and GIS enable the presentation of meaningful data about organizational relationships and community characteristics, respectively. Together, these tools can provide a concrete representation of the ecological context in which coalitions operate, and may help coalitions identify opportunities for growth and enhanced effectiveness. This study uses network analysis and GIS mapping as part of an evaluation of the One Strong 'Ohana (OSO) campaign. The OSO campaign was launched in 2012 via a partnership between the Hawai'i Children's Trust Fund (HCTF) and the Joyful Heart Foundation. The OSO campaign uses a collaborative approach aimed at increasing public awareness of child maltreatment and protective factors that can prevent maltreatment, as well as enhancing the effectiveness of the HCTF Coalition. This study focuses on three elements of the OSO campaign evaluation: (1) Network analysis exploring the relationships between 24 active Coalition member organizations, (2) GIS mapping of responses to a randomized statewide phone survey (n = 1,450) assessing awareness of factors contributing to child maltreatment, and (3) Combined GIS maps and network data, illustrating opportunities for geographically-targeted coalition building and public awareness activities.

The Hetu'u Global Network: Measuring the Distance to the Sun Using the June 5th/6th Transit of Venus

Science.gov (United States)

Faherty, Jacqueline K.; Rodriguez, David R.; Miller, Scott T.

2012-01-01

In the spirit of historic astronomical endeavors, we invited school groups across the globe to collaborate in a solar distance measurement using the rare June 5/6th transit of Venus. In total, we recruited 19 school groups spread over 6 continents and 10 countries to participate in our Hetu'u Global Network. Applying the methods of French…

Satellite Communication and Long Distance Education

OpenAIRE

Hafied Cangara

2016-01-01

Since Indonesia introduced communication satellite for telecommunication network, the satellite has brought a number of advantages for national development in various areas, such as telephone network, mass media development, business, education, politics, security and national defence as well as regional and International cooperation. In education, satellite communication could be used for long-distance learning as implemented by 13 state universities in eastern parts of Indonesia. It is also...

Mapping a Careflow Network to assess the connectedness of Connected Health.

Science.gov (United States)

Carroll, Noel; Richardson, Ita

2017-04-01

Connected Health is an emerging and rapidly developing field which has the potential to transform healthcare service systems by increasing its safety, quality and overall efficiency. From a healthcare perspective, process improvement models have mainly focused on the static workflow viewpoint. The objective of this article is to study and model the dynamic nature of healthcare delivery, allowing us to identify where potential issues exist within the service system and to examine how Connected Health technological solutions may support service efficiencies. We explore the application of social network analysis (SNA) as a modelling technique which captures the dynamic nature of a healthcare service. We demonstrate how it can be used to map the 'Careflow Network' and guide Connected Health innovators to examine specific opportunities within the healthcare service. Our results indicate that healthcare technology must be correctly identified and implemented within the Careflow Network to enjoy improvements in service delivery. Oftentimes, prior to making the transformation to Connected Health, researchers use various modelling techniques that fail to identify where Connected Health innovation is best placed in a healthcare service network. Using SNA allows us to develop an understanding of the current operation of healthcare system within which they can effect change. It is important to identify and model the resource exchanges to ensure that the quality and safety of care are enhanced, efficiencies are increased and the overall healthcare service system is improved. We have shown that dynamic models allow us to study the exchange of resources. These are often intertwined within a socio-technical context in an informal manner and not accounted for in static models, yet capture a truer insight on the operations of a Careflow Network.

Voltage regulation in MV networks with dispersed generations by a neural-based multiobjective methodology

Energy Technology Data Exchange (ETDEWEB)

Galdi, Vincenzo [Dipartimento di Ingegneria dell' Informazione e Ingegneria Elettrica, Universita degli studi di Salerno, Via Ponte Don Melillo 1, 84084 Fisciano (Italy); Vaccaro, Alfredo; Villacci, Domenico [Dipartimento di Ingegneria, Universita degli Studi del Sannio, Piazza Roma 21, 82100 Benevento (Italy)

2008-05-15

This paper puts forward the role of learning techniques in addressing the problem of an efficient and optimal centralized voltage control in distribution networks equipped with dispersed generation systems (DGSs). The proposed methodology employs a radial basis function network (RBFN) to identify the multidimensional nonlinear mapping between a vector of observable variables describing the network operating point and the optimal set points of the voltage regulating devices. The RBFN is trained by numerical data generated by solving the voltage regulation problem for a set of network operating points by a rigorous multiobjective solution methodology. The RBFN performance is continuously monitored by a supervisor process that notifies when there is the need of a more accurate solution of the voltage regulation problem if nonoptimal network operating conditions (ex post monitoring) or excessive distances between the actual network state and the neuron's centres (ex ante monitoring) are detected. A more rigorous problem solution, if required, can be obtained by solving the voltage regulation problem by a conventional multiobjective optimization technique. This new solution, in conjunction with the corresponding input vector, is then adopted as a new train data sample to adapt the RBFN. This online training process allows RBFN to (i) adaptively learn the more representative domain space regions of the input/output mapping without needing a prior knowledge of a complete and representative training set, and (ii) manage effectively any time varying phenomena affecting this mapping. The results obtained by simulating the regulation policy in the case of a medium-voltage network are very promising. (author)

Distance Education at Conventional Universities in Germany

Directory of Open Access Journals (Sweden)

Hans-Henning Kappel

2002-01-01

Full Text Available Germany’s educational system has undergone a series of transformations during the last 40 years. In recent years, marked increases in enrolment have occurred. In response, admission requirements have been relaxed and new universities have been established.Academic distance education in the former Federal Republic of Germany (West Germany was ushered in by the educational radio broadcasts around the end of the 1960s. Aside from the formation of the FernUniversität (Open University in West Germany in 1975, there were significant developments in distance education occurring at the major universities in the German Democratic Republic (East Germany. After German reunification in 1990, the new unitary state launched programs to advance the development of distance education programs at conventional universities.Germany’s campus-based universities (Präsenzuniversitäten created various entities, including central units and consortia of universities to design and market distance education programs. Hybridisation provides the necessary prerequisites for dual mode delivery, such as basic and continuing education programs, as well as for the combination of distance and campus-based education (Präsenzstudium. Hybridisation also has also opened the door for the creation of new programs.Following an initial phase in which distance education research is expected to centralize a trend towards decentralisation is likely to follow. The German Association for Distance Education (AG-F offers a viable research network in distance education. Two dual mode case studies are also be surveyed: The Master of Arts degree, offered by the University of Koblenz-Landau, with Library Science as the second major, and the University of Kaiserslautern, where basic education will continue to be captured within the domain of the Präsenzstudium or campus-based education.The area in which distance education is flourishing most is within the field of academic continuing

Functional mapping of language networks in the normal brain using a word-association task

International Nuclear Information System (INIS)

Ghosh, Shantanu; Basu, Amrita; Kumaran, Senthil S; Khushu, Subash

2010-01-01

Language functions are known to be affected in diverse neurological conditions, including ischemic stroke, traumatic brain injury, and brain tumors. Because language networks are extensive, interpretation of functional data depends on the task completed during evaluation. The aim was to map the hemodynamic consequences of word association using functional magnetic resonance imaging (fMRI) in normal human subjects. Ten healthy subjects underwent fMRI scanning with a postlexical access semantic association task vs lexical processing task. The fMRI protocol involved a T2*-weighted gradient-echo echo-planar imaging (GE-EPI) sequence (TR 4523 ms, TE 64 ms, flip angle 90°) with alternate baseline and activation blocks. A total of 78 scans were taken (interscan interval = 3 s) with a total imaging time of 587 s. Functional data were processed in Statistical Parametric Mapping software (SPM2) with 8-mm Gaussian kernel by convolving the blood oxygenation level-dependent (BOLD) signal with an hemodynamic response function estimated by general linear method to generate SPM{t} and SPM{F} maps. Single subject analysis of the functional data (FWE-corrected, P≤0.001) revealed extensive activation in the frontal lobes, with overlaps among middle frontal gyrus (MFG), superior, and inferior frontal gyri. BOLD activity was also found in the medial frontal gyrus, middle occipital gyrus (MOG), anterior fusiform gyrus, superior and inferior parietal lobules, and to a smaller extent, the thalamus and right anterior cerebellum. Group analysis (FWE-corrected, P≤0.001) revealed neural recruitment of bilateral lingual gyri, left MFG, bilateral MOG, left superior occipital gyrus, left fusiform gyrus, bilateral thalami, and right cerebellar areas. Group data analysis revealed a cerebellar–occipital–fusiform–thalamic network centered around bilateral lingual gyri for word association, thereby indicating how these areas facilitate language comprehension by activating a semantic

Functional mapping of language networks in the normal brain using a word-association task

Directory of Open Access Journals (Sweden)

Ghosh Shantanu

2010-01-01

Full Text Available Background: Language functions are known to be affected in diverse neurological conditions, including ischemic stroke, traumatic brain injury, and brain tumors. Because language networks are extensive, interpretation of functional data depends on the task completed during evaluation. Aim: The aim was to map the hemodynamic consequences of word association using functional magnetic resonance imaging (fMRI in normal human subjects. Materials and Methods: Ten healthy subjects underwent fMRI scanning with a postlexical access semantic association task vs lexical processing task. The fMRI protocol involved a T2FNx01-weighted gradient-echo echo-planar imaging (GE-EPI sequence (TR 4523 ms, TE 64 ms, flip angle 90º with alternate baseline and activation blocks. A total of 78 scans were taken (interscan interval = 3 s with a total imaging time of 587 s. Functional data were processed in Statistical Parametric Mapping software (SPM2 with 8-mm Gaussian kernel by convolving the blood oxygenation level-dependent (BOLD signal with an hemodynamic response function estimated by general linear method to generate SPM{t} and SPM{F} maps. Results: Single subject analysis of the functional data (FWE-corrected, P≤0.001 revealed extensive activation in the frontal lobes, with overlaps among middle frontal gyrus (MFG, superior, and inferior frontal gyri. BOLD activity was also found in the medial frontal gyrus, middle occipital gyrus (MOG, anterior fusiform gyrus, superior and inferior parietal lobules, and to a smaller extent, the thalamus and right anterior cerebellum. Group analysis (FWE-corrected, P≤0.001 revealed neural recruitment of bilateral lingual gyri, left MFG, bilateral MOG, left superior occipital gyrus, left fusiform gyrus, bilateral thalami, and right cerebellar areas. Conclusions: Group data analysis revealed a cerebellar-occipital-fusiform-thalamic network centered around bilateral lingual gyri for word association, thereby indicating how these

Moving from theory to practice: A participatory social network mapping approach to address unmet need for family planning in Benin.

Science.gov (United States)

Igras, Susan; Diakité, Mariam; Lundgren, Rebecka

2017-07-01

In West Africa, social factors influence whether couples with unmet need for family planning act on birth-spacing desires. Tékponon Jikuagou is testing a social network-based intervention to reduce social barriers by diffusing new ideas. Individuals and groups judged socially influential by their communities provide entrée to networks. A participatory social network mapping methodology was designed to identify these diffusion actors. Analysis of monitoring data, in-depth interviews, and evaluation reports assessed the methodology's acceptability to communities and staff and whether it produced valid, reliable data to identify influential individuals and groups who diffuse new ideas through their networks. Results indicated the methodology's acceptability. Communities were actively and equitably engaged. Staff appreciated its ability to yield timely, actionable information. The mapping methodology also provided valid and reliable information by enabling communities to identify highly connected and influential network actors. Consistent with social network theory, this methodology resulted in the selection of informal groups and individuals in both informal and formal positions. In-depth interview data suggest these actors were diffusing new ideas, further confirming their influence/connectivity. The participatory methodology generated insider knowledge of who has social influence, challenging commonly held assumptions. Collecting and displaying information fostered staff and community learning, laying groundwork for social change.

Detecting tactical patterns in basketball: comparison of merge self-organising maps and dynamic controlled neural networks.

Science.gov (United States)

Kempe, Matthias; Grunz, Andreas; Memmert, Daniel

2015-01-01

The soaring amount of data, especially spatial-temporal data, recorded in recent years demands for advanced analysis methods. Neural networks derived from self-organizing maps established themselves as a useful tool to analyse static and temporal data. In this study, we applied the merge self-organising map (MSOM) to spatio-temporal data. To do so, we investigated the ability of MSOM's to analyse spatio-temporal data and compared its performance to the common dynamical controlled network (DyCoN) approach to analyse team sport position data. The position data of 10 players were recorded via the Ubisense tracking system during a basketball game. Furthermore, three different pre-selected plays were recorded for classification. Following data preparation, the different nets were trained with the data of the first half. The training success of both networks was evaluated by achieved entropy. The second half of the basketball game was presented to both nets for automatic classification. Both approaches were able to present the trained data extremely well and to detect the pre-selected plays correctly. In conclusion, MSOMs are a useful tool to analyse spatial-temporal data, especially in team sports. By their direct inclusion of different time length of tactical patterns, they open up new opportunities within team sports.

Renormalization group theory for percolation in time-varying networks.

Science.gov (United States)

Karschau, Jens; Zimmerling, Marco; Friedrich, Benjamin M

2018-05-22

Motivated by multi-hop communication in unreliable wireless networks, we present a percolation theory for time-varying networks. We develop a renormalization group theory for a prototypical network on a regular grid, where individual links switch stochastically between active and inactive states. The question whether a given source node can communicate with a destination node along paths of active links is equivalent to a percolation problem. Our theory maps the temporal existence of multi-hop paths on an effective two-state Markov process. We show analytically how this Markov process converges towards a memoryless Bernoulli process as the hop distance between source and destination node increases. Our work extends classical percolation theory to the dynamic case and elucidates temporal correlations of message losses. Quantification of temporal correlations has implications for the design of wireless communication and control protocols, e.g. in cyber-physical systems such as self-organized swarms of drones or smart traffic networks.

Outcomes of Interorganizational Networks in Canada for Chronic Disease Prevention: Insights From a Concept Mapping Study, 2015.

Science.gov (United States)

Willis, Cameron; Kernoghan, Alison; Riley, Barbara; Popp, Janice; Best, Allan; Milward, H Brinton

2015-11-19

We conducted a mixed methods study from June 2014 to March 2015 to assess the perspectives of stakeholders in networks that adopt a population approach for chronic disease prevention (CDP). The purpose of the study was to identify important and feasible outcome measures for monitoring network performance. Participants from CDP networks in Canada completed an online concept mapping exercise, which was followed by interviews with network stakeholders to further understand the findings. Nine concepts were considered important outcomes of CDP networks: enhanced learning, improved use of resources, enhanced or increased relationships, improved collaborative action, network cohesion, improved system outcomes, improved population health outcomes, improved practice and policy planning, and improved intersectoral engagement. Three themes emerged from participant interviews related to measurement of the identified concepts: the methodological difficulties in measuring network outcomes, the dynamic nature of network evolution and function and implications for outcome assessment, and the challenge of measuring multisectoral engagement in CDP networks. Results from this study provide initial insights into concepts that can be used to describe the outcomes of networks for CDP and may offer foundations for strengthening network outcome-monitoring strategies and methodologies.

Performance Analysis of Millimeter-Wave Multi-hop Machine-to-Machine Networks Based on Hop Distance Statistics

Directory of Open Access Journals (Sweden)

Haejoon Jung

2018-01-01

Full Text Available As an intrinsic part of the Internet of Things (IoT ecosystem, machine-to-machine (M2M communications are expected to provide ubiquitous connectivity between machines. Millimeter-wave (mmWave communication is another promising technology for the future communication systems to alleviate the pressure of scarce spectrum resources. For this reason, in this paper, we consider multi-hop M2M communications, where a machine-type communication (MTC device with the limited transmit power relays to help other devices using mmWave. To be specific, we focus on hop distance statistics and their impacts on system performances in multi-hop wireless networks (MWNs with directional antenna arrays in mmWave for M2M communications. Different from microwave systems, in mmWave communications, wireless channel suffers from blockage by obstacles that heavily attenuate line-of-sight signals, which may result in limited per-hop progress in MWNs. We consider two routing strategies aiming at different types of applications and derive the probability distributions of their hop distances. Moreover, we provide their baseline statistics assuming the blockage-free scenario to quantify the impact of blockages. Based on the hop distance analysis, we propose a method to estimate the end-to-end performances (e.g., outage probability, hop count, and transmit energy of the mmWave MWNs, which provides important insights into mmWave MWN design without time-consuming and repetitive end-to-end simulation.

Performance Analysis of Millimeter-Wave Multi-hop Machine-to-Machine Networks Based on Hop Distance Statistics.

Science.gov (United States)

Jung, Haejoon; Lee, In-Ho

2018-01-12

As an intrinsic part of the Internet of Things (IoT) ecosystem, machine-to-machine (M2M) communications are expected to provide ubiquitous connectivity between machines. Millimeter-wave (mmWave) communication is another promising technology for the future communication systems to alleviate the pressure of scarce spectrum resources. For this reason, in this paper, we consider multi-hop M2M communications, where a machine-type communication (MTC) device with the limited transmit power relays to help other devices using mmWave. To be specific, we focus on hop distance statistics and their impacts on system performances in multi-hop wireless networks (MWNs) with directional antenna arrays in mmWave for M2M communications. Different from microwave systems, in mmWave communications, wireless channel suffers from blockage by obstacles that heavily attenuate line-of-sight signals, which may result in limited per-hop progress in MWNs. We consider two routing strategies aiming at different types of applications and derive the probability distributions of their hop distances. Moreover, we provide their baseline statistics assuming the blockage-free scenario to quantify the impact of blockages. Based on the hop distance analysis, we propose a method to estimate the end-to-end performances (e.g., outage probability, hop count, and transmit energy) of the mmWave MWNs, which provides important insights into mmWave MWN design without time-consuming and repetitive end-to-end simulation.

Diffusion of non-traditional cookstoves across western Honduras: A social network analysis

International Nuclear Information System (INIS)

Ramirez, Sebastian; Dwivedi, Puneet; Ghilardi, Adrian; Bailis, Robert

2014-01-01

A third of the world's population uses inefficient biomass stoves, contributing to severe health problems, forest degradation, and climate change. Clean burning, fuel-efficient, non-traditional cookstoves (NTCS) are a promising solution; however, numerous projects fail during the diffusion process. We use social network analysis to reveal patterns driving a successful stove intervention in western Honduras. The intervention lacks formal marketing, but has spread across a wide area in just a few years. To understand the process, we map the social network of active community members who drove diffusion across a large swath of the country. We find that most ACMs heard about stoves twice before sharing information about it with others and introducing the stove into their own communities. On average, the social distance between ACMs and the project team is 3 degrees of separation. Both men and women are critical to the diffusion process, but men tend to communicate over longer distances, while women principally communicate over shorter distances. Government officials are also crucial to diffusion. Understanding how information moves through social networks and across geographic space allows us to theorize how knowledge about beneficial technologies spreads in the absence of formal marketing and inform policies for NTCS deployment worldwide. - Highlights: • We build a chain of referrals to track spread of information about non traditional cookstoves. • We find differences among gender and occupations that should inform policy. • People hear about the stoves twice before becoming suppliers of information. • Government officials play a substantial role in the diffusion. • Males play leading role in diffusion over long distances, females in short distances

Unified treatment of the luminosity distance in cosmology

International Nuclear Information System (INIS)

Yoo, Jaiyul; Scaccabarozzi, Fulvio

2016-01-01

Comparing the luminosity distance measurements to its theoretical predictions is one of the cornerstones in establishing the modern cosmology. However, as shown in Biern and Yoo, its theoretical predictions in literature are often plagued with infrared divergences and gauge-dependences. This trend calls into question the sanity of the methods used to derive the luminosity distance. Here we critically investigate four different methods—the geometric approach, the Sachs approach, the Jacobi mapping approach, and the geodesic light cone (GLC) approach to modeling the luminosity distance, and we present a unified treatment of such methods, facilitating the comparison among the methods and checking their sanity. All of these four methods, if exercised properly, can be used to reproduce the correct description of the luminosity distance.

Unified treatment of the luminosity distance in cosmology

Energy Technology Data Exchange (ETDEWEB)

Yoo, Jaiyul; Scaccabarozzi, Fulvio, E-mail: jyoo@physik.uzh.ch, E-mail: fulvio@physik.uzh.ch [Center for Theoretical Astrophysics and Cosmology, Institute for Computational Science, University of Zürich, Zürich (Switzerland)

2016-09-01

Comparing the luminosity distance measurements to its theoretical predictions is one of the cornerstones in establishing the modern cosmology. However, as shown in Biern and Yoo, its theoretical predictions in literature are often plagued with infrared divergences and gauge-dependences. This trend calls into question the sanity of the methods used to derive the luminosity distance. Here we critically investigate four different methods—the geometric approach, the Sachs approach, the Jacobi mapping approach, and the geodesic light cone (GLC) approach to modeling the luminosity distance, and we present a unified treatment of such methods, facilitating the comparison among the methods and checking their sanity. All of these four methods, if exercised properly, can be used to reproduce the correct description of the luminosity distance.

MAPS of Cancer

Science.gov (United States)

Gray, Lincoln

1998-01-01

Our goal was to produce an interactive visualization from a mathematical model that successfully predicts metastases from head and neck cancer. We met this goal early in the project. The visualization is available for the public to view. Our work appears to fill a need for more information about this deadly disease. The idea of this project was to make an easily interpretable visualization based on what we call "functional maps" of disease. A functional map is a graphic summary of medical data, where distances between parts of the body are determined by the probability of disease, not by anatomical distances. Functional maps often beat little resemblance to anatomical maps, but they can be used to predict the spread of disease. The idea of modeling the spread of disease in an abstract multidimensional space is difficult for many people. Our goal was to make the important predictions easy to see. NASA must face this problem frequently: how to help laypersons and professionals see important trends in abstract, complex data. We took advantage of concepts perfected in NASA's graphics libraries. As an analogy, consider a functional map of early America. Suppose we choose travel times, rather than miles, as our measures of inter-city distances. For Abraham Lincoln, travel times would have been the more meaningful measure of separation between cities. In such a map New Orleans would be close to Memphis because of the Mississippi River. St. Louis would be close to Portland because of the Oregon Trail. Oklahoma City would be far from Little Rock because of the Cheyenne. Such a map would look puzzling to those of us who have always seen physical maps, but the functional map would be more useful in predicting the probabilities of inter-site transit. Continuing the analogy, we could predict the spread of social diseases such as gambling along the rivers and cattle rustling along the trails. We could simply print the functional map of America, but it would be more interesting

Mapping racism.

Science.gov (United States)

Moss, Donald B

2006-01-01

The author uses the metaphor of mapping to illuminate a structural feature of racist thought, locating the degraded object along vertical and horizontal axes. These axes establish coordinates of hierarchy and of distance. With the coordinates in place, racist thought begins to seem grounded in natural processes. The other's identity becomes consolidated, and parochialism results. The use of this kind of mapping is illustrated via two patient vignettes. The author presents Freud's (1905, 1927) views in relation to such a "mapping" process, as well as Adorno's (1951) and Baldwin's (1965). Finally, the author conceptualizes the crucial status of primitivity in the workings of racist thought.

Risk mapping of Rinderpest sero-prevalence in Central and Southern Somalia based on spatial and network risk factors.

Science.gov (United States)

Ortiz-Pelaez, Angel; Pfeiffer, Dirk U; Tempia, Stefano; Otieno, F Tom; Aden, Hussein H; Costagli, Riccardo

2010-04-28

In contrast to most pastoral systems, the Somali livestock production system is oriented towards domestic trade and export with seasonal movement patterns of herds/flocks in search of water and pasture and towards export points. Data from a rinderpest survey and other data sources have been integrated to explore the topology of a contact network of cattle herds based on a spatial proximity criterion and other attributes related to cattle herd dynamics. The objective of the study is to integrate spatial mobility and other attributes with GIS and network approaches in order to develop a predictive spatial model of presence of rinderpest. A spatial logistic regression model was fitted using data for 562 point locations. It includes three statistically significant continuous-scale variables that increase the risk of rinderpest: home range radius, herd density and clustering coefficient of the node of the network whose link was established if the sum of the home ranges of every pair of nodes was equal or greater than the shortest distance between the points. The sensitivity of the model is 85.1% and the specificity 84.6%, correctly classifying 84.7% of the observations. The spatial autocorrelation not accounted for by the model is negligible and visual assessment of a semivariogram of the residuals indicated that there was no undue amount of spatial autocorrelation. The predictive model was applied to a set of 6176 point locations covering the study area. Areas at high risk of having serological evidence of rinderpest are located mainly in the coastal districts of Lower and Middle Juba, the coastal area of Lower Shabele and in the regions of Middle Shabele and Bay. There are also isolated spots of high risk along the border with Kenya and the southern area of the border with Ethiopia. The identification of point locations and areas with high risk of presence of rinderpest and their spatial visualization as a risk map will be useful for informing the prioritization of

A Managerial Analysis of ATM in Facilitating Distance Education.

Science.gov (United States)

Littman, Marlyn Kemper

In this paper, the fundamental characteristics and capabilities of ATM (Asynchronous Transfer Mode) networks in a distance learning environment are examined. Current and projected ATM applications are described, and issues and challenges associated with developing ATM networking solutions for instructional delivery are explored. Other topics…

Fine mapping of multiple QTL using combined linkage and linkage disequilibrium mapping – A comparison of single QTL and multi QTL methods

Directory of Open Access Journals (Sweden)

Meuwissen Theo HE

2007-04-01

Full Text Available Abstract Two previously described QTL mapping methods, which combine linkage analysis (LA and linkage disequilibrium analysis (LD, were compared for their ability to detect and map multiple QTL. The methods were tested on five different simulated data sets in which the exact QTL positions were known. Every simulated data set contained two QTL, but the distances between these QTL were varied from 15 to 150 cM. The results show that the single QTL mapping method (LDLA gave good results as long as the distance between the QTL was large (> 90 cM. When the distance between the QTL was reduced, the single QTL method had problems positioning the two QTL and tended to position only one QTL, i.e. a "ghost" QTL, in between the two real QTL positions. The multi QTL mapping method (MP-LDLA gave good results for all evaluated distances between the QTL. For the large distances between the QTL (> 90 cM the single QTL method more often positioned the QTL in the correct marker bracket, but considering the broader likelihood peaks of the single point method it could be argued that the multi QTL method was more precise. Since the distances were reduced the multi QTL method was clearly more accurate than the single QTL method. The two methods combine well, and together provide a good tool to position single or multiple QTL in practical situations, where the number of QTL and their positions are unknown.

Measuring the Accuracy of Simple Evolving Connectionist System with Varying Distance Formulas

Science.gov (United States)

Al-Khowarizmi; Sitompul, O. S.; Suherman; Nababan, E. B.

2017-12-01

Simple Evolving Connectionist System (SECoS) is a minimal implementation of Evolving Connectionist Systems (ECoS) in artificial neural networks. The three-layer network architecture of the SECoS could be built based on the given input. In this study, the activation value for the SECoS learning process, which is commonly calculated using normalized Hamming distance, is also calculated using normalized Manhattan distance and normalized Euclidean distance in order to compare the smallest error value and best learning rate obtained. The accuracy of measurement resulted by the three distance formulas are calculated using mean absolute percentage error. In the training phase with several parameters, such as sensitivity threshold, error threshold, first learning rate, and second learning rate, it was found that normalized Euclidean distance is more accurate than both normalized Hamming distance and normalized Manhattan distance. In the case of beta fibrinogen gene -455 G/A polymorphism patients used as training data, the highest mean absolute percentage error value is obtained with normalized Manhattan distance compared to normalized Euclidean distance and normalized Hamming distance. However, the differences are very small that it can be concluded that the three distance formulas used in SECoS do not have a significant effect on the accuracy of the training results.

Development of the Social Network-Based Intervention "Powerful Together with Diabetes" Using Intervention Mapping.

Science.gov (United States)

Vissenberg, Charlotte; Nierkens, Vera; Uitewaal, Paul J M; Middelkoop, Barend J C; Nijpels, Giel; Stronks, Karien

2017-01-01

This article describes the development of the social network-based intervention Powerful Together with Diabetes which aims to improve diabetes self-management (DSM) among patients with type 2 diabetes living in socioeconomically deprived neighborhoods by stimulating social support for DSM and diminishing social influences hindering DSM (e.g., peer pressure and social norms). The intervention was specifically developed for patients with Dutch, Turkish, Moroccan, and Surinamese backgrounds. The intervention was developed according to Intervention Mapping. This article describes the first four steps of Intervention Mapping: (1) the needs assessment; (2) development of performance and change objectives; (3) selection of theory-based methods and strategies; and (4) the translation of these into an organized program. These four steps resulted in Powerful Together with Diabetes , a 10-month group-based intervention consisting of 24 meetings, 6 meetings for significant others, and 2 meetings for participants and their spouses. The IM method resulted in a tailored approach with a specific focus on the social networks of its participants. This article concludes that the IM method helped our planning team to tailor the intervention to the needs of our target population and facilitated our evaluation design. However, in hindsight, the intervention could have been improved by investing more in participatory planning and community involvement.

Identification of discrete chaotic maps with singular points

Directory of Open Access Journals (Sweden)

P. G. Akishin

2001-01-01

Full Text Available We investigate the ability of artificial neural networks to reconstruct discrete chaotic maps with singular points. We use as a simple test model the Cusp map. We compare the traditional Multilayer Perceptron, the Chebyshev Neural Network and the Wavelet Neural Network. The numerical scheme for the accurate determination of a singular point is also developed. We show that combining a neural network with the numerical algorithm for the determination of the singular point we are able to accurately approximate discrete chaotic maps with singularities.

Slicing, sampling, and distance-dependent effects affect network measures in simulated cortical circuit structures.

Science.gov (United States)

Miner, Daniel C; Triesch, Jochen

2014-01-01

The neuroanatomical connectivity of cortical circuits is believed to follow certain rules, the exact origins of which are still poorly understood. In particular, numerous nonrandom features, such as common neighbor clustering, overrepresentation of reciprocal connectivity, and overrepresentation of certain triadic graph motifs have been experimentally observed in cortical slice data. Some of these data, particularly regarding bidirectional connectivity are seemingly contradictory, and the reasons for this are unclear. Here we present a simple static geometric network model with distance-dependent connectivity on a realistic scale that naturally gives rise to certain elements of these observed behaviors, and may provide plausible explanations for some of the conflicting findings. Specifically, investigation of the model shows that experimentally measured nonrandom effects, especially bidirectional connectivity, may depend sensitively on experimental parameters such as slice thickness and sampling area, suggesting potential explanations for the seemingly conflicting experimental results.

Ministerial formation of theological students through distance education

Directory of Open Access Journals (Sweden)

Marilyn Naidoo

2012-02-01

Full Text Available Ministerial formation is a multifaceted activity involving critical thinking, the acquisition of knowledge, skills development, religious identity formation and the development of ministerial and spiritual maturity expected of church ministers. Education is not merely the accumulation of a prescribed set of academic credits but includes the holistic formation of all aspects of the individual. However, theological educators are concerned about the capacity to foster such values and skills in the distance and electronic environment. Some see distance education as ‘distancing’ the students in more significant ways than simply geographic distance. These issues are of fundamental importance for they reflect the deeper convictions of theologians that distance education may not be a suitable medium for ministerial formation. This article creates a conceptual map of the theological and pedagogical challenges for ministerial formation and highlights how the possibility of formation is being carried out in the distance-learning environment.

Computing Distances between Probabilistic Automata

Directory of Open Access Journals (Sweden)

Mathieu Tracol

2011-07-01

Full Text Available We present relaxed notions of simulation and bisimulation on Probabilistic Automata (PA, that allow some error epsilon. When epsilon is zero we retrieve the usual notions of bisimulation and simulation on PAs. We give logical characterisations of these notions by choosing suitable logics which differ from the elementary ones, L with negation and L without negation, by the modal operator. Using flow networks, we show how to compute the relations in PTIME. This allows the definition of an efficiently computable non-discounted distance between the states of a PA. A natural modification of this distance is introduced, to obtain a discounted distance, which weakens the influence of long term transitions. We compare our notions of distance to others previously defined and illustrate our approach on various examples. We also show that our distance is not expansive with respect to process algebra operators. Although L without negation is a suitable logic to characterise epsilon-(bisimulation on deterministic PAs, it is not for general PAs; interestingly, we prove that it does characterise weaker notions, called a priori epsilon-(bisimulation, which we prove to be NP-difficult to decide.

Euclidean distance geometry an introduction

CERN Document Server

Liberti, Leo

2017-01-01

This textbook, the first of its kind, presents the fundamentals of distance geometry:  theory, useful methodologies for obtaining solutions, and real world applications. Concise proofs are given and step-by-step algorithms for solving fundamental problems efficiently and precisely are presented in Mathematica®, enabling the reader to experiment with concepts and methods as they are introduced. Descriptive graphics, examples, and problems, accompany the real gems of the text, namely the applications in visualization of graphs, localization of sensor networks, protein conformation from distance data, clock synchronization protocols, robotics, and control of unmanned underwater vehicles, to name several.  Aimed at intermediate undergraduates, beginning graduate students, researchers, and practitioners, the reader with a basic knowledge of linear algebra will gain an understanding of the basic theories of distance geometry and why they work in real life.

Geography versus topology in the European Ownership Network

International Nuclear Information System (INIS)

Vitali, Stefania; Battiston, Stefano

2011-01-01

In this paper, we investigate the network of ownership relationships among European firms and its embedding in the geographical space. We carry out a detailed analysis of geographical distances between pairs of nodes, connected by edges or by shortest paths of varying length. In particular, we study the relation between geographical distance and network distance in comparison with a random spatial network model. While the distribution of geographical distance can be fairly well reproduced, important deviations appear in the network distance and in the size of the largest strongly connected component. Our results show that geographical factors allow us to capture several features of the network, while the deviations quantify the effect of additional economic factors at work in shaping the topology. The analysis is relevant to other types of geographically embedded networks and sheds light on the link formation process in the presence of spatial constraints.

Long distance synchronization of mobile robots

NARCIS (Netherlands)

Alvarez Aguirre, A.; Nijmeijer, H.; Oguchi, T.

2010-01-01

This paper considers the long distance master-slave and mutual synchronization of unicycle-type mobile robots. The issues that arise when the elements of a robotic network are placed in different locations are addressed, specifically the time-delay induced by the communication channel linking the

Buckshot Routing with Distance Vectors in Three Application Scenarios for Wireless Sensor Networks with Unstable Network Topologies and Unidirectional Links

Directory of Open Access Journals (Sweden)

Reinhardt Karnapke

2015-02-01

Full Text Available Experiments have shown that the number of asymmetric and unidirectional links often exceeds the number of bidirectional ones, especially in the transitional area of the communication range of wireless sensor nodes. Still, most of today’s routing protocols ignore their existence or try to remove their implications. Also, links are not stable over time, and routes become unusable often, resulting in a need for new routing protocols that can handle highly dynamic links and use unidirectional links to their advantage. At SENSORCOMM' 2014, we presented BuckshotDV, a routing protocol which is resilient against link fluctuations and uses the longer reach of unidirectional links to increase its performance. Furthermore, its distance vector nature makes it scalable for large sensor networks. This paper is an extended version which adds some implementation details and the evaluation of BuckshotDV in two more application scenarios.

Analysis of Camera Parameters Value in Various Object Distances Calibration

International Nuclear Information System (INIS)

Yusoff, Ahmad Razali; Ariff, Mohd Farid Mohd; Idris, Khairulnizam M; Majid, Zulkepli; Setan, Halim; Chong, Albert K

2014-01-01

In photogrammetric applications, good camera parameters are needed for mapping purpose such as an Unmanned Aerial Vehicle (UAV) that encompassed with non-metric camera devices. Simple camera calibration was being a common application in many laboratory works in order to get the camera parameter's value. In aerial mapping, interior camera parameters' value from close-range camera calibration is used to correct the image error. However, the causes and effects of the calibration steps used to get accurate mapping need to be analyze. Therefore, this research aims to contribute an analysis of camera parameters from portable calibration frame of 1.5 × 1 meter dimension size. Object distances of two, three, four, five, and six meters are the research focus. Results are analyzed to find out the changes in image and camera parameters' value. Hence, camera calibration parameter's of a camera is consider different depend on type of calibration parameters and object distances

Mapping standards for home networking

NARCIS (Netherlands)

Kaa, G. van de; Hartog, F.T.H. den; Vries, H.J. de

2009-01-01

In this study, we apply a step-by-step approach for the identification of standards for home networking. We develop a classification and we use this classification to categorize sixty-four (sets of) standards. By developing this categorization, we have brought order to the chaos of home networking

Don't Stop Believing: Mapping Distance Learners' Research Journeys

Science.gov (United States)

Brahme, Maria E.; Gabriel, Lizette; Stenis, Paul V.

2016-01-01

Journey mapping, a method of collecting data that illustrates individuals' paths toward a specific goal, was originally developed for use in retail/customer service environments. Much of the literature describes its application in examining customer behavior when navigating merchants' Websites, allowing researchers to examine the effectiveness,…

Properties of healthcare teaming networks as a function of network construction algorithms.

Directory of Open Access Journals (Sweden)

Martin S Zand

Full Text Available Network models of healthcare systems can be used to examine how providers collaborate, communicate, refer patients to each other, and to map how patients traverse the network of providers. Most healthcare service network models have been constructed from patient claims data, using billing claims to link a patient with a specific provider in time. The data sets can be quite large (106-108 individual claims per year, making standard methods for network construction computationally challenging and thus requiring the use of alternate construction algorithms. While these alternate methods have seen increasing use in generating healthcare networks, there is little to no literature comparing the differences in the structural properties of the generated networks, which as we demonstrate, can be dramatically different. To address this issue, we compared the properties of healthcare networks constructed using different algorithms from 2013 Medicare Part B outpatient claims data. Three different algorithms were compared: binning, sliding frame, and trace-route. Unipartite networks linking either providers or healthcare organizations by shared patients were built using each method. We find that each algorithm produced networks with substantially different topological properties, as reflected by numbers of edges, network density, assortativity, clustering coefficients and other structural measures. Provider networks adhered to a power law, while organization networks were best fit by a power law with exponential cutoff. Censoring networks to exclude edges with less than 11 shared patients, a common de-identification practice for healthcare network data, markedly reduced edge numbers and network density, and greatly altered measures of vertex prominence such as the betweenness centrality. Data analysis identified patterns in the distance patients travel between network providers, and a striking set of teaming relationships between providers in the Northeast

Characteristic Length Scales in Fracture Networks: Hydraulic Connectivity through Periodic Hydraulic Tests

Science.gov (United States)

Becker, M.; Bour, O.; Le Borgne, T.; Longuevergne, L.; Lavenant, N.; Cole, M. C.; Guiheneuf, N.

2017-12-01

Determining hydraulic and transport connectivity in fractured bedrock has long been an important objective in contaminant hydrogeology, petroleum engineering, and geothermal operations. A persistent obstacle to making this determination is that the characteristic length scale is nearly impossible to determine in sparsely fractured networks. Both flow and transport occur through an unknown structure of interconnected fracture and/or fracture zones making the actual length that water or solutes travel undetermined. This poses difficulties for flow and transport models. For, example, hydraulic equations require a separation distance between pumping and observation well to determine hydraulic parameters. When wells pairs are close, the structure of the network can influence the interpretation of well separation and the flow dimension of the tested system. This issue is explored using hydraulic tests conducted in a shallow fractured crystalline rock. Periodic (oscillatory) slug tests were performed at the Ploemeur fractured rock test site located in Brittany, France. Hydraulic connectivity was examined between three zones in one well and four zones in another, located 6 m apart in map view. The wells are sufficiently close, however, that the tangential distance between the tested zones ranges between 6 and 30 m. Using standard periodic formulations of radial flow, estimates of storativity scale inversely with the square of the separation distance and hydraulic diffusivity directly with the square of the separation distance. Uncertainty in the connection paths between the two wells leads to an order of magnitude uncertainty in estimates of storativity and hydraulic diffusivity, although estimates of transmissivity are unaffected. The assumed flow dimension results in alternative estimates of hydraulic parameters. In general, one is faced with the prospect of assuming the hydraulic parameter and inverting the separation distance, or vice versa. Similar uncertainties exist

System Analysis by Mapping a Fault-tree into a Bayesian-network

Science.gov (United States)

Sheng, B.; Deng, C.; Wang, Y. H.; Tang, L. H.

2018-05-01

In view of the limitations of fault tree analysis in reliability assessment, Bayesian Network (BN) has been studied as an alternative technology. After a brief introduction to the method for mapping a Fault Tree (FT) into an equivalent BN, equations used to calculate the structure importance degree, the probability importance degree and the critical importance degree are presented. Furthermore, the correctness of these equations is proved mathematically. Combining with an aircraft landing gear’s FT, an equivalent BN is developed and analysed. The results show that richer and more accurate information have been achieved through the BN method than the FT, which demonstrates that the BN is a superior technique in both reliability assessment and fault diagnosis.

Image Inpainting Based on Coherence Transport with Adapted Distance Functions

KAUST Repository

März, Thomas

2011-01-01

We discuss an extension of our method image inpainting based on coherence transport. For the latter method the pixels of the inpainting domain have to be serialized into an ordered list. Until now, to induce the serialization we have used the distance to boundary map. But there are inpainting problems where the distance to boundary serialization causes unsatisfactory inpainting results. In the present work we demonstrate cases where we can resolve the difficulties by employing other distance functions which better suit the problem at hand. © 2011 Society for Industrial and Applied Mathematics.

Estimation of visual maps with a robot network equipped with vision sensors.

Science.gov (United States)

Gil, Arturo; Reinoso, Óscar; Ballesta, Mónica; Juliá, Miguel; Payá, Luis

2010-01-01

In this paper we present an approach to the Simultaneous Localization and Mapping (SLAM) problem using a team of autonomous vehicles equipped with vision sensors. The SLAM problem considers the case in which a mobile robot is equipped with a particular sensor, moves along the environment, obtains measurements with its sensors and uses them to construct a model of the space where it evolves. In this paper we focus on the case where several robots, each equipped with its own sensor, are distributed in a network and view the space from different vantage points. In particular, each robot is equipped with a stereo camera that allow the robots to extract visual landmarks and obtain relative measurements to them. We propose an algorithm that uses the measurements obtained by the robots to build a single accurate map of the environment. The map is represented by the three-dimensional position of the visual landmarks. In addition, we consider that each landmark is accompanied by a visual descriptor that encodes its visual appearance. The solution is based on a Rao-Blackwellized particle filter that estimates the paths of the robots and the position of the visual landmarks. The validity of our proposal is demonstrated by means of experiments with a team of real robots in a office-like indoor environment.

Estimation of Visual Maps with a Robot Network Equipped with Vision Sensors

Directory of Open Access Journals (Sweden)

Arturo Gil

2010-05-01

Full Text Available In this paper we present an approach to the Simultaneous Localization and Mapping (SLAM problem using a team of autonomous vehicles equipped with vision sensors. The SLAM problem considers the case in which a mobile robot is equipped with a particular sensor, moves along the environment, obtains measurements with its sensors and uses them to construct a model of the space where it evolves. In this paper we focus on the case where several robots, each equipped with its own sensor, are distributed in a network and view the space from different vantage points. In particular, each robot is equipped with a stereo camera that allow the robots to extract visual landmarks and obtain relative measurements to them. We propose an algorithm that uses the measurements obtained by the robots to build a single accurate map of the environment. The map is represented by the three-dimensional position of the visual landmarks. In addition, we consider that each landmark is accompanied by a visual descriptor that encodes its visual appearance. The solution is based on a Rao-Blackwellized particle filter that estimates the paths of the robots and the position of the visual landmarks. The validity of our proposal is demonstrated by means of experiments with a team of real robots in a office-like indoor environment.

Stochastic learning of multi-instance dictionary for earth mover’s distance-based histogram comparison

KAUST Repository

Fan, Jihong; Liang, Ru-Ze

2016-01-01

Dictionary plays an important role in multi-instance data representation. It maps bags of instances to histograms. Earth mover’s distance (EMD) is the most effective histogram distance metric for the application of multi-instance retrieval. However

An interaction map of circulating metabolites, immune gene networks, and their genetic regulation.

Science.gov (United States)

Nath, Artika P; Ritchie, Scott C; Byars, Sean G; Fearnley, Liam G; Havulinna, Aki S; Joensuu, Anni; Kangas, Antti J; Soininen, Pasi; Wennerström, Annika; Milani, Lili; Metspalu, Andres; Männistö, Satu; Würtz, Peter; Kettunen, Johannes; Raitoharju, Emma; Kähönen, Mika; Juonala, Markus; Palotie, Aarno; Ala-Korpela, Mika; Ripatti, Samuli; Lehtimäki, Terho; Abraham, Gad; Raitakari, Olli; Salomaa, Veikko; Perola, Markus; Inouye, Michael

2017-08-01

Immunometabolism plays a central role in many cardiometabolic diseases. However, a robust map of immune-related gene networks in circulating human cells, their interactions with metabolites, and their genetic control is still lacking. Here, we integrate blood transcriptomic, metabolomic, and genomic profiles from two population-based cohorts (total N = 2168), including a subset of individuals with matched multi-omic data at 7-year follow-up. We identify topologically replicable gene networks enriched for diverse immune functions including cytotoxicity, viral response, B cell, platelet, neutrophil, and mast cell/basophil activity. These immune gene modules show complex patterns of association with 158 circulating metabolites, including lipoprotein subclasses, lipids, fatty acids, amino acids, small molecules, and CRP. Genome-wide scans for module expression quantitative trait loci (mQTLs) reveal five modules with mQTLs that have both cis and trans effects. The strongest mQTL is in ARHGEF3 (rs1354034) and affects a module enriched for platelet function, independent of platelet counts. Modules of mast cell/basophil and neutrophil function show temporally stable metabolite associations over 7-year follow-up, providing evidence that these modules and their constituent gene products may play central roles in metabolic inflammation. Furthermore, the strongest mQTL in ARHGEF3 also displays clear temporal stability, supporting widespread trans effects at this locus. This study provides a detailed map of natural variation at the blood immunometabolic interface and its genetic basis, and may facilitate subsequent studies to explain inter-individual variation in cardiometabolic disease.

Assessment of Three Flood Hazard Mapping Methods: A Case Study of Perlis

Science.gov (United States)

Azizat, Nazirah; Omar, Wan Mohd Sabki Wan

2018-03-01

Flood is a common natural disaster and also affect the all state in Malaysia. Regarding to Drainage and Irrigation Department (DID) in 2007, about 29, 270 km2 or 9 percent of region of the country is prone to flooding. Flood can be such devastating catastrophic which can effected to people, economy and environment. Flood hazard mapping can be used is an important part in flood assessment to define those high risk area prone to flooding. The purposes of this study are to prepare a flood hazard mapping in Perlis and to evaluate flood hazard using frequency ratio, statistical index and Poisson method. The six factors affecting the occurrence of flood including elevation, distance from the drainage network, rainfall, soil texture, geology and erosion were created using ArcGIS 10.1 software. Flood location map in this study has been generated based on flooded area in year 2010 from DID. These parameters and flood location map were analysed to prepare flood hazard mapping in representing the probability of flood area. The results of the analysis were verified using flood location data in year 2013, 2014, 2015. The comparison result showed statistical index method is better in prediction of flood area rather than frequency ratio and Poisson method.

Slicing, sampling, and distance-dependent effects affect network measures in simulated cortical circuit structures

Directory of Open Access Journals (Sweden)

Daniel Carl Miner

2014-11-01

Full Text Available The neuroanatomical connectivity of cortical circuits is believed to follow certain rules, the exact origins of which are still poorly understood. In particular, numerous nonrandom features, such as common neighbor clustering, overrepresentation of reciprocal connectivity, and overrepresentation of certain triadic graph motifs have been experimentally observed in cortical slice data. Some of these data, particularly regarding bidirectional connectivity are seemingly contradictory, and the reasons for this are unclear. Here we present a simple static geometric network model with distance-dependent connectivity on a realistic scale that naturally gives rise to certain elements of these observed behaviors, and may provide plausible explanations for some of the conflicting findings. Specifically, investigation of the model shows that experimentally measured nonrandom effects, especially bidirectional connectivity, may depend sensitively on experimental parameters such as slice thickness and sampling area, suggesting potential explanations for the seemingly conflicting experimental results.

IMPACT OF SCHEMATIC DESIGNS ON THE COGNITION OF UNDERGROUND TUBE MAPS

Directory of Open Access Journals (Sweden)

Z. Liu

2016-06-01

Full Text Available Schematic maps have been popularly employed to represent transport networks, particularly underground tube lines (or metro lines, since its adoption by the Official London Underground in early 1930s. Such maps employ straightened lines along horizontal, vertical and diagonal directions. Recently, some researchers started to argue that the distortion in such a schematization may cause big distortion and some new designs are proposed. This project aims to make a comparative analysis of such a schematic design with a new design proposed by Mark Noad in 2011, which makes use of lines along 30º and 60º directions instead of the 45º direction. Tasks have been designed for evaluating the effect of schematic designs on route planning by travellers. The participant was asked to choose the route s/he would take among two or three possible route options and then read the name of the selected transfer station. Eye-tracking technique has been employed to track the map recognition process. Total travel time is used as criterion for effectiveness; completion time and mental work cost are used for efficiency evaluation. It has been found that (1 the design of map style has significant impact on users’ travel decision making, especially map distance and transfer station symbol designs, and (2 the design style of a schematic map will have great impact on the effectiveness and efficiency of map recognition.

The distance from CERN to LNGS

CERN Document Server

Jones, M; Crespi, M; Colosimo, G; Mazzoni, A; Durand, S

2012-01-01

The calculation of the distance from CERN to Gran Sasso involves the combination of three independent sets of measurements: the calculation of the distance between pillars included in the geodetic reference network at CERN and the Lab Nationale Gran Sasso (LNGS); and the transfer on each site of coordinates, from the geodetic surface network, underground into the tunnel or experiment hall installations. The transfer of coordinates, from the surface, underground at the two sites was not done as part of the CNGS Project. Initial survey concerns for the project were directed towards the orientation of the beamline from CERN to LNGS to within ~100 m. Gyro-theodolite measurements underground were planned at CERN so a transfer would effectively only translate the target point. Given the precision estimated for previous transfers, it was decided not to undertake expensive and time-consuming measurements campaigns for a negligible gain in accuracy. Therefore only GPS measurements at the two sites were carried out. Th...

Improving Security for SCADA Sensor Networks with Reputation Systems and Self-Organizing Maps

Directory of Open Access Journals (Sweden)

Javier Blesa

2009-11-01

Full Text Available The reliable operation of modern infrastructures depends on computerized systems and Supervisory Control and Data Acquisition (SCADA systems, which are also based on the data obtained from sensor networks. The inherent limitations of the sensor devices make them extremely vulnerable to cyberwarfare/cyberterrorism attacks. In this paper, we propose a reputation system enhanced with distributed agents, based on unsupervised learning algorithms (self-organizing maps, in order to achieve fault tolerance and enhanced resistance to previously unknown attacks. This approach has been extensively simulated and compared with previous proposals.

Dynamic Signal Strength Mapping and Analysis by Means of Mobile Geographic Information System

Directory of Open Access Journals (Sweden)

Kulawiak Marcin

2017-12-01

Full Text Available Bluetooth beacons are becoming increasingly popular for various applications such as marketing or indoor navigation. However, designing a proper beacon installation requires knowledge of the possible sources of interference in the target environment. While theoretically beacon signal strength should decay linearly with log distance, on-site measurements usually reveal that noise from objects such as Wi-Fi networks operating in the vicinity significantly alters the expected signal range. The paper presents a novel mobile Geographic Information System for measurement, mapping and local as well as online storage of Bluetooth beacon signal strength in semireal time. For the purpose of on-site geovisual analysis of the signal, the application integrates a dedicated interpolation algorithm optimized for low-power devices. The paper discusses the performance and quality of the mapping algorithms in several different test environments.

Representing distance, consuming distance

DEFF Research Database (Denmark)

Larsen, Gunvor Riber

Title: Representing Distance, Consuming Distance Abstract: Distance is a condition for corporeal and virtual mobilities, for desired and actual travel, but yet it has received relatively little attention as a theoretical entity in its own right. Understandings of and assumptions about distance...... are being consumed in the contemporary society, in the same way as places, media, cultures and status are being consumed (Urry 1995, Featherstone 2007). An exploration of distance and its representations through contemporary consumption theory could expose what role distance plays in forming...

Controlling the chaotic discrete-Hénon system using a feedforward neural network with an adaptive learning rate

OpenAIRE

GÖKCE, Kürşad; UYAROĞLU, Yılmaz

2013-01-01

This paper proposes a feedforward neural network-based control scheme to control the chaotic trajectories of a discrete-Hénon map in order to stay within an acceptable distance from the stable fixed point. An adaptive learning back propagation algorithm with online training is employed to improve the effectiveness of the proposed method. The simulation study carried in the discrete-Hénon system verifies the validity of the proposed control system.

TheCellMap.org: A Web-Accessible Database for Visualizing and Mining the Global Yeast Genetic Interaction Network.

Science.gov (United States)

Usaj, Matej; Tan, Yizhao; Wang, Wen; VanderSluis, Benjamin; Zou, Albert; Myers, Chad L; Costanzo, Michael; Andrews, Brenda; Boone, Charles

2017-05-05

Providing access to quantitative genomic data is key to ensure large-scale data validation and promote new discoveries. TheCellMap.org serves as a central repository for storing and analyzing quantitative genetic interaction data produced by genome-scale Synthetic Genetic Array (SGA) experiments with the budding yeast Saccharomyces cerevisiae In particular, TheCellMap.org allows users to easily access, visualize, explore, and functionally annotate genetic interactions, or to extract and reorganize subnetworks, using data-driven network layouts in an intuitive and interactive manner. Copyright © 2017 Usaj et al.

Single-frequency receivers as master permanent stations in GNSS networks: precision and accuracy of the positioning in mixed networks

Science.gov (United States)

Dabove, Paolo; Manzino, Ambrogio Maria

2015-04-01

The use of GPS/GNSS instruments is a common practice in the world at both a commercial and academic research level. Since last ten years, Continuous Operating Reference Stations (CORSs) networks were born in order to achieve the possibility to extend a precise positioning more than 15 km far from the master station. In this context, the Geomatics Research Group of DIATI at the Politecnico di Torino has carried out several experiments in order to evaluate the achievable precision obtainable with different GNSS receivers (geodetic and mass-market) and antennas if a CORSs network is considered. This work starts from the research above described, in particular focusing the attention on the usefulness of single frequency permanent stations in order to thicken the existing CORSs, especially for monitoring purposes. Two different types of CORSs network are available today in Italy: the first one is the so called "regional network" and the second one is the "national network", where the mean inter-station distances are about 25/30 and 50/70 km respectively. These distances are useful for many applications (e.g. mobile mapping) if geodetic instruments are considered but become less useful if mass-market instruments are used or if the inter-station distance between master and rover increases. In this context, some innovative GNSS networks were developed and tested, analyzing the performance of rover's positioning in terms of quality, accuracy and reliability both in real-time and post-processing approach. The use of single frequency GNSS receivers leads to have some limits, especially due to a limited baseline length, the possibility to obtain a correct fixing of the phase ambiguity for the network and to fix the phase ambiguity correctly also for the rover. These factors play a crucial role in order to reach a positioning with a good level of accuracy (as centimetric o better) in a short time and with an high reliability. The goal of this work is to investigate about the

Synchronizability of coupled PWL maps

International Nuclear Information System (INIS)

Polynikis, A.; Di Bernardo, M.; Hogan, S.J.

2009-01-01

In this paper we discuss the phenomenon of synchronization of chaotic systems in the case of coupled piecewise linear (PWL) continuous and discontinuous one-dimensional maps. We present numerical results for two examples of coupled systems consisting of two PWL maps. We illustrate how the coupled system can achieve synchronization and discuss the nature of the bifurcation that occurs at a critical value of the coupling strength. We then determine this critical coupling using linear stability analysis. We discuss the effects of variation of the parameters of the PWL maps on the critical coupling and present different bifurcation scenarios obtained for different sets of values of these parameters. Finally, we discuss an extension of our work to the synchronizability of networks consisting of two or more PWL maps. We show how the synchronizability of a network of PWL maps can be improved by tuning the map parameters.

A consensus linkage map of lentil based on DArT markers from three RIL mapping populations.

Directory of Open Access Journals (Sweden)

Duygu Ates

Full Text Available Lentil (Lens culinaris ssp. culinaris Medikus is a diploid (2n = 2x = 14, self-pollinating grain legume with a haploid genome size of about 4 Gbp and is grown throughout the world with current annual production of 4.9 million tonnes.A consensus map of lentil (Lens culinaris ssp. culinaris Medikus was constructed using three different lentils recombinant inbred line (RIL populations, including "CDC Redberry" x "ILL7502" (LR8, "ILL8006" x "CDC Milestone" (LR11 and "PI320937" x "Eston" (LR39.The lentil consensus map was composed of 9,793 DArT markers, covered a total of 977.47 cM with an average distance of 0.10 cM between adjacent markers and constructed 7 linkage groups representing 7 chromosomes of the lentil genome. The consensus map had no gap larger than 12.67 cM and only 5 gaps were found to be between 12.67 cM and 6.0 cM (on LG3 and LG4. The localization of the SNP markers on the lentil consensus map were in general consistent with their localization on the three individual genetic linkage maps and the lentil consensus map has longer map length, higher marker density and shorter average distance between the adjacent markers compared to the component linkage maps.This high-density consensus map could provide insight into the lentil genome. The consensus map could also help to construct a physical map using a Bacterial Artificial Chromosome library and map based cloning studies. Sequence information of DArT may help localization of orientation scaffolds from Next Generation Sequencing data.

A consensus linkage map of lentil based on DArT markers from three RIL mapping populations.

Science.gov (United States)

Ates, Duygu; Aldemir, Secil; Alsaleh, Ahmad; Erdogmus, Semih; Nemli, Seda; Kahriman, Abdullah; Ozkan, Hakan; Vandenberg, Albert; Tanyolac, Bahattin

2018-01-01

Lentil (Lens culinaris ssp. culinaris Medikus) is a diploid (2n = 2x = 14), self-pollinating grain legume with a haploid genome size of about 4 Gbp and is grown throughout the world with current annual production of 4.9 million tonnes. A consensus map of lentil (Lens culinaris ssp. culinaris Medikus) was constructed using three different lentils recombinant inbred line (RIL) populations, including "CDC Redberry" x "ILL7502" (LR8), "ILL8006" x "CDC Milestone" (LR11) and "PI320937" x "Eston" (LR39). The lentil consensus map was composed of 9,793 DArT markers, covered a total of 977.47 cM with an average distance of 0.10 cM between adjacent markers and constructed 7 linkage groups representing 7 chromosomes of the lentil genome. The consensus map had no gap larger than 12.67 cM and only 5 gaps were found to be between 12.67 cM and 6.0 cM (on LG3 and LG4). The localization of the SNP markers on the lentil consensus map were in general consistent with their localization on the three individual genetic linkage maps and the lentil consensus map has longer map length, higher marker density and shorter average distance between the adjacent markers compared to the component linkage maps. This high-density consensus map could provide insight into the lentil genome. The consensus map could also help to construct a physical map using a Bacterial Artificial Chromosome library and map based cloning studies. Sequence information of DArT may help localization of orientation scaffolds from Next Generation Sequencing data.

Construction of a genetic linkage map in Lilium using a RIL mapping population based on SRAP marker

Directory of Open Access Journals (Sweden)

Chen Li-Jing

2015-01-01

Full Text Available A genetic linkage map of lily was constructed using RILs (recombinant inbred lines population of 180 individuals. This mapping population was developed by crossing Raizan No.1 (Formolongo and Gelria (Longiflomm cultivars through single-seed descent (SSD. SRAPs were generated by using restriction enzymes EcoRI in combination with either MseI. The resulting products were separated by electrophoresis on 6% denaturing polyacrylamide gel and visualized by silver staining. The segregation of each marker and linkage analysis was done using the program Mapmaker3.0. With 50 primer pairs, a total of 189 parental polymorphic bands were detected and 78 were used for mapping. The total map length was 2,135.5 cM consisted of 16 linkage groups. The number of markers in the linkage groups varied from 1 to 12. The length of linkage groups was range from 11.2 cM to 425.9 cM and mean marker interval distance range from 9.4 cM to 345.4 cM individually. The mean marker interval distance between markers was 27.4 cM. The map developed in the present study was the first sequence-related amplified polymorphism markers map of lily constructed with recombinant inbred lines, it could be used for genetic mapping and molecular marker assisted breeding and quantitative trait locus mapping of Lilium.

The Performance of the Smart Cities in China—A Comparative Study by Means of Self-Organizing Maps and Social Networks Analysis

Directory of Open Access Journals (Sweden)

Dong Lu

2015-06-01

Full Text Available Smart cities link the city services, citizens, resource and infrastructures together and form the heart of the modern society. As a “smart” ecosystem, smart cities focus on sustainable growth, efficiency, productivity and environmentally friendly development. By comparing with the European Union, North America and other countries, smart cities in China are still in the preliminary stage. This study offers a comparative analysis of ten smart cities in China on the basis of an extensive database covering two time periods: 2005–2007 and 2008–2010. The unsupervised computational neural network self-organizing map (SOM analysis is adopted to map out the various cities based on their performance. The demonstration effect and mutual influences between these ten smart cities are also discussed by using social network analysis. Based on the smart city performance and cluster network, current problems for smart city development in China were pointed out. Future research directions for smart city research are discussed at the end this paper.

Digital map and situation surface: a team-oriented multidisplay workspace for network enabled situation analysis

Science.gov (United States)

Peinsipp-Byma, E.; Geisler, Jürgen; Bader, Thomas

2009-05-01

System concepts for network enabled image-based ISR (intelligence, surveillance, reconnaissance) is the major mission of Fraunhofer IITB's applied research in the area of defence and security solutions. For the TechDemo08 as part of the NATO CNAD POW Defence against terrorism Fraunhofer IITB advanced a new multi display concept to handle the shear amount and high complexity of ISR data acquired by networked, distributed surveillance systems with the objective to support the generation of a common situation picture. Amount and Complexity of ISR data demands an innovative man-machine interface concept for humans to deal with it. The IITB's concept is the Digital Map & Situation Surface. This concept offers to the user a coherent multi display environment combining a horizontal surface for the situation overview from the bird's eye view, an attached vertical display for collateral information and so-called foveatablets as personalized magic lenses in order to obtain high resolved and role-specific information about a focused areaof- interest and to interact with it. In the context of TechDemo08 the Digital Map & Situation Surface served as workspace for team-based situation visualization and analysis. Multiple sea- and landside surveillance components were connected to the system.

Development of the Social Network-Based Intervention “Powerful Together with Diabetes” Using Intervention Mapping

Directory of Open Access Journals (Sweden)

Charlotte Vissenberg

2017-12-01

Full Text Available This article describes the development of the social network-based intervention Powerful Together with Diabetes which aims to improve diabetes self-management (DSM among patients with type 2 diabetes living in socioeconomically deprived neighborhoods by stimulating social support for DSM and diminishing social influences hindering DSM (e.g., peer pressure and social norms. The intervention was specifically developed for patients with Dutch, Turkish, Moroccan, and Surinamese backgrounds. The intervention was developed according to Intervention Mapping. This article describes the first four steps of Intervention Mapping: (1 the needs assessment; (2 development of performance and change objectives; (3 selection of theory-based methods and strategies; and (4 the translation of these into an organized program. These four steps resulted in Powerful Together with Diabetes, a 10-month group-based intervention consisting of 24 meetings, 6 meetings for significant others, and 2 meetings for participants and their spouses. The IM method resulted in a tailored approach with a specific focus on the social networks of its participants. This article concludes that the IM method helped our planning team to tailor the intervention to the needs of our target population and facilitated our evaluation design. However, in hindsight, the intervention could have been improved by investing more in participatory planning and community involvement.

Development of the Social Network-Based Intervention “Powerful Together with Diabetes” Using Intervention Mapping

Science.gov (United States)

Vissenberg, Charlotte; Nierkens, Vera; Uitewaal, Paul J. M.; Middelkoop, Barend J. C.; Nijpels, Giel; Stronks, Karien

2017-01-01

This article describes the development of the social network-based intervention Powerful Together with Diabetes which aims to improve diabetes self-management (DSM) among patients with type 2 diabetes living in socioeconomically deprived neighborhoods by stimulating social support for DSM and diminishing social influences hindering DSM (e.g., peer pressure and social norms). The intervention was specifically developed for patients with Dutch, Turkish, Moroccan, and Surinamese backgrounds. The intervention was developed according to Intervention Mapping. This article describes the first four steps of Intervention Mapping: (1) the needs assessment; (2) development of performance and change objectives; (3) selection of theory-based methods and strategies; and (4) the translation of these into an organized program. These four steps resulted in Powerful Together with Diabetes, a 10-month group-based intervention consisting of 24 meetings, 6 meetings for significant others, and 2 meetings for participants and their spouses. The IM method resulted in a tailored approach with a specific focus on the social networks of its participants. This article concludes that the IM method helped our planning team to tailor the intervention to the needs of our target population and facilitated our evaluation design. However, in hindsight, the intervention could have been improved by investing more in participatory planning and community involvement. PMID:29326916

Duality between Time Series and Networks

Science.gov (United States)

Campanharo, Andriana S. L. O.; Sirer, M. Irmak; Malmgren, R. Dean; Ramos, Fernando M.; Amaral, Luís A. Nunes.

2011-01-01

Studying the interaction between a system's components and the temporal evolution of the system are two common ways to uncover and characterize its internal workings. Recently, several maps from a time series to a network have been proposed with the intent of using network metrics to characterize time series. Although these maps demonstrate that different time series result in networks with distinct topological properties, it remains unclear how these topological properties relate to the original time series. Here, we propose a map from a time series to a network with an approximate inverse operation, making it possible to use network statistics to characterize time series and time series statistics to characterize networks. As a proof of concept, we generate an ensemble of time series ranging from periodic to random and confirm that application of the proposed map retains much of the information encoded in the original time series (or networks) after application of the map (or its inverse). Our results suggest that network analysis can be used to distinguish different dynamic regimes in time series and, perhaps more importantly, time series analysis can provide a powerful set of tools that augment the traditional network analysis toolkit to quantify networks in new and useful ways. PMID:21858093

Dynamics of delayed-coupled chaotic logistic maps: Influence

Indian Academy of Sciences (India)

We review our recent work on the synchronization of a network of delay-coupled maps, focusing on the interplay of the network topology and the delay times that take into account the finite velocity of propagation of interactions. We assume that the elements of the network are identical ( logistic maps in the regime where ...

Damage detection on mesosurfaces using distributed sensor network and spectral diffusion maps

International Nuclear Information System (INIS)

Chinde, V; Vaidya, U; Laflamme, S; Cao, L

2016-01-01

In this work, we develop a data-driven method for the diagnosis of damage in mesoscale mechanical structures using an array of distributed sensor networks. The proposed approach relies on comparing intrinsic geometries of data sets corresponding to the undamaged and damaged states of the system. We use a spectral diffusion map approach to identify the intrinsic geometry of the data set. In particular, time series data from distributed sensors is used for the construction of diffusion maps. The low dimensional embedding of the data set corresponding to different damage levels is obtained using a singular value decomposition of the diffusion map. We construct appropriate metrics in the diffusion space to compare the different data sets corresponding to different damage cases. The developed algorithm is applied for damage diagnosis of wind turbine blades. To achieve this goal, we developed a detailed finite element-based model of CX-100 blade in ANSYS using shell elements. Typical damage, such as crack or delamination, will lead to a loss of stiffness, is modeled by altering the stiffness of the laminate layer. One of the main challenges in the development of health monitoring algorithms is the ability to use sensor data with a relatively small signal-to-noise ratio. Our developed diffusion map-based algorithm is shown to be robust to the presence of sensor noise. The proposed diffusion map-based algorithm is advantageous by enabling the comparison of data from numerous sensors of similar or different types of data through data fusion, hereby making it attractive to exploit the distributed nature of sensor arrays. This distributed nature is further exploited for the purpose of damage localization. We perform extensive numerical simulations to demonstrate that the proposed method can successfully determine the extent of damage on the wind turbine blade and also localize the damage. We also present preliminary results for the application of the developed algorithm on

Satellite Communication and Long Distance Education

Directory of Open Access Journals (Sweden)

Hafied Cangara

2016-02-01

Full Text Available Since Indonesia introduced communication satellite for telecommunication network, the satellite has brought a number of advantages for national development in various areas, such as telephone network, mass media development, business, education, politics, security and national defence as well as regional and international cooperation. In education, satellite communication could be used for long-distance learning as implemented by 13 state universities in eastern parts of Indonesia. It is also possible to develop the Open University System in teaching and learning process, particularly since the internet technology has been intensively used

Landslide Susceptibility Index Determination Using Aritificial Neural Network

Science.gov (United States)

Kawabata, D.; Bandibas, J.; Urai, M.

2004-12-01

The occurrence of landslide is the result of the interaction of complex and diverse environmental factors. The geomorphic features, rock types and geologic structure are especially important base factors of the landslide occurrence. Generating landslide susceptibility index by defining the relationship between landslide occurrence and that base factors using conventional mathematical and statistical methods is very difficult and inaccurate. This study focuses on generating landslide susceptibility index using artificial neural networks in Southern Japanese Alps. The training data are geomorphic (e.g. altitude, slope and aspect) and geologic parameters (e.g. rock type, distance from geologic boundary and geologic dip-strike angle) and landslides. Artificial neural network structure and training scheme are formulated to generate the index. Data from areas with and without landslide occurrences are used to train the network. The network is trained to output 1 when the input data are from areas with landslides and 0 when no landslide occurred. The trained network generates an output ranging from 0 to 1 reflecting the possibility of landslide occurrence based on the inputted data. Output values nearer to 1 means higher possibility of landslide occurrence. The artificial neural network model is incorporated into the GIS software to generate a landslide susceptibility map.

Sao Paulo Lightning Mapping Array (SP-LMA): Network Assessment and Analyses for Intercomparison Studies and GOES-R Proxy Activities

Science.gov (United States)

Bailey, J. C.; Blakeslee, R. J.; Carey, L. D.; Goodman, S. J.; Rudlosky, S. D.; Albrecht, R.; Morales, C. A.; Anselmo, E. M.; Neves, J. R.; Buechler, D. E.

2014-01-01

A 12 station Lightning Mapping Array (LMA) network was deployed during October 2011 in the vicinity of Sao Paulo, Brazil (SP-LMA) to contribute total lightning measurements to an international field campaign [CHUVA - Cloud processes of tHe main precipitation systems in Brazil: A contribUtion to cloud resolVing modeling and to the GPM (GlobAl Precipitation Measurement)]. The SP-LMA was operational from November 2011 through March 2012 during the Vale do Paraiba campaign. Sensor spacing was on the order of 15-30 km, with a network diameter on the order of 40-50km. The SP-LMA provides good 3-D lightning mapping out to 150 km from the network center, with 2-D coverage considerably farther. In addition to supporting CHUVA science/mission objectives, the SP-LMA is supporting the generation of unique proxy data for the Geostationary Lightning Mapper (GLM) and Advanced Baseline Imager (ABI), on NOAA's Geostationary Operational Environmental Satellite-R (GOES-R: scheduled for a 2015 launch). These proxy data will be used to develop and validate operational algorithms so that they will be ready to use on "day1" following the GOES-R launch. As the CHUVA Vale do Paraiba campaign opportunity was formulated, a broad community-based interest developed for a comprehensive Lightning Location System (LLS) intercomparison and assessment study, leading to the participation and/or deployment of eight other ground-based networks and the space-based Lightning Imaging Sensor (LIS). The SP-LMA data is being intercompared with lightning observations from other deployed lightning networks to advance our understanding of the capabilities/contributions of each of these networks toward GLM proxy and validation activities. This paper addresses the network assessment including noise reduction criteria, detection efficiency estimates, and statistical and climatological (both temporal and spatially) analyses for intercomparison studies and GOES-R proxy activities.

DMP: Detouring Using Multiple Paths against Jamming Attack for Ubiquitous Networking System

Directory of Open Access Journals (Sweden)

Mihui Kim

2010-04-01

Full Text Available To successfully realize the ubiquitous network environment including home automation or industrial control systems, it is important to be able to resist a jamming attack. This has recently been considered as an extremely threatening attack because it can collapse the entire network, despite the existence of basic security protocols such as encryption and authentication. In this paper, we present a method of jamming attack tolerant routing using multiple paths based on zones. The proposed scheme divides the network into zones, and manages the candidate forward nodes of neighbor zones. After detecting an attack, detour nodes decide zones for rerouting, and detour packets destined for victim nodes through forward nodes in the decided zones. Simulation results show that our scheme increases the PDR (Packet Delivery Ratio and decreases the delay significantly in comparison with rerouting by a general routing protocol on sensor networks, AODV (Ad hoc On Demand Distance Vector, and a conventional JAM (Jammed Area Mapping service with one reroute.

DMP: detouring using multiple paths against jamming attack for ubiquitous networking system.

Science.gov (United States)

Kim, Mihui; Chae, Kijoon

2010-01-01

To successfully realize the ubiquitous network environment including home automation or industrial control systems, it is important to be able to resist a jamming attack. This has recently been considered as an extremely threatening attack because it can collapse the entire network, despite the existence of basic security protocols such as encryption and authentication. In this paper, we present a method of jamming attack tolerant routing using multiple paths based on zones. The proposed scheme divides the network into zones, and manages the candidate forward nodes of neighbor zones. After detecting an attack, detour nodes decide zones for rerouting, and detour packets destined for victim nodes through forward nodes in the decided zones. Simulation results show that our scheme increases the PDR (Packet Delivery Ratio) and decreases the delay significantly in comparison with rerouting by a general routing protocol on sensor networks, AODV (Ad hoc On Demand Distance Vector), and a conventional JAM (Jammed Area Mapping) service with one reroute.

Drawing subway maps : a survey

NARCIS (Netherlands)

Wolff, A.

2007-01-01

This paper deals with automating the drawing of subway maps. There are two features of schematic subway maps that make them different from drawings of other networks such as flow charts or organigrams. First, most schematic subway maps use not only horizontal and vertical lines, but also diagonals.

The performance evaluation of a new neural network based traffic management scheme for a satellite communication network

Science.gov (United States)

Ansari, Nirwan; Liu, Dequan

1991-01-01

A neural-network-based traffic management scheme for a satellite communication network is described. The scheme consists of two levels of management. The front end of the scheme is a derivation of Kohonen's self-organization model to configure maps for the satellite communication network dynamically. The model consists of three stages. The first stage is the pattern recognition task, in which an exemplar map that best meets the current network requirements is selected. The second stage is the analysis of the discrepancy between the chosen exemplar map and the state of the network, and the adaptive modification of the chosen exemplar map to conform closely to the network requirement (input data pattern) by means of Kohonen's self-organization. On the basis of certain performance criteria, whether a new map is generated to replace the original chosen map is decided in the third stage. A state-dependent routing algorithm, which arranges the incoming call to some proper path, is used to make the network more efficient and to lower the call block rate. Simulation results demonstrate that the scheme, which combines self-organization and the state-dependent routing mechanism, provides better performance in terms of call block rate than schemes that only have either the self-organization mechanism or the routing mechanism.

Project Work in Networked Distance Education

DEFF Research Database (Denmark)

Knudsen, Morten; Helbo, Jan; Jensen, Lars Peter

2000-01-01

-study, whereas the project study form is based on collaboration and dialogue. Consequently, successful implementation of project work in distance education requires extensive utilisation of new information and communication technology. In this paper the experiences of project work in a new Master of Industrial...... devoted to courses and the other half to project work. A computer conference system, LuvitÒ provides facilities for the courses, as well as structured synchronous and asynchronous communication. Eight times per year two-day seminars are held at the university for intensive lectures, project work......Problem oriented project work has been the foundation for the educational system at Aalborg University since its start 25 years ago. The duration of each student project is one semester, and the students spend half of their time working on the project in groups of typically 5-6 persons...

A high-density linkage map and QTL mapping of fruit-related traits in pumpkin (Cucurbita moschata Duch.).

Science.gov (United States)

Zhong, Yu-Juan; Zhou, Yang-Yang; Li, Jun-Xing; Yu, Ting; Wu, Ting-Quan; Luo, Jian-Ning; Luo, Shao-Bo; Huang, He-Xun

2017-10-06

Pumpkin (Cucurbita moschata) is an economically worldwide crop. Few quantitative trait loci (QTLs) were reported previously due to the lack of genomic and genetic resources. In this study, a high-density linkage map of C. moschata was structured by double-digest restriction site-associated DNA sequencing, using 200 F2 individuals of CMO-1 × CMO-97. By filtering 74,899 SNPs, a total of 3,470 high quality SNP markers were assigned to the map spanning a total genetic distance of 3087.03 cM on 20 linkage groups (LGs) with an average genetic distance of 0.89 cM. Based on this map, both pericarp color and strip were fined mapped to a novel single locus on LG8 in the same region of 0.31 cM with phenotypic variance explained (PVE) of 93.6% and 90.2%, respectively. QTL analysis was also performed on carotenoids, sugars, tuberculate fruit, fruit diameter, thickness and chamber width with a total of 12 traits. 29 QTLs distributed in 9 LGs were detected with PVE from 9.6% to 28.6%. It was the first high-density linkage SNP map for C. moschata which was proved to be a valuable tool for gene or QTL mapping. This information will serve as significant basis for map-based gene cloning, draft genome assembling and molecular breeding.

Mapping neurotransmitter networks with PET: an example on serotonin and opioid systems.

Science.gov (United States)

Tuominen, Lauri; Nummenmaa, Lauri; Keltikangas-Järvinen, Liisa; Raitakari, Olli; Hietala, Jarmo

2014-05-01

All functions of the human brain are consequences of altered activity of specific neural pathways and neurotransmitter systems. Although the knowledge of "system level" connectivity in the brain is increasing rapidly, we lack "molecular level" information on brain networks and connectivity patterns. We introduce novel voxel-based positron emission tomography (PET) methods for studying internal neurotransmitter network structure and intercorrelations of different neurotransmitter systems in the human brain. We chose serotonin transporter and μ-opioid receptor for this analysis because of their functional interaction at the cellular level and similar regional distribution in the brain. Twenty-one healthy subjects underwent two consecutive PET scans using [(11)C]MADAM, a serotonin transporter tracer, and [(11)C]carfentanil, a μ-opioid receptor tracer. First, voxel-by-voxel "intracorrelations" (hub and seed analyses) were used to study the internal structure of opioid and serotonin systems. Second, voxel-level opioid-serotonin intercorrelations (between neurotransmitters) were computed. Regional μ-opioid receptor binding potentials were uniformly correlated throughout the brain. However, our analyses revealed nonuniformity in the serotonin transporter intracorrelations and identified a highly connected local network (midbrain-striatum-thalamus-amygdala). Regionally specific intercorrelations between the opioid and serotonin tracers were found in anteromedial thalamus, amygdala, anterior cingulate cortex, dorsolateral prefrontal cortex, and left parietal cortex, i.e., in areas relevant for several neuropsychiatric disorders, especially affective disorders. This methodology enables in vivo mapping of connectivity patterns within and between neurotransmitter systems. Quantification of functional neurotransmitter balances may be a useful approach in etiological studies of neuropsychiatric disorders and also in drug development as a biomarker-based rationale for targeted

Distance Learning For Mobile Internet Users

Directory of Open Access Journals (Sweden)

Beran NECAT

2007-04-01

Full Text Available This paper provides an overview on the current state of art in the field of Distance learning for mobile users. It mentions a large range of technologies, services and approaches that may be used to bring distance learning to mobile internet users. These technologies are supposed to considerably increase innovative e-learning solutions for the next generation. While this definitely appears to be true, I think what is not so clear are the implications for students, and lecturers etc. In this article I first evaluate distributed e-learning technologies. With some of the most vital topics, focusing on adaptive distributed e-learning for Mobile Internet Users (MIUs. I also provide a brief analysis of Broadband Network Services, Collaborative e-Learning Tools and Distributed Virtual Environments, Internet-Based Adaptive Learning Technologies and Personalised Distance Learning. I continue my discussion on to Internet Development Tools (IDTs for Distance Learning Solutions, Learning Technologies for MIUs, Semantic and Web-Based Services for Enriching Learning Interactivity, and Evaluations of Distributed Learning Technologies (DLTs.

Rainfall and earthquake-induced landslide susceptibility assessment using GIS and Artificial Neural Network

Directory of Open Access Journals (Sweden)

Y. Li

2012-08-01

Full Text Available A GIS-based method for the assessment of landslide susceptibility in a selected area of Qingchuan County in China is proposed by using the back-propagation Artificial Neural Network model (ANN. Landslide inventory was derived from field investigation and aerial photo interpretation. 473 landslides occurred before the Wenchuan earthquake (which were thought as rainfall-induced landslides (RIL in this study, and 885 earthquake-induced landslides (EIL were recorded into the landslide inventory map. To understand the different impacts of rainfall and earthquake on landslide occurrence, we first compared the variations between landslide spatial distribution and conditioning factors. Then, we compared the weight variation of each conditioning factor derived by adjusting ANN structure and factors combination respectively. Last, the weight of each factor derived from the best prediction model was applied to the entire study area to produce landslide susceptibility maps.

Results show that slope gradient has the highest weight for landslide susceptibility mapping for both RIL and EIL. The RIL model built with four different factors (slope gradient, elevation, slope height and distance to the stream shows the best success rate of 93%; the EIL model built with five different factors (slope gradient, elevation, slope height, distance to the stream and distance to the fault has the best success rate of 98%. Furthermore, the EIL data was used to verify the RIL model and the success rate is 92%; the RIL data was used to verify the EIL model and the success rate is 53%.

Mapping R&D within Multinational Networks: Evidence from the Electronics Industry

Science.gov (United States)

Urze, Paula; Manatos, Maria João

Based on the final results of the R&D.COM - Local R&D COMpetencies within Global Value Chains project, this paper aims at mapping the trajectories of delocalised R&D units within a multinational’s global strategy and designing the knowledge flows within the global value chain. This analysis was performed using typologies proposed in the theoretical framework, which help us to have an overview of the network. The methodology is grounded on one extended case study that involves a local R&D unit (Portugal), a foreign R&D unit (Netherlands) and the headquarters (Norway) - developed on a multinational from the electronics industry. This case is an example of a multinational company where R&D is developed mainly in the headquarters but it is also delocalised to some subsidiaries with a certain level of autonomy.

DISTANCES TO DARK CLOUDS: COMPARING EXTINCTION DISTANCES TO MASER PARALLAX DISTANCES

International Nuclear Information System (INIS)

Foster, Jonathan B.; Jackson, James M.; Stead, Joseph J.; Hoare, Melvin G.; Benjamin, Robert A.

2012-01-01

We test two different methods of using near-infrared extinction to estimate distances to dark clouds in the first quadrant of the Galaxy using large near-infrared (Two Micron All Sky Survey and UKIRT Infrared Deep Sky Survey) surveys. Very long baseline interferometry parallax measurements of masers around massive young stars provide the most direct and bias-free measurement of the distance to these dark clouds. We compare the extinction distance estimates to these maser parallax distances. We also compare these distances to kinematic distances, including recent re-calibrations of the Galactic rotation curve. The extinction distance methods agree with the maser parallax distances (within the errors) between 66% and 100% of the time (depending on method and input survey) and between 85% and 100% of the time outside of the crowded Galactic center. Although the sample size is small, extinction distance methods reproduce maser parallax distances better than kinematic distances; furthermore, extinction distance methods do not suffer from the kinematic distance ambiguity. This validation gives us confidence that these extinction methods may be extended to additional dark clouds where maser parallaxes are not available.

Time-Distance Helioseismology: Noise Estimation

Science.gov (United States)

Gizon, L.; Birch, A. C.

2004-10-01

As in global helioseismology, the dominant source of noise in time-distance helioseismology measurements is realization noise due to the stochastic nature of the excitation mechanism of solar oscillations. Characterizing noise is important for the interpretation and inversion of time-distance measurements. In this paper we introduce a robust definition of travel time that can be applied to very noisy data. We then derive a simple model for the full covariance matrix of the travel-time measurements. This model depends only on the expectation value of the filtered power spectrum and assumes that solar oscillations are stationary and homogeneous on the solar surface. The validity of the model is confirmed through comparison with SOHO MDI measurements in a quiet-Sun region. We show that the correlation length of the noise in the travel times is about half the dominant wavelength of the filtered power spectrum. We also show that the signal-to-noise ratio in quiet-Sun travel-time maps increases roughly as the square root of the observation time and is at maximum for a distance near half the length scale of supergranulation.

Complex Geography of the Internet Network

International Nuclear Information System (INIS)

Kallus, Z.; Haga, P.; Matray, P.; Vattay, G.; Laki, S.

2011-01-01

The geographic layout of the physical Internet inherently determines important network properties. In this paper, we analyze the spatial properties of the Internet topology. In particular, the distribution of the lengths of Internet links is presented - which was possible through spatial embedding of a representative set of IP addresses by applying a novel IP geolocalization service, called Spotter. The dataset is a result of a geographically dispersed topological discovery campaign. After showing the spatial likelihood of Internet nodes we present two approaches to describe the length distribution of the links. The resulting characterization reveals that the distribution can be separated into three characteristic distance ranges which can be mapped to the regional, transcontinental and intercontinental connections. These regimes follow a power-law function with different exponents. (author)

Application of approximate pattern matching in two dimensional spaces to grid layout for biochemical network maps.

Science.gov (United States)

Inoue, Kentaro; Shimozono, Shinichi; Yoshida, Hideaki; Kurata, Hiroyuki

2012-01-01

For visualizing large-scale biochemical network maps, it is important to calculate the coordinates of molecular nodes quickly and to enhance the understanding or traceability of them. The grid layout is effective in drawing compact, orderly, balanced network maps with node label spaces, but existing grid layout algorithms often require a high computational cost because they have to consider complicated positional constraints through the entire optimization process. We propose a hybrid grid layout algorithm that consists of a non-grid, fast layout (preprocessor) algorithm and an approximate pattern matching algorithm that distributes the resultant preprocessed nodes on square grid points. To demonstrate the feasibility of the hybrid layout algorithm, it is characterized in terms of the calculation time, numbers of edge-edge and node-edge crossings, relative edge lengths, and F-measures. The proposed algorithm achieves outstanding performances compared with other existing grid layouts. Use of an approximate pattern matching algorithm quickly redistributes the laid-out nodes by fast, non-grid algorithms on the square grid points, while preserving the topological relationships among the nodes. The proposed algorithm is a novel use of the pattern matching, thereby providing a breakthrough for grid layout. This application program can be freely downloaded from http://www.cadlive.jp/hybridlayout/hybridlayout.html.

Application of approximate pattern matching in two dimensional spaces to grid layout for biochemical network maps.

Directory of Open Access Journals (Sweden)

Kentaro Inoue

Full Text Available BACKGROUND: For visualizing large-scale biochemical network maps, it is important to calculate the coordinates of molecular nodes quickly and to enhance the understanding or traceability of them. The grid layout is effective in drawing compact, orderly, balanced network maps with node label spaces, but existing grid layout algorithms often require a high computational cost because they have to consider complicated positional constraints through the entire optimization process. RESULTS: We propose a hybrid grid layout algorithm that consists of a non-grid, fast layout (preprocessor algorithm and an approximate pattern matching algorithm that distributes the resultant preprocessed nodes on square grid points. To demonstrate the feasibility of the hybrid layout algorithm, it is characterized in terms of the calculation time, numbers of edge-edge and node-edge crossings, relative edge lengths, and F-measures. The proposed algorithm achieves outstanding performances compared with other existing grid layouts. CONCLUSIONS: Use of an approximate pattern matching algorithm quickly redistributes the laid-out nodes by fast, non-grid algorithms on the square grid points, while preserving the topological relationships among the nodes. The proposed algorithm is a novel use of the pattern matching, thereby providing a breakthrough for grid layout. This application program can be freely downloaded from http://www.cadlive.jp/hybridlayout/hybridlayout.html.

Utility Evaluation Based on One-To-N Mapping in the Prisoner's Dilemma Game for Interdependent Networks.

Directory of Open Access Journals (Sweden)

Juan Wang

Full Text Available In the field of evolutionary game theory, network reciprocity has become an important means to promote the level of promotion within the population system. Recently, the interdependency provides a novel perspective to understand the widespread cooperation behavior in many real-world systems. In previous works, interdependency is often built from the direct or indirect connections between two networks through the one-to-one mapping mode. However, under many realistic scenarios, players may need much more information from many neighboring agents so as to make a more rational decision. Thus, beyond the one-to-one mapping mode, we investigate the cooperation behavior on two interdependent lattices, in which the utility evaluation of a focal player on one lattice may not only concern himself, but also integrate the payoff information of several corresponding players on the other lattice. Large quantities of simulations indicate that the cooperation can be substantially promoted when compared to the traditionally spatial lattices. The cluster formation and phase transition are also analyzed in order to explore the role of interdependent utility coupling in the collective cooperation. Current results are beneficial to deeply understand various mechanisms to foster the cooperation exhibited inside natural, social and engineering systems.

Finer discrimination of brain activation with local multivariate distance

Institute of Scientific and Technical Information of China (English)

无

2007-01-01

The organization of human brain function is diverse on different spatial scales.Various cognitive states are alwavs represented as distinct activity patterns across the specific brain region on fine scales.Conventional univariate analysis of functional MRI data seeks to determine how a particular cognitive state is encoded in brain activity by analyzing each voxel separately without considering the fine-scale patterns information contained in the local brain regions.In this paper,a local multivariate distance mapping(LMDM)technique is proposed to detect the brain activation and to map the fine-scale brain activity patterns.LMDM directly represents the local brain activity with the patterns across multiple voxels rather than individual voxels,and it employs the multivariate distance between different patterns to discriminate the brain state on fine scales.Experiments with simulated and real fMRI data demonstrate that LMDM technique can dramatically increase the sensitivity of the detection for the fine-scale brain activity pettems which contain the subtle information of the experimental conditions.

Stretched exponential dynamics of coupled logistic maps on a small-world network

Science.gov (United States)

Mahajan, Ashwini V.; Gade, Prashant M.

2018-02-01

We investigate the dynamic phase transition from partially or fully arrested state to spatiotemporal chaos in coupled logistic maps on a small-world network. Persistence of local variables in a coarse grained sense acts as an excellent order parameter to study this transition. We investigate the phase diagram by varying coupling strength and small-world rewiring probability p of nonlocal connections. The persistent region is a compact region bounded by two critical lines where band-merging crisis occurs. On one critical line, the persistent sites shows a nonexponential (stretched exponential) decay for all p while for another one, it shows crossover from nonexponential to exponential behavior as p → 1 . With an effectively antiferromagnetic coupling, coupling to two neighbors on either side leads to exchange frustration. Apart from exchange frustration, non-bipartite topology and nonlocal couplings in a small-world network could be a reason for anomalous relaxation. The distribution of trap times in asymptotic regime has a long tail as well. The dependence of temporal evolution of persistence on initial conditions is studied and a scaling form for persistence after waiting time is proposed. We present a simple possible model for this behavior.

Reconstruction of in-plane strain maps using hybrid dense sensor network composed of sensing skin

International Nuclear Information System (INIS)

Downey, Austin; Laflamme, Simon; Ubertini, Filippo

2016-01-01

The authors have recently developed a soft-elastomeric capacitive (SEC)-based thin film sensor for monitoring strain on mesosurfaces. Arranged in a network configuration, the sensing system is analogous to a biological skin, where local strain can be monitored over a global area. Under plane stress conditions, the sensor output contains the additive measurement of the two principal strain components over the monitored surface. In applications where the evaluation of strain maps is useful, in structural health monitoring for instance, such signal must be decomposed into linear strain components along orthogonal directions. Previous work has led to an algorithm that enabled such decomposition by leveraging a dense sensor network configuration with the addition of assumed boundary conditions. Here, we significantly improve the algorithm’s accuracy by leveraging mature off-the-shelf solutions to create a hybrid dense sensor network (HDSN) to improve on the boundary condition assumptions. The system’s boundary conditions are enforced using unidirectional RSGs and assumed virtual sensors. Results from an extensive experimental investigation demonstrate the good performance of the proposed algorithm and its robustness with respect to sensors’ layout. Overall, the proposed algorithm is seen to effectively leverage the advantages of a hybrid dense network for application of the thin film sensor to reconstruct surface strain fields over large surfaces. (paper)

Auxiliary variables for the mapping of the drainage network: spatial correlation between relieve units, lithotypes and springs in Benevente River basin-ES

Directory of Open Access Journals (Sweden)

Tony Vinicius Moreira Sampaio

2014-12-01

Full Text Available Process of the drainage network mapping present methodological limitations re- sulting in inaccurate maps, restricting their use in environmental studies. Such problems demand the realization of long field surveys to verify the error and the search for auxiliary variables to optimize this works and turn possible the analysis of map accuracy. This research aims at the measurement of the correlation be- tween springs, lithotypes and relieve units, characterized by Roughness Concentration Index (RCI in River Basin Benevente-ES, focusing on the operations of map algebra and the use of spatial statistical techniques. These procedures have identified classes of RCI and lithotypes that present the highest and the lowest correlation with the spatial distribution of springs, indicating its potential use as auxiliary variables to verify the map accuracy.

A Network Approach of Gene Co-expression in the Zea mays/Aspergillus flavus Pathosystem to Map Host/Pathogen Interaction Pathways

OpenAIRE

Musungu, Bryan M.; Bhatnagar, Deepak; Brown, Robert L.; Payne, Gary A.; OBrian, Greg; Fakhoury, Ahmad M.; Geisler, Matt

2016-01-01

A gene co-expression network (GEN) was generated using a dual RNA-seq study with the fungal pathogen Aspergillus flavus and its plant host Zea mays during the initial 3 days of infection. The analysis deciphered novel pathways and mapped genes of interest in both organisms during the infection. This network revealed a high degree of connectivity in many of the previously recognized pathways in Z. mays such as jasmonic acid, ethylene, and reactive oxygen species (ROS). For the pathogen A. flav...

Localization and Classification of Paddy Field Pests using a Saliency Map and Deep Convolutional Neural Network

Science.gov (United States)

Liu, Ziyi; Gao, Junfeng; Yang, Guoguo; Zhang, Huan; He, Yong

2016-01-01

We present a pipeline for the visual localization and classification of agricultural pest insects by computing a saliency map and applying deep convolutional neural network (DCNN) learning. First, we used a global contrast region-based approach to compute a saliency map for localizing pest insect objects. Bounding squares containing targets were then extracted, resized to a fixed size, and used to construct a large standard database called Pest ID. This database was then utilized for self-learning of local image features which were, in turn, used for classification by DCNN. DCNN learning optimized the critical parameters, including size, number and convolutional stride of local receptive fields, dropout ratio and the final loss function. To demonstrate the practical utility of using DCNN, we explored different architectures by shrinking depth and width, and found effective sizes that can act as alternatives for practical applications. On the test set of paddy field images, our architectures achieved a mean Accuracy Precision (mAP) of 0.951, a significant improvement over previous methods. PMID:26864172

Risk and Resilience Analysis of Complex Network Systems Considering Cascading Failure and Recovery Strategy Based on Coupled Map Lattices

Directory of Open Access Journals (Sweden)

Fuchun Ren

2015-01-01

Full Text Available Risk and resilience are important and challenging issues in complex network systems since a single failure may trigger a whole collapse of the systems due to cascading effect. New theories, models, and methods are urgently demanded to deal with this challenge. In this paper, a coupled map lattices (CML based approach is adopted to analyze the risk of cascading process in Watts-Strogatz (WS small-world network and Barabási and Albert (BA scale-free network, respectively. Then, to achieve an effective and robust system and provide guidance in countering the cascading failure, a modified CML model with recovery strategy factor is proposed. Numerical simulations are put forward based on small-world CML and scale-free CML. The simulation results reveal that appropriate recovery strategies would significantly improve the resilience of networks.

Association of medial meniscal extrusion with medial tibial osteophyte distance detected by T2 mapping MRI in patients with early-stage knee osteoarthritis.

Science.gov (United States)

Hada, Shinnosuke; Ishijima, Muneaki; Kaneko, Haruka; Kinoshita, Mayuko; Liu, Lizu; Sadatsuki, Ryo; Futami, Ippei; Yusup, Anwajan; Takamura, Tomohiro; Arita, Hitoshi; Shiozawa, Jun; Aoki, Takako; Takazawa, Yuji; Ikeda, Hiroshi; Aoki, Shigeki; Kurosawa, Hisashi; Okada, Yasunori; Kaneko, Kazuo

2017-09-12

Medial meniscal extrusion (MME) is associated with progression of medial knee osteoarthritis (OA), but no or little information is available for relationships between MME and osteophytes, which are found in cartilage and bone parts. Because of the limitation in detectability of the cartilage part of osteophytes by radiography or conventional magnetic resonance imaging (MRI), the rate of development and size of osteophytes appear to have been underestimated. Because T2 mapping MRI may enable us to evaluate the cartilage part of osteophytes, we aimed to examine the association between MME and OA-related changes, including osteophytes, by using conventional and T2 mapping MRI. Patients with early-stage knee OA (n = 50) were examined. MRI-detected OA-related changes, in addition to MME, were evaluated according to the Whole-Organ Magnetic Resonance Imaging Score. T2 values of the medial meniscus and osteophytes were measured on T2 mapping images. Osteophytes surgically removed from patients with end-stage knee OA were histologically analyzed and compared with findings derived by radiography and MRI. Medial side osteophytes were detected by T2 mapping MRI in 98% of patients with early-stage knee OA, although the detection rate was 48% by conventional MRI and 40% by radiography. Among the OA-related changes, medial tibial osteophyte distance was most closely associated with MME, as determined by multiple logistic regression analysis, in the patients with early-stage knee OA (β = 0.711, p T2 values of the medial meniscus were directly correlated with MME in patients with early-stage knee OA, who showed ≥ 3 mm of MME (r = 0.58, p = 0.003). The accuracy of osteophyte evaluation by T2 mapping MRI was confirmed by histological analysis of the osteophytes removed from patients with end-stage knee OA. Our study demonstrates that medial tibial osteophyte evaluated by T2 mapping MRI is frequently observed in the patients with early-stage knee OA, showing

Resource tracking within and across continents in long-distance bird migrants

KAUST Repository

Thorup, Kasper; Tø ttrup, Anders P.; Willemoes, Mikkel; Klaassen, Raymond H. G.; Strandberg, Roine; Vega, Marta Lomas; Dasari, Hari Prasad; Araú jo, Miguel B.; Wikelski, Martin; Rahbek, Carsten

2017-01-01

spatial and temporal mapping of long-distance movement of birds. We show that three Palearctic-African species track vegetation greenness throughout their annual cycle, adjusting the timing and direction of migratory movements with seasonal changes

Trends in Distance Education Research: A Content Analysis of Journals 2009-2013

Directory of Open Access Journals (Sweden)

Aras Bozkurt

2015-02-01

Full Text Available This study intends to explore the current trends in the field of distance education research during the period of 2009-2013. The trends were identified by an extensive review of seven peer reviewed scholarly journals: The American Journal of Distance Education (AJDE, Distance Education (DE, The European Journal of Open, Distance and e-Learning (EURODL, The Journal of Distance Education (JDE, The Journal of Online Learning and Technology (JOLT, Open Learning: The Journal of Open, Distance and e-Learning (OL and The International Review of Research in Open and Distributed Learning (IRRODL. A total of 861 research articles was reviewed. Mainly content analysis was employed to be able to analyze the current research. Also, a social network analysis (SNA was used to interpret the interrelationship between keywords indicated in these articles. Themes were developed and the content of the articles in the selected journals were coded according to categories derived from earlier studies. The results were interpreted using descriptive analysis (frequencies and social network analysis. The reporting of the results were organized into the following categories: research areas, theoretical and conceptual frameworks, variables, methods, models, strategies, data collection and analysis methods, and the participants. The study also identified the most commonly used keywords, and the most frequently cited authors and studies in distance education. The findings obtained in this study may be useful in the exploration of potential research areas and identification of neglected areas in the field of distance education.

Artificial neural network with self-organizing mapping for reactor stability monitoring

International Nuclear Information System (INIS)

Okumura, Motofumi; Tsuji, Masashi; Shimazu, Yoichiro; Narabayashi, Tadashi

2008-01-01

In BWR stability monitoring damping ratio has been used as a stability index. A method for estimating the damping ratio by applying Principal Component Analysis (PCA) to neutron detector signals measured with local power range monitors (LPRMs) had been developed; In this method, measured fluctuating signal is decomposed into some independent components and the signal component directly related to stability is extracted among them to determine the damping ratio. For online monitoring, it is necessary to select stability related signal component efficiently. The self-organizing map (SOM) is one of the artificial neural networks and has the characteristics such that online learning is possible without supervised learning within a relatively short time. In the present study, the SOM was applied to extract the relevant signal component more quickly and more accurately, and the availability was confirmed through the feasibility study. (author)

EVALUATION AND MAPPING OF RANGELANDS DEGRADATION USING REMOTELY SENSED DATA

Directory of Open Access Journals (Sweden)

Majid Ajorlo

2005-05-01

Full Text Available The empirical and scientifically documents prove that misuse of natural resource causes degradation in it. So natural resources conservation is important in approaching sustainable development aims. In current study, Landsat Thematic Mapper images and grazing gradient method have been used to map the extent and degree of rangeland degradation. In during ground-based data measuring, factors such as vegetation cover, litter, plant diversity, bare soil, and stone & gravels were estimated as biophysical indicators of degradation. The next stage, after geometric correction and doing some necessary pre-processing practices on the study area’s images; the best and suitable vegetation index has been selected to map rangeland degradation among the Normalized Difference Vegetation Index (NDVI, Soil Adjusted Vegetation Index (SAVI, and Perpendicular Vegetation Index (PVI. Then using suitable vegetation index and distance parameter was produced the rangelands degradation map. The results of ground-based data analysis reveal that there is a significant relation between increasing distance from critical points and plant diversity and also percentage of litter. Also there is significant relation between vegetation cover percent and distance from village, i.e. the vegetation cover percent increases by increasing distance from villages, while it wasn’t the same around the stock watering points. The result of analysis about bare soil and distance from critical point was the same to vegetation cover changes manner. Also there wasn’t significant relation between stones & gravels index and distance from critical points. The results of image processing show that, NDVI appears to be sensitive to vegetation changes along the grazing gradient and it can be suitable vegetation index to map rangeland degradation. The degradation map shows that there is high degradation around the critical points. These areas need urgent attention for soil conservation. Generally, it

Distance reporting in digital pathology: A study on 950 cases

Directory of Open Access Journals (Sweden)

Aleksandar Vodovnik

2015-01-01

Full Text Available Background: Increased workload, case complexity, financial constraints, and staffing shortages justify wider implementations of digital pathology. One of its main advantages is distance reporting. Aim: A feasibility study was conducted at our institution in order to achieve comprehensive pathology services available by distance. Methods: One senior pathologist reported 950 cases (3,650 slides by distance during 19 weeks. Slides were scanned by ScanScope AT Turbo (Aperio and digital images accessed through SymPathy (Tieto on a 14" laptop. Mobile phone, mobile broadband, broadband over Wi-Fi and broadband were used for internet connections along with a virtual private network technology (VPN. Lync (Microsoft was tested for one case consultation and resident′s teaching session. Larger displays were accessed when available. Effects of ergonomics and working flexibility on the user experience were observed. Details on network speed, frequency of technical issues, data usage, scanning, and turnaround, were collected and evaluated. Turnaround was compared to in-office microscopic reporting, measured from the registration to sign off. Results: Network speeds varied 1-80 Mbps (median download speed 8-65 Mbps. 20 Mbps were satisfactory for the instant upload of digital images. VPN, image viewer, and laptop failed on two occasions each. An estimated data usage per digital image was 10 MB (1-50 MB. Two cases (15 slides were deferred to microscopic slides (0.21/0.41% due to scanty material and suboptimal slide quality. Additional nine cases (15 slides needed to be rescanned for various reasons (0.95/0.41%. Average turnaround was shorter, and the percentage of cases reported up to 3 days higher (3.13 days/72.25% comparing with in-office microscopic reporting (3.90 days/40.56%. Larger displays improved the most user experience at magnifications over Χ20. Conclusions: Existing IT solutions at our institution allow efficient and reliable distance reporting

Efficient Underwater RSS Value to Distance Inversion Using the Lambert Function

Directory of Open Access Journals (Sweden)

Majid Hosseini

2014-01-01

Full Text Available There are many applications for using wireless sensor networks (WSN in ocean science; however, identifying the exact location of a sensor by itself (localization is still a challenging problem, where global positioning system (GPS devices are not applicable underwater. Precise distance measurement between two sensors is a tool of localization and received signal strength (RSS, reflecting transmission loss (TL phenomena, is widely used in terrestrial WSNs for that matter. Underwater acoustic sensor networks have not been used (UASN, due to the complexity of the TL function. In this paper, we addressed these problems by expressing underwater TL via the Lambert W function, for accurate distance inversion by the Halley method, and compared this to Newton-Raphson inversion. Mathematical proof, MATLAB simulation, and real device implementation demonstrate the accuracy and efficiency of the proposed equation in distance calculation, with fewer iterations, computation stability for short and long distances, and remarkably short processing time. Then, the sensitivities of Lambert W function and Newton-Raphson inversion to alteration in TL were examined. The simulation results showed that Lambert W function is more stable to errors than Newton-Raphson inversion. Finally, with a likelihood method, it was shown that RSS is a practical tool for distance measurement in UASN.