DOE Office of Scientific and Technical Information (OSTI.GOV)

Ferrada, J.J.; Osborne-Lee, I.W.; Grizzaffi, P.A.

Expert systems are known to be useful in capturing expertise and applying knowledge to chemical engineering problems such as diagnosis, process control, process simulation, and process advisory. However, expert system applications are traditionally limited to knowledge domains that are heuristic and involve only simple mathematics. Neural networks, on the other hand, represent an emerging technology capable of rapid recognition of patterned behavior without regard to mathematical complexity. Although useful in problem identification, neural networks are not very efficient in providing in-depth solutions and typically do not promote full understanding of the problem or the reasoning behind its solutions. Hence, applicationsmore » of neural networks have certain limitations. This paper explores the potential for expanding the scope of chemical engineering areas where neural networks might be utilized by incorporating expert systems and neural networks into the same application, a process called hybridization. In addition, hybrid applications are compared with those using more traditional approaches, the results of the different applications are analyzed, and the feasibility of converting the preliminary prototypes described herein into useful final products is evaluated. 12 refs., 8 figs.« less

A Novel Cloud-Based Service Robotics Application to Data Center Environmental Monitoring

PubMed Central

Russo, Ludovico Orlando; Rosa, Stefano; Maggiora, Marcello; Bona, Basilio

2016-01-01

This work presents a robotic application aimed at performing environmental monitoring in data centers. Due to the high energy density managed in data centers, environmental monitoring is crucial for controlling air temperature and humidity throughout the whole environment, in order to improve power efficiency, avoid hardware failures and maximize the life cycle of IT devices. State of the art solutions for data center monitoring are nowadays based on environmental sensor networks, which continuously collect temperature and humidity data. These solutions are still expensive and do not scale well in large environments. This paper presents an alternative to environmental sensor networks that relies on autonomous mobile robots equipped with environmental sensors. The robots are controlled by a centralized cloud robotics platform that enables autonomous navigation and provides a remote client user interface for system management. From the user point of view, our solution simulates an environmental sensor network. The system can easily be reconfigured in order to adapt to management requirements and changes in the layout of the data center. For this reason, it is called the virtual sensor network. This paper discusses the implementation choices with regards to the particular requirements of the application and presents and discusses data collected during a long-term experiment in a real scenario. PMID:27509505

Metamodeling and the Critic-based approach to multi-level optimization.

PubMed

Werbos, Ludmilla; Kozma, Robert; Silva-Lugo, Rodrigo; Pazienza, Giovanni E; Werbos, Paul J

2012-08-01

Large-scale networks with hundreds of thousands of variables and constraints are becoming more and more common in logistics, communications, and distribution domains. Traditionally, the utility functions defined on such networks are optimized using some variation of Linear Programming, such as Mixed Integer Programming (MIP). Despite enormous progress both in hardware (multiprocessor systems and specialized processors) and software (Gurobi) we are reaching the limits of what these tools can handle in real time. Modern logistic problems, for example, call for expanding the problem both vertically (from one day up to several days) and horizontally (combining separate solution stages into an integrated model). The complexity of such integrated models calls for alternative methods of solution, such as Approximate Dynamic Programming (ADP), which provide a further increase in the performance necessary for the daily operation. In this paper, we present the theoretical basis and related experiments for solving the multistage decision problems based on the results obtained for shorter periods, as building blocks for the models and the solution, via Critic-Model-Action cycles, where various types of neural networks are combined with traditional MIP models in a unified optimization system. In this system architecture, fast and simple feed-forward networks are trained to reasonably initialize more complicated recurrent networks, which serve as approximators of the value function (Critic). The combination of interrelated neural networks and optimization modules allows for multiple queries for the same system, providing flexibility and optimizing performance for large-scale real-life problems. A MATLAB implementation of our solution procedure for a realistic set of data and constraints shows promising results, compared to the iterative MIP approach. Copyright © 2012 Elsevier Ltd. All rights reserved.

Content-specific network analysis of peer-to-peer communication in an online community for smoking cessation.

PubMed

Myneni, Sahiti; Cobb, Nathan K; Cohen, Trevor

2016-01-01

Analysis of user interactions in online communities could improve our understanding of health-related behaviors and inform the design of technological solutions that support behavior change. However, to achieve this we would need methods that provide granular perspective, yet are scalable. In this paper, we present a methodology for high-throughput semantic and network analysis of large social media datasets, combining semi-automated text categorization with social network analytics. We apply this method to derive content-specific network visualizations of 16,492 user interactions in an online community for smoking cessation. Performance of the categorization system was reasonable (average F-measure of 0.74, with system-rater reliability approaching rater-rater reliability). The resulting semantically specific network analysis of user interactions reveals content- and behavior-specific network topologies. Implications for socio-behavioral health and wellness platforms are also discussed.

Learning control of inverted pendulum system by neural network driven fuzzy reasoning: The learning function of NN-driven fuzzy reasoning under changes of reasoning environment

NASA Technical Reports Server (NTRS)

Hayashi, Isao; Nomura, Hiroyoshi; Wakami, Noboru

1991-01-01

Whereas conventional fuzzy reasonings are associated with tuning problems, which are lack of membership functions and inference rule designs, a neural network driven fuzzy reasoning (NDF) capable of determining membership functions by neural network is formulated. In the antecedent parts of the neural network driven fuzzy reasoning, the optimum membership function is determined by a neural network, while in the consequent parts, an amount of control for each rule is determined by other plural neural networks. By introducing an algorithm of neural network driven fuzzy reasoning, inference rules for making a pendulum stand up from its lowest suspended point are determined for verifying the usefulness of the algorithm.

Optimal Signal Processing in Small Stochastic Biochemical Networks

PubMed Central

Ziv, Etay; Nemenman, Ilya; Wiggins, Chris H.

2007-01-01

We quantify the influence of the topology of a transcriptional regulatory network on its ability to process environmental signals. By posing the problem in terms of information theory, we do this without specifying the function performed by the network. Specifically, we study the maximum mutual information between the input (chemical) signal and the output (genetic) response attainable by the network in the context of an analytic model of particle number fluctuations. We perform this analysis for all biochemical circuits, including various feedback loops, that can be built out of 3 chemical species, each under the control of one regulator. We find that a generic network, constrained to low molecule numbers and reasonable response times, can transduce more information than a simple binary switch and, in fact, manages to achieve close to the optimal information transmission fidelity. These high-information solutions are robust to tenfold changes in most of the networks' biochemical parameters; moreover they are easier to achieve in networks containing cycles with an odd number of negative regulators (overall negative feedback) due to their decreased molecular noise (a result which we derive analytically). Finally, we demonstrate that a single circuit can support multiple high-information solutions. These findings suggest a potential resolution of the “cross-talk” phenomenon as well as the previously unexplained observation that transcription factors that undergo proteolysis are more likely to be auto-repressive. PMID:17957259

Structure of Aqueous Trehalose Solution by Neutron Diffraction and Structural Modeling.

PubMed

Olsson, Christoffer; Jansson, Helén; Youngs, Tristan; Swenson, Jan

2016-12-15

The molecular structure of an aqueous solution of the disaccharide trehalose (C 12 H 22 O 11 ) has been studied by neutron diffraction and empirical potential structure refinement modeling. Six different isotope compositions with 33 wt % trehalose (corresponding to 38 water molecules per trehalose molecule) were measured to ensure that water-water, trehalose-water, and trehalose-trehalose correlations were accurately determined. In fact, this is the first neutron diffraction study of an aqueous trehalose solution in which also the nonexchangeable hydrogen atoms in trehalose are deuterated. With this approach, it was possible to determine that (1) there is a substantial hydrogen bonding between trehalose and water (∼11 hydrogen bonds per trehalose molecule), which is in contrast to previous neutron diffraction studies, and (2) there is no tendency of clustering of trehalose, in contrast to what is generally observed by molecular dynamics simulations and experimentally found for other disaccharides. Thus, the results give the structural picture that trehalose prefers to interact with water and participate in a hydrogen-bonded network. This strong network character of the solution might be one of the key reasons for its extraordinary stabilization effect on biological materials.

Trust-Based Security Level Evaluation Using Bayesian Belief Networks

NASA Astrophysics Data System (ADS)

Houmb, Siv Hilde; Ray, Indrakshi; Ray, Indrajit; Chakraborty, Sudip

Security is not merely about technical solutions and patching vulnerabilities. Security is about trade-offs and adhering to realistic security needs, employed to support core business processes. Also, modern systems are subject to a highly competitive market, often demanding rapid development cycles, short life-time, short time-to-market, and small budgets. Security evaluation standards, such as ISO 14508 Common Criteria and ISO/IEC 27002, are not adequate for evaluating the security of many modern systems for resource limitations, time-to-market, and other constraints. Towards this end, we propose an alternative time and cost effective approach for evaluating the security level of a security solution, system or part thereof. Our approach relies on collecting information from different sources, who are trusted to varying degrees, and on using a trust measure to aggregate available information when deriving security level. Our approach is quantitative and implemented as a Bayesian Belief Network (BBN) topology, allowing us to reason over uncertain information and seemingly aggregating disparate information. We illustrate our approach by deriving the security level of two alternative Denial of Service (DoS) solutions. Our approach can also be used in the context of security solution trade-off analysis.

Parallel Computation of Unsteady Flows on a Network of Workstations

NASA Technical Reports Server (NTRS)

1997-01-01

Parallel computation of unsteady flows requires significant computational resources. The utilization of a network of workstations seems an efficient solution to the problem where large problems can be treated at a reasonable cost. This approach requires the solution of several problems: 1) the partitioning and distribution of the problem over a network of workstation, 2) efficient communication tools, 3) managing the system efficiently for a given problem. Of course, there is the question of the efficiency of any given numerical algorithm to such a computing system. NPARC code was chosen as a sample for the application. For the explicit version of the NPARC code both two- and three-dimensional problems were studied. Again both steady and unsteady problems were investigated. The issues studied as a part of the research program were: 1) how to distribute the data between the workstations, 2) how to compute and how to communicate at each node efficiently, 3) how to balance the load distribution. In the following, a summary of these activities is presented. Details of the work have been presented and published as referenced.

Cross-Layer Algorithms for QoS Enhancement in Wireless Multimedia Sensor Networks

NASA Astrophysics Data System (ADS)

Saxena, Navrati; Roy, Abhishek; Shin, Jitae

A lot of emerging applications like advanced telemedicine and surveillance systems, demand sensors to deliver multimedia content with precise level of QoS enhancement. Minimizing energy in sensor networks has been a much explored research area but guaranteeing QoS over sensor networks still remains an open issue. In this letter we propose a cross-layer approach combining Network and MAC layers, for QoS enhancement in wireless multimedia sensor networks. In the network layer a statistical estimate of sensory QoS parameters is performed and a nearoptimal genetic algorithmic solution is proposed to solve the NP-complete QoS-routing problem. On the other hand the objective of the proposed MAC algorithm is to perform the QoS-based packet classification and automatic adaptation of the contention window. Simulation results demonstrate that the proposed protocol is capable of providing lower delay and better throughput, at the cost of reasonable energy consumption, in comparison with other existing sensory QoS protocols.

Computing smallest intervention strategies for multiple metabolic networks in a boolean model.

PubMed

Lu, Wei; Tamura, Takeyuki; Song, Jiangning; Akutsu, Tatsuya

2015-02-01

This article considers the problem whereby, given two metabolic networks N1 and N2, a set of source compounds, and a set of target compounds, we must find the minimum set of reactions whose removal (knockout) ensures that the target compounds are not producible in N1 but are producible in N2. Similar studies exist for the problem of finding the minimum knockout with the smallest side effect for a single network. However, if technologies of external perturbations are advanced in the near future, it may be important to develop methods of computing the minimum knockout for multiple networks (MKMN). Flux balance analysis (FBA) is efficient if a well-polished model is available. However, that is not always the case. Therefore, in this article, we study MKMN in Boolean models and an elementary mode (EM)-based model. Integer linear programming (ILP)-based methods are developed for these models, since MKMN is NP-complete for both the Boolean model and the EM-based model. Computer experiments are conducted with metabolic networks of clostridium perfringens SM101 and bifidobacterium longum DJO10A, respectively known as bad bacteria and good bacteria for the human intestine. The results show that larger networks are more likely to have MKMN solutions. However, solving for these larger networks takes a very long time, and often the computation cannot be completed. This is reasonable, because small networks do not have many alternative pathways, making it difficult to satisfy the MKMN condition, whereas in large networks the number of candidate solutions explodes. Our developed software minFvskO is available online.

Unbundling in Current Broadband and Next-Generation Ultra-Broadband Access Networks

NASA Astrophysics Data System (ADS)

Gaudino, Roberto; Giuliano, Romeo; Mazzenga, Franco; Valcarenghi, Luca; Vatalaro, Francesco

2014-05-01

This article overviews the methods that are currently under investigation for implementing multi-operator open-access/shared-access techniques in next-generation access ultra-broadband architectures, starting from the traditional "unbundling-of-the-local-loop" techniques implemented in legacy twisted-pair digital subscriber line access networks. A straightforward replication of these copper-based unbundling-of-the-local-loop techniques is usually not feasible on next-generation access networks, including fiber-to-the-home point-to-multipoint passive optical networks. To investigate this issue, the article first gives a concise description of traditional copper-based unbundling-of-the-local-loop solutions, then focalizes on both next-generation access hybrid fiber-copper digital subscriber line fiber-to-the-cabinet scenarios and on fiber to the home by accounting for the mix of regulatory and technological reasons driving the next-generation access migration path, focusing mostly on the European situation.

Smart Collision Avoidance and Hazard Routing Mechanism for Intelligent Transport Network

NASA Astrophysics Data System (ADS)

Singh, Gurpreet; Gupta, Pooja; Wahab, Mohd Helmy Abd

2017-08-01

The smart vehicular ad-hoc network is the network that consists of vehicles for smooth movement and better management of the vehicular connectivity across the given network. This research paper aims to propose a set of solution for the VANETs consisting of the automatic driven vehicles, also called as the autonomous car. Such vehicular networks are always prone to collision due to the natural or un-natural reasons which must be solved before the large-scale deployment of the autonomous transport systems. The newly designed intelligent transport movement control mechanism is based upon the intelligent data propagation along with the vehicle collision and traffic jam prevention schema [8], which may help the future designs of smart cities to become more robust and less error-prone. In the proposed model, the focus is on designing a new dynamic and robust hazard routing protocol for intelligent vehicular networks for improvement of the overall performance in various aspects. It is expected to improve the overall transmission delay as well as the number of collisions or adversaries across the vehicular network zone.

A new graph-based method for pairwise global network alignment

PubMed Central

Klau, Gunnar W

2009-01-01

Background In addition to component-based comparative approaches, network alignments provide the means to study conserved network topology such as common pathways and more complex network motifs. Yet, unlike in classical sequence alignment, the comparison of networks becomes computationally more challenging, as most meaningful assumptions instantly lead to NP-hard problems. Most previous algorithmic work on network alignments is heuristic in nature. Results We introduce the graph-based maximum structural matching formulation for pairwise global network alignment. We relate the formulation to previous work and prove NP-hardness of the problem. Based on the new formulation we build upon recent results in computational structural biology and present a novel Lagrangian relaxation approach that, in combination with a branch-and-bound method, computes provably optimal network alignments. The Lagrangian algorithm alone is a powerful heuristic method, which produces solutions that are often near-optimal and – unlike those computed by pure heuristics – come with a quality guarantee. Conclusion Computational experiments on the alignment of protein-protein interaction networks and on the classification of metabolic subnetworks demonstrate that the new method is reasonably fast and has advantages over pure heuristics. Our software tool is freely available as part of the LISA library. PMID:19208162

Computing Smallest Intervention Strategies for Multiple Metabolic Networks in a Boolean Model

PubMed Central

Lu, Wei; Song, Jiangning; Akutsu, Tatsuya

2015-01-01

Abstract This article considers the problem whereby, given two metabolic networks N1 and N2, a set of source compounds, and a set of target compounds, we must find the minimum set of reactions whose removal (knockout) ensures that the target compounds are not producible in N1 but are producible in N2. Similar studies exist for the problem of finding the minimum knockout with the smallest side effect for a single network. However, if technologies of external perturbations are advanced in the near future, it may be important to develop methods of computing the minimum knockout for multiple networks (MKMN). Flux balance analysis (FBA) is efficient if a well-polished model is available. However, that is not always the case. Therefore, in this article, we study MKMN in Boolean models and an elementary mode (EM)-based model. Integer linear programming (ILP)-based methods are developed for these models, since MKMN is NP-complete for both the Boolean model and the EM-based model. Computer experiments are conducted with metabolic networks of clostridium perfringens SM101 and bifidobacterium longum DJO10A, respectively known as bad bacteria and good bacteria for the human intestine. The results show that larger networks are more likely to have MKMN solutions. However, solving for these larger networks takes a very long time, and often the computation cannot be completed. This is reasonable, because small networks do not have many alternative pathways, making it difficult to satisfy the MKMN condition, whereas in large networks the number of candidate solutions explodes. Our developed software minFvskO is available online. PMID:25684199

A neural networks-based hybrid routing protocol for wireless mesh networks.

PubMed

Kojić, Nenad; Reljin, Irini; Reljin, Branimir

2012-01-01

The networking infrastructure of wireless mesh networks (WMNs) is decentralized and relatively simple, but they can display reliable functioning performance while having good redundancy. WMNs provide Internet access for fixed and mobile wireless devices. Both in urban and rural areas they provide users with high-bandwidth networks over a specific coverage area. The main problems affecting these networks are changes in network topology and link quality. In order to provide regular functioning, the routing protocol has the main influence in WMN implementations. In this paper we suggest a new routing protocol for WMN, based on good results of a proactive and reactive routing protocol, and for that reason it can be classified as a hybrid routing protocol. The proposed solution should avoid flooding and creating the new routing metric. We suggest the use of artificial logic-i.e., neural networks (NNs). This protocol is based on mobile agent technologies controlled by a Hopfield neural network. In addition to this, our new routing metric is based on multicriteria optimization in order to minimize delay and blocking probability (rejected packets or their retransmission). The routing protocol observes real network parameters and real network environments. As a result of artificial logic intelligence, the proposed routing protocol should maximize usage of network resources and optimize network performance.

A Neural Networks-Based Hybrid Routing Protocol for Wireless Mesh Networks

PubMed Central

Kojić, Nenad; Reljin, Irini; Reljin, Branimir

2012-01-01

The networking infrastructure of wireless mesh networks (WMNs) is decentralized and relatively simple, but they can display reliable functioning performance while having good redundancy. WMNs provide Internet access for fixed and mobile wireless devices. Both in urban and rural areas they provide users with high-bandwidth networks over a specific coverage area. The main problems affecting these networks are changes in network topology and link quality. In order to provide regular functioning, the routing protocol has the main influence in WMN implementations. In this paper we suggest a new routing protocol for WMN, based on good results of a proactive and reactive routing protocol, and for that reason it can be classified as a hybrid routing protocol. The proposed solution should avoid flooding and creating the new routing metric. We suggest the use of artificial logic—i.e., neural networks (NNs). This protocol is based on mobile agent technologies controlled by a Hopfield neural network. In addition to this, our new routing metric is based on multicriteria optimization in order to minimize delay and blocking probability (rejected packets or their retransmission). The routing protocol observes real network parameters and real network environments. As a result of artificial logic intelligence, the proposed routing protocol should maximize usage of network resources and optimize network performance. PMID:22969360

Math anxiety: Brain cortical network changes in anticipation of doing mathematics.

PubMed

Klados, Manousos A; Pandria, Niki; Micheloyannis, Sifis; Margulies, Daniel; Bamidis, Panagiotis D

2017-12-01

Following our previous work regarding the involvement of math anxiety (MA) in math-oriented tasks, this study tries to explore the differences in the cerebral networks' topology between self-reported low math-anxious (LMA) and high math-anxious (HMA) individuals, during the anticipation phase prior to a mathematical related experiment. For this reason, multichannel EEG recordings were adopted, while the solution of the inverse problem was applied in a generic head model, in order to obtain the cortical signals. The cortical networks have been computed for each band separately, using the magnitude square coherence metric. The main graph theoretical parameters, showed differences in segregation and integration in almost all EEG bands of the HMAs in comparison to LMAs, indicative of a great influence of the anticipatory anxiety prior to mathematical performance. Copyright © 2017 Elsevier B.V. All rights reserved.

Primitive chain network simulations for entangled DNA solutions

NASA Astrophysics Data System (ADS)

Masubuchi, Yuichi; Furuichi, Kenji; Horio, Kazushi; Uneyama, Takashi; Watanabe, Hiroshi; Ianniruberto, Giovanni; Greco, Francesco; Marrucci, Giuseppe

2009-09-01

Molecular theories for polymer rheology are based on conformational dynamics of the polymeric chain. Hence, measurements directly related to molecular conformations appear more appealing than indirect ones obtained from rheology. In this study, primitive chain network simulations are compared to experimental data of entangled DNA solutions [Teixeira et al., Macromolecules 40, 2461 (2007)]. In addition to rheological comparisons of both linear and nonlinear viscoelasticities, a molecular extension measure obtained by Teixeira et al. through fluorescent microscopy is compared to simulations, in terms of both averages and distributions. The influence of flow on conformational distributions has never been simulated for the case of entangled polymers, and how DNA molecular individualism extends to the entangled regime is not known. The linear viscoelastic response and the viscosity growth curve in the nonlinear regime are found in good agreement with data for various DNA concentrations. Conversely, the molecular extension measure shows significant departures, even under equilibrium conditions. The reason for such discrepancies remains unknown.

Rethinking Indoor Localization Solutions Towards the Future of Mobile Location-Based Services

NASA Astrophysics Data System (ADS)

Guney, C.

2017-11-01

Satellite navigation systems with GNSS-enabled devices, such as smartphones, car navigation systems, have changed the way users travel in outdoor environment. GNSS is generally not well suited for indoor location and navigation because of two reasons: First, GNSS does not provide a high level of accuracy although indoor applications need higher accuracies. Secondly, poor coverage of satellite signals for indoor environments decreases its accuracy. So rather than using GNSS satellites within closed environments, existing indoor navigation solutions rely heavily on installed sensor networks. There is a high demand for accurate positioning in wireless networks in GNSS-denied environments. However, current wireless indoor positioning systems cannot satisfy the challenging needs of indoor location-aware applications. Nevertheless, access to a user's location indoors is increasingly important in the development of context-aware applications that increases business efficiency. In this study, how can the current wireless location sensing systems be tailored and integrated for specific applications, like smart cities/grids/buildings/cars and IoT applications, in GNSS-deprived areas.

Reinforcement learning for resource allocation in LEO satellite networks.

PubMed

Usaha, Wipawee; Barria, Javier A

2007-06-01

In this paper, we develop and assess online decision-making algorithms for call admission and routing for low Earth orbit (LEO) satellite networks. It has been shown in a recent paper that, in a LEO satellite system, a semi-Markov decision process formulation of the call admission and routing problem can achieve better performance in terms of an average revenue function than existing routing methods. However, the conventional dynamic programming (DP) numerical solution becomes prohibited as the problem size increases. In this paper, two solution methods based on reinforcement learning (RL) are proposed in order to circumvent the computational burden of DP. The first method is based on an actor-critic method with temporal-difference (TD) learning. The second method is based on a critic-only method, called optimistic TD learning. The algorithms enhance performance in terms of requirements in storage, computational complexity and computational time, and in terms of an overall long-term average revenue function that penalizes blocked calls. Numerical studies are carried out, and the results obtained show that the RL framework can achieve up to 56% higher average revenue over existing routing methods used in LEO satellite networks with reasonable storage and computational requirements.

[Cognitive advantages of the third age: a neural network model of brain aging].

PubMed

Karpenko, M P; Kachalova, L M; Budilova, E V; Terekhin, A T

2009-01-01

We consider a neural network model of age-related cognitive changes in aging brain based on Hopfield network with a sigmoid function of neuron activation. Age is included in the activation function as a parameter in the form of exponential rate denominator, which makes it possible to take into account the weakening of interneuronal links really observed in the aging brain. Analysis of properties of the Lyapunov function associated with the network shows that, with increasing parameter of age, its relief becomes smoother and the number of local minima (network attractors) decreases. As a result, the network gets less frequently stuck in the nearest local minima of the Lyapunov function and reaches a global minimum corresponding to the most effective solution of the cognitive task. It is reasonable to assume that similar changes really occur in the aging brain. Phenomenologically, these changes can be manifested as emergence in aged people of a cognitive quality such as wisdom i.e. ability to find optimal decisions in difficult controversial situations, to distract from secondary aspects and to see the problem as a whole.

Socially Aware Heterogeneous Wireless Networks

PubMed Central

Kosmides, Pavlos; Adamopoulou, Evgenia; Demestichas, Konstantinos; Theologou, Michael; Anagnostou, Miltiades; Rouskas, Angelos

2015-01-01

The development of smart cities has been the epicentre of many researchers’ efforts during the past decade. One of the key requirements for smart city networks is mobility and this is the reason stable, reliable and high-quality wireless communications are needed in order to connect people and devices. Most research efforts so far, have used different kinds of wireless and sensor networks, making interoperability rather difficult to accomplish in smart cities. One common solution proposed in the recent literature is the use of software defined networks (SDNs), in order to enhance interoperability among the various heterogeneous wireless networks. In addition, SDNs can take advantage of the data retrieved from available sensors and use them as part of the intelligent decision making process contacted during the resource allocation procedure. In this paper, we propose an architecture combining heterogeneous wireless networks with social networks using SDNs. Specifically, we exploit the information retrieved from location based social networks regarding users’ locations and we attempt to predict areas that will be crowded by using specially-designed machine learning techniques. By recognizing possible crowded areas, we can provide mobile operators with recommendations about areas requiring datacell activation or deactivation. PMID:26110402

Bidirectional optimization of the melting spinning process.

PubMed

Liang, Xiao; Ding, Yongsheng; Wang, Zidong; Hao, Kuangrong; Hone, Kate; Wang, Huaping

2014-02-01

A bidirectional optimizing approach for the melting spinning process based on an immune-enhanced neural network is proposed. The proposed bidirectional model can not only reveal the internal nonlinear relationship between the process configuration and the quality indices of the fibers as final product, but also provide a tool for engineers to develop new fiber products with expected quality specifications. A neural network is taken as the basis for the bidirectional model, and an immune component is introduced to enlarge the searching scope of the solution field so that the neural network has a larger possibility to find the appropriate and reasonable solution, and the error of prediction can therefore be eliminated. The proposed intelligent model can also help to determine what kind of process configuration should be made in order to produce satisfactory fiber products. To make the proposed model practical to the manufacturing, a software platform is developed. Simulation results show that the proposed model can eliminate the approximation error raised by the neural network-based optimizing model, which is due to the extension of focusing scope by the artificial immune mechanism. Meanwhile, the proposed model with the corresponding software can conduct optimization in two directions, namely, the process optimization and category development, and the corresponding results outperform those with an ordinary neural network-based intelligent model. It is also proved that the proposed model has the potential to act as a valuable tool from which the engineers and decision makers of the spinning process could benefit.

Lateral Prefrontal Cortex Subregions Make Dissociable Contributions during Fluid Reasoning

PubMed Central

Thompson, Russell; Duncan, John; Owen, Adrian M.

2011-01-01

Reasoning is a key component of adaptable “executive” behavior and is known to depend on a network of frontal and parietal brain regions. However, the mechanisms by which this network supports reasoning and adaptable behavior remain poorly defined. Here, we examine the relationship between reasoning, executive control, and frontoparietal function in a series of nonverbal reasoning experiments. Our results demonstrate that, in accordance with previous studies, a network of frontal and parietal brain regions is recruited during reasoning. Our results also reveal that this network can be fractionated according to how different subregions respond when distinct reasoning demands are manipulated. While increased rule complexity modulates activity within a right lateralized network including the middle frontal gyrus and the superior parietal cortex, analogical reasoning demand—or the requirement to remap rules on to novel features—recruits the left inferior rostrolateral prefrontal cortex and the lateral occipital complex. In contrast, the posterior extent of the inferior frontal gyrus, associated with simpler executive demands, is not differentially sensitive to rule complexity or analogical demand. These findings accord well with the hypothesis that different reasoning demands are supported by different frontal and parietal subregions. PMID:20483908

SITRUS: Semantic Infrastructure for Wireless Sensor Networks

PubMed Central

Bispo, Kalil A.; Rosa, Nelson S.; Cunha, Paulo R. F.

2015-01-01

Wireless sensor networks (WSNs) are made up of nodes with limited resources, such as processing, bandwidth, memory and, most importantly, energy. For this reason, it is essential that WSNs always work to reduce the power consumption as much as possible in order to maximize its lifetime. In this context, this paper presents SITRUS (semantic infrastructure for wireless sensor networks), which aims to reduce the power consumption of WSN nodes using ontologies. SITRUS consists of two major parts: a message-oriented middleware responsible for both an oriented message communication service and a reconfiguration service; and a semantic information processing module whose purpose is to generate a semantic database that provides the basis to decide whether a WSN node needs to be reconfigurated or not. In order to evaluate the proposed solution, we carried out an experimental evaluation to assess the power consumption and memory usage of WSN applications built atop SITRUS. PMID:26528974

Reconfiguration of Brain Network Architectures between Resting-State and Complexity-Dependent Cognitive Reasoning.

PubMed

Hearne, Luke J; Cocchi, Luca; Zalesky, Andrew; Mattingley, Jason B

2017-08-30

Our capacity for higher cognitive reasoning has a measurable limit. This limit is thought to arise from the brain's capacity to flexibly reconfigure interactions between spatially distributed networks. Recent work, however, has suggested that reconfigurations of task-related networks are modest when compared with intrinsic "resting-state" network architecture. Here we combined resting-state and task-driven functional magnetic resonance imaging to examine how flexible, task-specific reconfigurations associated with increasing reasoning demands are integrated within a stable intrinsic brain topology. Human participants (21 males and 28 females) underwent an initial resting-state scan, followed by a cognitive reasoning task involving different levels of complexity, followed by a second resting-state scan. The reasoning task required participants to deduce the identity of a missing element in a 4 × 4 matrix, and item difficulty was scaled parametrically as determined by relational complexity theory. Analyses revealed that external task engagement was characterized by a significant change in functional brain modules. Specifically, resting-state and null-task demand conditions were associated with more segregated brain-network topology, whereas increases in reasoning complexity resulted in merging of resting-state modules. Further increments in task complexity did not change the established modular architecture, but affected selective patterns of connectivity between frontoparietal, subcortical, cingulo-opercular, and default-mode networks. Larger increases in network efficiency within the newly established task modules were associated with higher reasoning accuracy. Our results shed light on the network architectures that underlie external task engagement, and highlight selective changes in brain connectivity supporting increases in task complexity. SIGNIFICANCE STATEMENT Humans have clear limits in their ability to solve complex reasoning problems. It is thought that such limitations arise from flexible, moment-to-moment reconfigurations of functional brain networks. It is less clear how such task-driven adaptive changes in connectivity relate to stable, intrinsic networks of the brain and behavioral performance. We found that increased reasoning demands rely on selective patterns of connectivity within cortical networks that emerged in addition to a more general, task-induced modular architecture. This task-driven architecture reverted to a more segregated resting-state architecture both immediately before and after the task. These findings reveal how flexibility in human brain networks is integral to achieving successful reasoning performance across different levels of cognitive demand. Copyright © 2017 the authors 0270-6474/17/378399-13$15.00/0.

Geographical determination of an optimal network of landing sites for Hermes

NASA Astrophysics Data System (ADS)

Goester, J. F.

Once its mission is done, Hermès will perform a deorbit burn, then will pilot towards a specially equipped landing site. As the atmospheric re-entry corridor is limited (the maximum cross range is 1500 km) Hermès will have to be situated on or-bits going near the runway. For safety reasons, we need to get one return opportunity per revolution, so it may be necessary to consider several landing sites and to fit out them. This proposed method allows to find, with easiness and quickness, the geographic areas getting the optimal solutions in term of number of runways, solutions amongst which we will choose already existing sites, checking other meteorologic, politic and economic constraints.

Fault discovery protocol for passive optical networks

NASA Astrophysics Data System (ADS)

Hajduczenia, Marek; Fonseca, Daniel; da Silva, Henrique J. A.; Monteiro, Paulo P.

2007-06-01

All existing flavors of passive optical networks (PONs) provide an attractive alternative to legacy copper-based access lines deployed between a central office (CO) of the service provider (SP) and a customer site. One of the most challenging tasks for PON network planners is the reduction of the overall cost of employing protection schemes for the optical fiber plant while maintaining a reasonable level of survivability and reducing the downtime, thus ensuring acceptable levels of quality of service (QoS) for end subscribers. The recently growing volume of Ethernet PONs deployment [Kramer, IEEE 802.3, CFI (2006)], connected with low-cost electronic and optical components used in the optical network unit (ONU) modules, results in the situation where remote detection of faulty/active subscriber modules becomes indispensable for proper operation of an EPON system. The problem of the remote detection of faulty ONUs in the system is addressed where the upstream channel is flooded with the cw transmission from one or more damaged ONUs and standard communication is severed, providing a solution that is applicable in any type of PON network, regardless of the operating protocol, physical structure, and data rate.

Core network infrastructure supporting the VLT at ESO Paranal in Chile

NASA Astrophysics Data System (ADS)

Reay, Harold

2000-06-01

In October 1997 a number of projects were started at ESO's Paranal Observatory at Cerro Paranal in Chile to upgrade the communications infrastructure in place at the time. The planned upgrades were to internal systems such as computer data networks and telephone installations and also data links connecting Paranal to other ESO sites. This paper details the installation work carried out on the Paranal Core Network (PCN) during the period of October 1997 to December 1999. These installations were to provide both short term solutions to the requirement for reliable high bandwidth network connectivity between Paranal and ESO HQ in Garching, Germany in time for UTI (Antu) first light and perhaps more importantly, to provide the core systems necessary for a site moving towards operational status. This paper explains the reasons for using particular cable types, network topology, and fiber backbone design and implementation. We explain why it was decided to install the PCN in two distinct stages and how equipment used in temporary installations was re-used in the Very Large Telescope networks. Finally we describe the tools used to monitor network and satellite link performance and will discuss whether network backbone bandwidth meets the expected utilization and how this bandwidth can easily be increased in the future should there be a requirement.

Determination of Earth rotation by the combination of data from different space geodetic systems

NASA Technical Reports Server (NTRS)

Archinal, Brent Allen

1987-01-01

Formerly, Earth Rotation Parameters (ERP), i.e., polar motion and UTI-UTC values, have been determined using data from only one observational system at a time, or by the combination of parameters previously obtained in such determinations. The question arises as to whether a simultaneous solution using data from several sources would provide an improved determination of such parameters. To pursue this reasoning, fifteen days of observations have been simulated using realistic networks of Lunar Laser Ranging (LLR), Satellite Laser Ranging (SLR) to Lageos, and Very Long Baseline Interferometry (VLBI) stations. A comparison has been done of the accuracy and precision of the ERP obtained from: (1) the individual system solutions, (2) the weighted means of those values, (3) all of the data by means of the combination of the normal equations obtained in 1, and (4) a grand solution with all the data. These simulations show that solutions done by the normal equation combination and grand solution methods provide the best or nearly the best ERP for all the periods considered, but that weighted mean solutions provide nearly the same accuracy and precision. VLBI solutions also provide similar accuracies.

Equilibrium paths analysis of materials with rheological properties by using the chaos theory

NASA Astrophysics Data System (ADS)

Bednarek, Paweł; Rządkowski, Jan

2018-01-01

The numerical equilibrium path analysis of the material with random rheological properties by using standard procedures and specialist computer programs was not successful. The proper solution for the analysed heuristic model of the material was obtained on the base of chaos theory elements and neural networks. The paper deals with mathematical reasons of used computer programs and also are elaborated the properties of the attractor used in analysis. There are presented results of conducted numerical analysis both in a numerical and in graphical form for the used procedures.

Reference Network Real-Time Services Control Techniques

NASA Astrophysics Data System (ADS)

Nykiel, Grzegorz; Szolucha, Marcin

2013-04-01

Differential corrections and services for real-time kinematic method (RTK) in many cases are used to support survey being base for administration decision. For that reason, services which allow to perform GNSS measurements should be constantly monitored to minimize the risk of any errors or unexpected gap in observation. System providing such control is the subject of the work carried out under a grant NR09-0010-10/2010 conducted by the Military University of Technology. This study was made to develop the concept of monitoring real-time services of Polish reference network ASG-EUPOS and the implementation of software providing users information on system accuracy. The main objectives of all concepts were: maximum use of existing infrastructure while minimizing the cost of installation of new elements, providing users calculation results via the ASG-EUPOS website. In the same time concept assume openness of the module that allow the successive development of applications and integration with existing solutions. This paper present several solutions and algorithms which have been implemented and tested. It also consist some examples of data visualization methods.

Activity in the fronto-parietal network indicates numerical inductive reasoning beyond calculation: An fMRI study combined with a cognitive model

PubMed Central

Liang, Peipeng; Jia, Xiuqin; Taatgen, Niels A.; Borst, Jelmer P.; Li, Kuncheng

2016-01-01

Numerical inductive reasoning refers to the process of identifying and extrapolating the rule involved in numeric materials. It is associated with calculation, and shares the common activation of the fronto-parietal regions with calculation, which suggests that numerical inductive reasoning may correspond to a general calculation process. However, compared with calculation, rule identification is critical and unique to reasoning. Previous studies have established the central role of the fronto-parietal network for relational integration during rule identification in numerical inductive reasoning. The current question of interest is whether numerical inductive reasoning exclusively corresponds to calculation or operates beyond calculation, and whether it is possible to distinguish between them based on the activity pattern in the fronto-parietal network. To directly address this issue, three types of problems were created: numerical inductive reasoning, calculation, and perceptual judgment. Our results showed that the fronto-parietal network was more active in numerical inductive reasoning which requires more exchanges between intermediate representations and long-term declarative knowledge during rule identification. These results survived even after controlling for the covariates of response time and error rate. A computational cognitive model was developed using the cognitive architecture ACT-R to account for the behavioral results and brain activity in the fronto-parietal network. PMID:27193284

Activity in the fronto-parietal network indicates numerical inductive reasoning beyond calculation: An fMRI study combined with a cognitive model.

PubMed

Liang, Peipeng; Jia, Xiuqin; Taatgen, Niels A; Borst, Jelmer P; Li, Kuncheng

2016-05-19

Numerical inductive reasoning refers to the process of identifying and extrapolating the rule involved in numeric materials. It is associated with calculation, and shares the common activation of the fronto-parietal regions with calculation, which suggests that numerical inductive reasoning may correspond to a general calculation process. However, compared with calculation, rule identification is critical and unique to reasoning. Previous studies have established the central role of the fronto-parietal network for relational integration during rule identification in numerical inductive reasoning. The current question of interest is whether numerical inductive reasoning exclusively corresponds to calculation or operates beyond calculation, and whether it is possible to distinguish between them based on the activity pattern in the fronto-parietal network. To directly address this issue, three types of problems were created: numerical inductive reasoning, calculation, and perceptual judgment. Our results showed that the fronto-parietal network was more active in numerical inductive reasoning which requires more exchanges between intermediate representations and long-term declarative knowledge during rule identification. These results survived even after controlling for the covariates of response time and error rate. A computational cognitive model was developed using the cognitive architecture ACT-R to account for the behavioral results and brain activity in the fronto-parietal network.

Global dynamic optimization approach to predict activation in metabolic pathways.

PubMed

de Hijas-Liste, Gundián M; Klipp, Edda; Balsa-Canto, Eva; Banga, Julio R

2014-01-06

During the last decade, a number of authors have shown that the genetic regulation of metabolic networks may follow optimality principles. Optimal control theory has been successfully used to compute optimal enzyme profiles considering simple metabolic pathways. However, applying this optimal control framework to more general networks (e.g. branched networks, or networks incorporating enzyme production dynamics) yields problems that are analytically intractable and/or numerically very challenging. Further, these previous studies have only considered a single-objective framework. In this work we consider a more general multi-objective formulation and we present solutions based on recent developments in global dynamic optimization techniques. We illustrate the performance and capabilities of these techniques considering two sets of problems. First, we consider a set of single-objective examples of increasing complexity taken from the recent literature. We analyze the multimodal character of the associated non linear optimization problems, and we also evaluate different global optimization approaches in terms of numerical robustness, efficiency and scalability. Second, we consider generalized multi-objective formulations for several examples, and we show how this framework results in more biologically meaningful results. The proposed strategy was used to solve a set of single-objective case studies related to unbranched and branched metabolic networks of different levels of complexity. All problems were successfully solved in reasonable computation times with our global dynamic optimization approach, reaching solutions which were comparable or better than those reported in previous literature. Further, we considered, for the first time, multi-objective formulations, illustrating how activation in metabolic pathways can be explained in terms of the best trade-offs between conflicting objectives. This new methodology can be applied to metabolic networks with arbitrary topologies, non-linear dynamics and constraints.

The salience network causally influences default mode network activity during moral reasoning

PubMed Central

Wilson, Stephen M.; D’Esposito, Mark; Kayser, Andrew S.; Grossman, Scott N.; Poorzand, Pardis; Seeley, William W.; Miller, Bruce L.; Rankin, Katherine P.

2013-01-01

Large-scale brain networks are integral to the coordination of human behaviour, and their anatomy provides insights into the clinical presentation and progression of neurodegenerative illnesses such as Alzheimer’s disease, which targets the default mode network, and behavioural variant frontotemporal dementia, which targets a more anterior salience network. Although the default mode network is recruited when healthy subjects deliberate about ‘personal’ moral dilemmas, patients with Alzheimer’s disease give normal responses to these dilemmas whereas patients with behavioural variant frontotemporal dementia give abnormal responses to these dilemmas. We hypothesized that this apparent discrepancy between activation- and patient-based studies of moral reasoning might reflect a modulatory role for the salience network in regulating default mode network activation. Using functional magnetic resonance imaging to characterize network activity of patients with behavioural variant frontotemporal dementia and healthy control subjects, we present four converging lines of evidence supporting a causal influence from the salience network to the default mode network during moral reasoning. First, as previously reported, the default mode network is recruited when healthy subjects deliberate about ‘personal’ moral dilemmas, but patients with behavioural variant frontotemporal dementia producing atrophy in the salience network give abnormally utilitarian responses to these dilemmas. Second, patients with behavioural variant frontotemporal dementia have reduced recruitment of the default mode network compared with healthy control subjects when deliberating about these dilemmas. Third, a Granger causality analysis of functional neuroimaging data from healthy control subjects demonstrates directed functional connectivity from nodes of the salience network to nodes of the default mode network during moral reasoning. Fourth, this Granger causal influence is diminished in patients with behavioural variant frontotemporal dementia. These findings are consistent with a broader model in which the salience network modulates the activity of other large-scale networks, and suggest a revision to a previously proposed ‘dual-process’ account of moral reasoning. These findings also characterize network interactions underlying abnormal moral reasoning in frontotemporal dementia, which may serve as a model for the aberrant judgement and interpersonal behaviour observed in this disease and in other disorders of social function. More broadly, these findings link recent work on the dynamic interrelationships between large-scale brain networks to observable impairments in dementia syndromes, which may shed light on how diseases that target one network also alter the function of interrelated networks. PMID:23576128

Mathematically gifted adolescents mobilize enhanced workspace configuration of theta cortical network during deductive reasoning.

PubMed

Zhang, L; Gan, J Q; Wang, H

2015-03-19

Previous studies have established the importance of the fronto-parietal brain network in the information processing of reasoning. At the level of cortical source analysis, this eletroencepalogram (EEG) study investigates the functional reorganization of the theta-band (4-8Hz) neurocognitive network of mathematically gifted adolescents during deductive reasoning. Depending on the dense increase of long-range phase synchronizations in the reasoning process, math-gifted adolescents show more significant adaptive reorganization and enhanced "workspace" configuration in the theta network as compared with average-ability control subjects. The salient areas are mainly located in the anterior cortical vertices of the fronto-parietal network. Further correlation analyses have shown that the enhanced workspace configuration with respect to the global topological metrics of the theta network in math-gifted subjects is correlated with the intensive frontal midline theta (fm theta) response that is related to strong neural effort for cognitive events. These results suggest that by investing more cognitive resources math-gifted adolescents temporally mobilize an enhanced task-related global neuronal workspace, which is manifested as a highly integrated fronto-parietal information processing network during the reasoning process. Copyright © 2015 IBRO. Published by Elsevier Ltd. All rights reserved.

Algorithms for Performance, Dependability, and Performability Evaluation using Stochastic Activity Networks

NASA Technical Reports Server (NTRS)

Deavours, Daniel D.; Qureshi, M. Akber; Sanders, William H.

1997-01-01

Modeling tools and technologies are important for aerospace development. At the University of Illinois, we have worked on advancing the state of the art in modeling by Markov reward models in two important areas: reducing the memory necessary to numerically solve systems represented as stochastic activity networks and other stochastic Petri net extensions while still obtaining solutions in a reasonable amount of time, and finding numerically stable and memory-efficient methods to solve for the reward accumulated during a finite mission time. A long standing problem when modeling with high level formalisms such as stochastic activity networks is the so-called state space explosion, where the number of states increases exponentially with size of the high level model. Thus, the corresponding Markov model becomes prohibitively large and solution is constrained by the the size of primary memory. To reduce the memory necessary to numerically solve complex systems, we propose new methods that can tolerate such large state spaces that do not require any special structure in the model (as many other techniques do). First, we develop methods that generate row and columns of the state transition-rate-matrix on-the-fly, eliminating the need to explicitly store the matrix at all. Next, we introduce a new iterative solution method, called modified adaptive Gauss-Seidel, that exhibits locality in its use of data from the state transition-rate-matrix, permitting us to cache portions of the matrix and hence reduce the solution time. Finally, we develop a new memory and computationally efficient technique for Gauss-Seidel based solvers that avoids the need for generating rows of A in order to solve Ax = b. This is a significant performance improvement for on-the-fly methods as well as other recent solution techniques based on Kronecker operators. Taken together, these new results show that one can solve very large models without any special structure.

Capacity Evaluation of a Quantum-Based Channel in a Biological Context.

PubMed

Loscri, Valeria; Vegni, Anna Maria

2016-12-01

Nanotechnology, as enabler of the miniaturization of devices in a scale ranging from 1 to few hundreds of nm , represents a viable solution for " alternative" communication paradigms that could be effective in complex networked systems, as body area networks. Traditional communication paradigms are not effective in the context of joint body and nano-networked systems, for several reasons, and then novel approaches have been investigated such as nanomechanical, electromagnetic, acoustic, molecular, etc. On the other hand, quantum phenomena represent a natural direction for developing nanotechnology, since it has to be considered as a new scale where new phenomena can occur and can be exploited for information purpose. Specific quantum particles are phonons, the quanta of mechanical vibrations (i.e., acoustic excitations), that can be analyzed as potential information carriers in a body networked context. In this paper we will focus on the generation of phonons from photon-phonon interaction, by irradiating a sample of human tissue with an electro-magnetic field, and then we will theoretically derive the information capacity and the bit rate in the frequency range [10 3 - 10 12 ] Hz.

Structure solution of network materials by solid-state NMR without knowledge of the crystallographic space group.

PubMed

Brouwer, Darren H

2013-01-01

An algorithm is presented for solving the structures of silicate network materials such as zeolites or layered silicates from solid-state (29)Si double-quantum NMR data for situations in which the crystallographic space group is not known. The algorithm is explained and illustrated in detail using a hypothetical two-dimensional network structure as a working example. The algorithm involves an atom-by-atom structure building process in which candidate partial structures are evaluated according to their agreement with Si-O-Si connectivity information, symmetry restraints, and fits to (29)Si double quantum NMR curves followed by minimization of a cost function that incorporates connectivity, symmetry, and quality of fit to the double quantum curves. The two-dimensional network material is successfully reconstructed from hypothetical NMR data that can be reasonably expected to be obtained for real samples. This advance in "NMR crystallography" is expected to be important for structure determination of partially ordered silicate materials for which diffraction provides very limited structural information. Copyright © 2013 Elsevier Inc. All rights reserved.

Power Aware Management Middleware for Multiple Radio Interfaces

NASA Astrophysics Data System (ADS)

Friedman, Roy; Kogan, Alex

Modern mobile phones and laptops are equipped with multiple wireless communication interfaces, such as WiFi and Bluetooth (BT), enabling the creation of ad-hoc networks. These interfaces significantly differ from one another in their power requirements, transmission range, bandwidth, etc. For example, BT is an order of magnitude more power efficient than WiFi, but its transmission range is an order of magnitude shorter. This paper introduces a management middleware that establishes a power efficient overlay for such ad-hoc networks, in which most devices can shut down their long range power hungry wireless interface (e.g., WiFi). Yet, the resulting overlay is fully connected, and for capacity and latency needs, no message ever travels more than 2k short range (e.g., BT) hops, where k is an arbitrary parameter. The paper describes the architecture of the solution and the management protocol, as well as a detailed simulations based performance study. The simulations largely validate the ability of the management infrastructure to obtain considerable power savings while keeping the network connected and maintaining reasonable latency. The performance study covers both static and mobile networks.

Applying differential dynamic logic to reconfigurable biological networks.

PubMed

Figueiredo, Daniel; Martins, Manuel A; Chaves, Madalena

2017-09-01

Qualitative and quantitative modeling frameworks are widely used for analysis of biological regulatory networks, the former giving a preliminary overview of the system's global dynamics and the latter providing more detailed solutions. Another approach is to model biological regulatory networks as hybrid systems, i.e., systems which can display both continuous and discrete dynamic behaviors. Actually, the development of synthetic biology has shown that this is a suitable way to think about biological systems, which can often be constructed as networks with discrete controllers, and present hybrid behaviors. In this paper we discuss this approach as a special case of the reconfigurability paradigm, well studied in Computer Science (CS). In CS there are well developed computational tools to reason about hybrid systems. We argue that it is worth applying such tools in a biological context. One interesting tool is differential dynamic logic (dL), which has recently been developed by Platzer and applied to many case-studies. In this paper we discuss some simple examples of biological regulatory networks to illustrate how dL can be used as an alternative, or also as a complement to methods already used. Copyright © 2017 Elsevier Inc. All rights reserved.

Nanoscale Control over the Mixing Behavior of Surface-Confined Bicomponent Supramolecular Networks Using an Oriented External Electric Field

PubMed Central

2017-01-01

Strong electric fields are known to influence the properties of molecules as well as materials. Here we show that by changing the orientation of an externally applied electric field, one can locally control the mixing behavior of two molecules physisorbed on a solid surface. Whether the starting two-component network evolves into an ordered two-dimensional (2D) cocrystal, yields an amorphous network where the two components phase separate, or shows preferential adsorption of only one component depends on the solution stoichiometry. The experiments are carried out by changing the orientation of the strong electric field that exists between the tip of a scanning tunneling microscope and a solid substrate. The structure of the two-component network typically changes from open porous at negative substrate bias to relatively compact when the polarity of the applied bias is reversed. The electric-field-induced mixing behavior is reversible, and the supramolecular system exhibits excellent stability and good response efficiency. When molecular guests are adsorbed in the porous networks, the field-induced switching behavior was found to be completely different. Plausible reasons behind the field-induced mixing behavior are discussed. PMID:29112378

GNSS Network Time Series Analysis

NASA Astrophysics Data System (ADS)

Balodis, J.; Janpaule, I.; Haritonova, D.; Normand, M.; Silabriedis, G.; Zarinjsh, A.; Zvirgzds, J.

2012-04-01

Time series of GNSS station results of both the EUPOS®-RIGA and LATPOS networks has been developed at the Institute of Geodesy and Geoinformation (University of Latvia) using Bernese v.5.0 software. The base stations were selected among the EPN and IGS stations in surroundings of Latvia. In various day solutions the base station selection has been miscellaneous. Most frequently 5 - 8 base stations were selected from a set of stations {BOR1, JOEN, JOZE, MDVJ, METS, POLV, PULK, RIGA, TORA, VAAS, VISO, VLNS}. The rejection of "bad base stations" was performed by Bernese software depending on the quality of proper station data in proper day. This caused a reason of miscellaneous base station selection in various days. The results of time series are analysed. The question aroused on the nature of some outlying situations. The seasonal effect of the behaviour of the network has been identified when distance and elevation changes between stations has been analysed. The dependence from various influences has been recognised.

Study of data I/O performance on distributed disk system in mask data preparation

NASA Astrophysics Data System (ADS)

Ohara, Shuichiro; Odaira, Hiroyuki; Chikanaga, Tomoyuki; Hamaji, Masakazu; Yoshioka, Yasuharu

2010-09-01

Data volume is getting larger every day in Mask Data Preparation (MDP). In the meantime, faster data handling is always required. MDP flow typically introduces Distributed Processing (DP) system to realize the demand because using hundreds of CPU is a reasonable solution. However, even if the number of CPU were increased, the throughput might be saturated because hard disk I/O and network speeds could be bottlenecks. So, MDP needs to invest a lot of money to not only hundreds of CPU but also storage and a network device which make the throughput faster. NCS would like to introduce new distributed processing system which is called "NDE". NDE could be a distributed disk system which makes the throughput faster without investing a lot of money because it is designed to use multiple conventional hard drives appropriately over network. NCS studies I/O performance with OASIS® data format on NDE which contributes to realize the high throughput in this paper.

Fuzzy logic, neural networks, and soft computing

NASA Technical Reports Server (NTRS)

Zadeh, Lofti A.

1994-01-01

The past few years have witnessed a rapid growth of interest in a cluster of modes of modeling and computation which may be described collectively as soft computing. The distinguishing characteristic of soft computing is that its primary aims are to achieve tractability, robustness, low cost, and high MIQ (machine intelligence quotient) through an exploitation of the tolerance for imprecision and uncertainty. Thus, in soft computing what is usually sought is an approximate solution to a precisely formulated problem or, more typically, an approximate solution to an imprecisely formulated problem. A simple case in point is the problem of parking a car. Generally, humans can park a car rather easily because the final position of the car is not specified exactly. If it were specified to within, say, a few millimeters and a fraction of a degree, it would take hours or days of maneuvering and precise measurements of distance and angular position to solve the problem. What this simple example points to is the fact that, in general, high precision carries a high cost. The challenge, then, is to exploit the tolerance for imprecision by devising methods of computation which lead to an acceptable solution at low cost. By its nature, soft computing is much closer to human reasoning than the traditional modes of computation. At this juncture, the major components of soft computing are fuzzy logic (FL), neural network theory (NN), and probabilistic reasoning techniques (PR), including genetic algorithms, chaos theory, and part of learning theory. Increasingly, these techniques are used in combination to achieve significant improvement in performance and adaptability. Among the important application areas for soft computing are control systems, expert systems, data compression techniques, image processing, and decision support systems. It may be argued that it is soft computing, rather than the traditional hard computing, that should be viewed as the foundation for artificial intelligence. In the years ahead, this may well become a widely held position.

On performing semantic queries in small devices

NASA Astrophysics Data System (ADS)

Costea, C.; Petrovan, A.; Neamţ, L.; Chiver, O.

2016-08-01

The sensors have a well-defined role in control or monitoring industrial processes; the data given by them can generate valuable information of the trend of the systems to which they belong, but to store a large volume of data and then analysis offline is not always practical. One solution is on-line analysis, preferably as close to the place where data have been generated (edge computing). An increasing amount of data generated by a growing number of devices connected to the Internet resulted in processing data sensors to the edge of the network, in a middle layer where smart entities should interoperate. Diversity of communication technologies outlined the idea of using intermediate devices such as gateways in sensor networks and for this reason the paper examines the functionality of a SPARQL endpoint in the Raspberry Pi device.

Theoretical Analysis of the Mechanism of Fracture Network Propagation with Stimulated Reservoir Volume (SRV) Fracturing in Tight Oil Reservoirs.

PubMed

Su, Yuliang; Ren, Long; Meng, Fankun; Xu, Chen; Wang, Wendong

2015-01-01

Stimulated reservoir volume (SRV) fracturing in tight oil reservoirs often induces complex fracture-network growth, which has a fundamentally different formation mechanism from traditional planar bi-winged fracturing. To reveal the mechanism of fracture network propagation, this paper employs a modified displacement discontinuity method (DDM), mechanical mechanism analysis and initiation and propagation criteria for the theoretical model of fracture network propagation and its derivation. A reasonable solution of the theoretical model for a tight oil reservoir is obtained and verified by a numerical discrete method. Through theoretical calculation and computer programming, the variation rules of formation stress fields, hydraulic fracture propagation patterns (FPP) and branch fracture propagation angles and pressures are analyzed. The results show that during the process of fracture propagation, the initial orientation of the principal stress deflects, and the stress fields at the fracture tips change dramatically in the region surrounding the fracture. Whether the ideal fracture network can be produced depends on the geological conditions and on the engineering treatments. This study has both theoretical significance and practical application value by contributing to a better understanding of fracture network propagation mechanisms in unconventional oil/gas reservoirs and to the improvement of the science and design efficiency of reservoir fracturing.

Data-Aware Retrodiction for Asynchronous Harmonic Measurement in a Cyber-Physical Energy System.

PubMed

Liu, Youda; Wang, Xue; Liu, Yanchi; Cui, Sujin

2016-08-18

Cyber-physical energy systems provide a networked solution for safety, reliability and efficiency problems in smart grids. On the demand side, the secure and trustworthy energy supply requires real-time supervising and online power quality assessing. Harmonics measurement is necessary in power quality evaluation. However, under the large-scale distributed metering architecture, harmonic measurement faces the out-of-sequence measurement (OOSM) problem, which is the result of latencies in sensing or the communication process and brings deviations in data fusion. This paper depicts a distributed measurement network for large-scale asynchronous harmonic analysis and exploits a nonlinear autoregressive model with exogenous inputs (NARX) network to reorder the out-of-sequence measuring data. The NARX network gets the characteristics of the electrical harmonics from practical data rather than the kinematic equations. Thus, the data-aware network approximates the behavior of the practical electrical parameter with real-time data and improves the retrodiction accuracy. Theoretical analysis demonstrates that the data-aware method maintains a reasonable consumption of computing resources. Experiments on a practical testbed of a cyber-physical system are implemented, and harmonic measurement and analysis accuracy are adopted to evaluate the measuring mechanism under a distributed metering network. Results demonstrate an improvement of the harmonics analysis precision and validate the asynchronous measuring method in cyber-physical energy systems.

Theoretical Analysis of the Mechanism of Fracture Network Propagation with Stimulated Reservoir Volume (SRV) Fracturing in Tight Oil Reservoirs

PubMed Central

Su, Yuliang; Ren, Long; Meng, Fankun; Xu, Chen; Wang, Wendong

2015-01-01

Stimulated reservoir volume (SRV) fracturing in tight oil reservoirs often induces complex fracture-network growth, which has a fundamentally different formation mechanism from traditional planar bi-winged fracturing. To reveal the mechanism of fracture network propagation, this paper employs a modified displacement discontinuity method (DDM), mechanical mechanism analysis and initiation and propagation criteria for the theoretical model of fracture network propagation and its derivation. A reasonable solution of the theoretical model for a tight oil reservoir is obtained and verified by a numerical discrete method. Through theoretical calculation and computer programming, the variation rules of formation stress fields, hydraulic fracture propagation patterns (FPP) and branch fracture propagation angles and pressures are analyzed. The results show that during the process of fracture propagation, the initial orientation of the principal stress deflects, and the stress fields at the fracture tips change dramatically in the region surrounding the fracture. Whether the ideal fracture network can be produced depends on the geological conditions and on the engineering treatments. This study has both theoretical significance and practical application value by contributing to a better understanding of fracture network propagation mechanisms in unconventional oil/gas reservoirs and to the improvement of the science and design efficiency of reservoir fracturing. PMID:25966285

23 CFR 658.19 - Reasonable access.

Code of Federal Regulations, 2010 CFR

2010-04-01

... National Network. (c) Nothing in this section shall be construed as preventing any State or local...-mile from the National Network using the most reasonable and practicable route available except for... requests for access from the National Network. (2) State access review processes shall provide for: (i) One...

Structurally Caused Freezing Point Depression of Biological Tissues

PubMed Central

Bloch, Rene; Walters, D. H.; Kuhn, Werner

1963-01-01

When investigating the freezing behaviour (by thermal analysis) of the glycerol-extracted adductor muscle of Mytilus edulis it was observed that the temperature of ice formation in the muscular tissue was up to 1.5°C lower than the freezing point of the embedding liquid, a 0.25 N KCl solution with pH = 4.9 with which the tissue had been equilibrated prior to the freezing experiment. A smaller freezing point depression was observed if the pH values of the embedding 0.25 N KCl solution were above or below pH = 4.9. Reasoning from results obtained previously in analogous experiments with artificial gels, the anomalous freezing depression is explained by the impossibility of growing at the normal freezing temperature regular macroscopic crystals inside the gel, due to the presence of the gel network. The freezing temperature is here determined by the size of the microprisms penetrating the meshes of the network at the lowered freezing temperature. This process leads finally to an ice block of more or less regular structure in which the filaments are embedded. Prerequisite for this hindrance of ideal ice growth is a sufficient tensile strength of the filamental network. The existence of structurally caused freezing point depression in biological tissue is likely to invalidate many conclusions reported in the literature, in which hypertonicity was deduced from cryoscopic data. PMID:13971682

[Physician's anxiety and physician's elegance. Problems in dealing with cost reduction, education of general practitioners and optimal size of practice networks in a cross-national comparison].

PubMed

Behrens, J

2000-03-01

The key reason for physicians networking in managed care is to get a better coping with uncertainty on action (treatment) decisions. The second reason for networking in managed care are financial benefits grounds. But this reason is very ambivalent. Three different action problems (role conflicts) in managed care network are to solved, which was also in single practices. In the lecture the decision strategies and decision resources has been compared. Observations are done using expert interviews, patient interviews and analysis of documents in USA, Germany and Switzerland. The first problem is the choosing of a cost reduction strategy which is not reducing the effectiveness. Such "ugly" solution strategies like exclusion of "expensive" patients and a rationing of necessary medical services in a kind of McDonalds network of physicians will fail the target. The optimost way is a saving of all unnecessary medical even injourious performances. The chosen cost reduction strategy is not real visible from outside but in fact limited cognizable and controllable. Evidence based health care can be a resource of treatment decisions and could train such decisions but it will not substitute these decisions. The second problem is the making of real family practitioners as gatekeepers. Knowledge about the care system is still not making a real family practitioner, even if this is the minimum condition of their work. Also contractual relationships between insurance and doctor as a gatekeeper or financial incentives for patients are still making not a real family practitioner as a gatekpeeper. Only throughout the trust of patients supported by second opinions is making the real family practitioner as a gatekeeper. "Doctor hopping" could be the reaction by scarcity of trustworthy family practitioners as gatekeepers. The third problem is the choosing of the optimal scale of a network due to the very different optimal size of networks regarding the requirement of risk spreeds, of the motivated engagement, of competition, incentives of inclusion of insurantes, they always need other net sizes. But it is possible, for each requirement there could function different networks. A practice (doctor's office) can be a member in different networks in several levels. The social transition from a small office to a network of offices is in all business lines a cultural shock involving not only benefits also psychical and social distress. In this there is no difference between health or agriculture or each other business of trade and industry. The destiny of the joint doctor's offices in Germany suggest due to a very serious power to scatter this networks. The comparative analysis of conflicts, strains, resources and strategies of associations and networks could yield from a developed methodical repository in sociology and social psychology what exists since 40 years (see also Meyer--in this journal). But therefore must be included also the action problems, which are only mentioned in passing of the according profession horizon.

Potential of the aquatic fern Azolla filiculoides in biodegradation of an azo dye: modeling of experimental results by artificial neural networks.

PubMed

Khataee, A R; Movafeghi, A; Vafaei, F; Lisar, S Y Salehi; Zarei, M

2013-01-01

The potential of an aquatic fern, Azolla filiculoides, in phytoremediation of a mono azo dye solution, C.I. Acid Blue 92 (AB92), was studied. The effects of operational parameters such as reaction time, initial dye concentration, fern fresh weight, pH, temperature and reusability of the fern on biodegradation efficiency were investigated. The intermediate compounds produced by biodegradation process were analyzed using GC-MS analysis. An artificial neural network (ANN) model was developed to predict the biodegradation efficiency. The findings indicated that ANN provides reasonable predictive performance (R2 = 0.961). The effects of AB92 solutions (10 and 20 mg L(-1)) on growth, chlorophylls and carotenoids content, activity of antioxidant enzymes such as superoxide dismutase, peroxidase and catalase and formation of malondialdehyde were analyzed. AB92 generally showed inhibitory effects on the growth. Moreover, photosynthetic pigments in the fronds significantly decreased in the treatments. An increase was detected for lipid peroxidation and antioxidant enzymes activity, suggesting that AB92 caused reactive oxygen species production in Azolla fronds, which were scavenged by induced activities of antioxidant enzymes.

A decision network account of reasoning about other people's choices

PubMed Central

Jern, Alan; Kemp, Charles

2015-01-01

The ability to predict and reason about other people's choices is fundamental to social interaction. We propose that people reason about other people's choices using mental models that are similar to decision networks. Decision networks are extensions of Bayesian networks that incorporate the idea that choices are made in order to achieve goals. In our first experiment, we explore how people predict the choices of others. Our remaining three experiments explore how people infer the goals and knowledge of others by observing the choices that they make. We show that decision networks account for our data better than alternative computational accounts that do not incorporate the notion of goal-directed choice or that do not rely on probabilistic inference. PMID:26010559

A review of influenza detection and prediction through social networking sites.

PubMed

Alessa, Ali; Faezipour, Miad

2018-02-01

Early prediction of seasonal epidemics such as influenza may reduce their impact in daily lives. Nowadays, the web can be used for surveillance of diseases. Search engines and social networking sites can be used to track trends of different diseases seven to ten days faster than government agencies such as Center of Disease Control and Prevention (CDC). CDC uses the Illness-Like Influenza Surveillance Network (ILINet), which is a program used to monitor Influenza-Like Illness (ILI) sent by thousands of health care providers in order to detect influenza outbreaks. It is a reliable tool, however, it is slow and expensive. For that reason, many studies aim to develop methods that do real time analysis to track ILI using social networking sites. Social media data such as Twitter can be used to predict the spread of flu in the population and can help in getting early warnings. Today, social networking sites (SNS) are used widely by many people to share thoughts and even health status. Therefore, SNS provides an efficient resource for disease surveillance and a good way to communicate to prevent disease outbreaks. The goal of this study is to review existing alternative solutions that track flu outbreak in real time using social networking sites and web blogs. Many studies have shown that social networking sites can be used to conduct real time analysis for better predictions.

Artificial intelligence: Deep neural reasoning

NASA Astrophysics Data System (ADS)

Jaeger, Herbert

2016-10-01

The human brain can solve highly abstract reasoning problems using a neural network that is entirely physical. The underlying mechanisms are only partially understood, but an artificial network provides valuable insight. See Article p.471

Understanding Gaps in Research Networks: Using "Spatial Reasoning" as a Window into the Importance of Networked Educational Research

ERIC Educational Resources Information Center

Bruce, Catherine D.; Davis, Brent; Sinclair, Nathalie; McGarvey, Lynn; Hallowell, David; Drefs, Michelle; Francis, Krista; Hawes, Zachary; Moss, Joan; Mulligan, Joanne; Okamoto, Yukari; Whiteley, Walter; Woolcott, Geoff

2017-01-01

This paper finds its origins in a multidisciplinary research group's efforts to assemble a review of research in order to better appreciate how "spatial reasoning" is understood and investigated across academic disciplines. We first collaborated to create a historical map of the development of spatial reasoning across key disciplines…

A semantic autonomous video surveillance system for dense camera networks in Smart Cities.

PubMed

Calavia, Lorena; Baladrón, Carlos; Aguiar, Javier M; Carro, Belén; Sánchez-Esguevillas, Antonio

2012-01-01

This paper presents a proposal of an intelligent video surveillance system able to detect and identify abnormal and alarming situations by analyzing object movement. The system is designed to minimize video processing and transmission, thus allowing a large number of cameras to be deployed on the system, and therefore making it suitable for its usage as an integrated safety and security solution in Smart Cities. Alarm detection is performed on the basis of parameters of the moving objects and their trajectories, and is performed using semantic reasoning and ontologies. This means that the system employs a high-level conceptual language easy to understand for human operators, capable of raising enriched alarms with descriptions of what is happening on the image, and to automate reactions to them such as alerting the appropriate emergency services using the Smart City safety network.

All-in-one model for designing optimal water distribution pipe networks

NASA Astrophysics Data System (ADS)

Aklog, Dagnachew; Hosoi, Yoshihiko

2017-05-01

This paper discusses the development of an easy-to-use, all-in-one model for designing optimal water distribution networks. The model combines different optimization techniques into a single package in which a user can easily choose what optimizer to use and compare the results of different optimizers to gain confidence in the performances of the models. At present, three optimization techniques are included in the model: linear programming (LP), genetic algorithm (GA) and a heuristic one-by-one reduction method (OBORM) that was previously developed by the authors. The optimizers were tested on a number of benchmark problems and performed very well in terms of finding optimal or near-optimal solutions with a reasonable computation effort. The results indicate that the model effectively addresses the issues of complexity and limited performance trust associated with previous models and can thus be used for practical purposes.

A Semantic Autonomous Video Surveillance System for Dense Camera Networks in Smart Cities

PubMed Central

Calavia, Lorena; Baladrón, Carlos; Aguiar, Javier M.; Carro, Belén; Sánchez-Esguevillas, Antonio

2012-01-01

This paper presents a proposal of an intelligent video surveillance system able to detect and identify abnormal and alarming situations by analyzing object movement. The system is designed to minimize video processing and transmission, thus allowing a large number of cameras to be deployed on the system, and therefore making it suitable for its usage as an integrated safety and security solution in Smart Cities. Alarm detection is performed on the basis of parameters of the moving objects and their trajectories, and is performed using semantic reasoning and ontologies. This means that the system employs a high-level conceptual language easy to understand for human operators, capable of raising enriched alarms with descriptions of what is happening on the image, and to automate reactions to them such as alerting the appropriate emergency services using the Smart City safety network. PMID:23112607

Optimizing Double-Network Hydrogel for Biomedical Soft Robots.

PubMed

Banerjee, Hritwick; Ren, Hongliang

2017-09-01

Double-network hydrogel with standardized chemical parameters demonstrates a reasonable and viable alternative to silicone in soft robotic fabrication due to its biocompatibility, comparable mechanical properties, and customizability through the alterations of key variables. The most viable hydrogel sample in our article shows tensile strain of 851% and maximum tensile strength of 0.273 MPa. The elasticity and strength range of this hydrogel can be customized according to application requirements by simple alterations in the recipe. Furthermore, we incorporated Agar/PAM hydrogel into our highly constrained soft pneumatic actuator (SPA) design and eventually produced SPAs with escalated capabilities, such as larger range of motion, higher force output, and power efficiency. Incorporating SPAs made of Agar/PAM hydrogel resulted in low viscosity, thermos-reversibility, and ultralow elasticity, which we believe can help to combine with the other functions of hydrogel, tailoring a better solution for fabricating biocompatible soft robots.

A decision network account of reasoning about other people's choices.

PubMed

Jern, Alan; Kemp, Charles

2015-09-01

The ability to predict and reason about other people's choices is fundamental to social interaction. We propose that people reason about other people's choices using mental models that are similar to decision networks. Decision networks are extensions of Bayesian networks that incorporate the idea that choices are made in order to achieve goals. In our first experiment, we explore how people predict the choices of others. Our remaining three experiments explore how people infer the goals and knowledge of others by observing the choices that they make. We show that decision networks account for our data better than alternative computational accounts that do not incorporate the notion of goal-directed choice or that do not rely on probabilistic inference. Copyright © 2015 Elsevier B.V. All rights reserved.

Need low-cost networking? Consider DeviceNet

DOE Office of Scientific and Technical Information (OSTI.GOV)

Moss, W.H.

1996-11-01

The drive to reduce production costs and optimize system performance in manufacturing facilities causes many end users to invest in network solutions. Because of distinct differences between the way tasks are performed and the way data are handled for various applications, it is clear than more than one network will be needed in most facilities. What is not clear is which network is most appropriate for a given application. The information layer is the link between automation and information environments via management information systems (MISs) and manufacturing execution systems (MESs) and manufacturing execution systems (MESs). Here the market has chosenmore » a de facto standard in Ethernet, primarily transmission control protocol/internet protocol (TCP/IP) and secondarily manufacturing messaging system (MMS). There is no single standard at the device layer. However, the DeviceNet communication standard has made strides to reach this goal. This protocol eliminates expensive hardwiring and provides improved communication between devices and important device-level diagnostics not easily accessible or available through hardwired I/O interfaces. DeviceNet is a low-cost communications link connecting industrial devices to a network. Many original equipment manufacturers and end users have chosen the DeviceNet platform for several reasons, but most frequently because of four key features: interchangeability; low cost; advanced diagnostics; insert devices under power.« less

Final Report for the project titled "Enabling Supernova Computations by Integrated Transport and Provisioning Methods Optimized for Dedicated Channels"

DOE Office of Scientific and Technical Information (OSTI.GOV)

Malathi Veeraraghavan

2007-10-31

A high-speed optical circuit network is one that offers users rate-guaranteed connectivity between two endpoints, unlike today’s IP-routed Internet in which the rate available to a pair of users fluctuates based on the volume of competing traffic. This particular research project advanced our understanding of circuit networks in two ways. First, transport protocols were developed for circuit networks. In a circuit network, since bandwidth resources are reserved for each circuit on an end-to-end basis (much like how a person reserves a seat on every leg of a multi-segment flight), and the sender is limited to send at the rate ofmore » the circuit, there is no possibility of congestion during data transfer. Therefore, no congestion control functions are necessary in a transport protocol designed for circuits. However, error control and flow control are still required because bits can become errored due to noise and interference even on highly reliable optical links, and receivers can, due to multitasking or other reasons, not deplete the receive buffer fast enough to keep up with the sending rate (e.g., if the receiving host is multitasking between receiving a file transfer and some other computation). In this work, we developed two transport protocols for circuits, both of which are described below. Second, this project developed techniques for internetworking different types of connection-oriented networks, which are of two types: circuit-switched or packet-switched. In circuit-switched networks, multiplexing on links is “position based,” where “position” refers to the frequency, time slot, and port (fiber), while connection-oriented packet-switched networks use packet header information to demultiplex packets and switch them from node to node. The latter are commonly referred to as virtual circuit networks. Examples of circuit networks are time-division multiplexed Synchronous Optical Network/Synchronous Digital Hierarchy (SONET/SDH) and Wavelength Division Multiplexing (WDM) networks, while examples of virtual-circuit networks are MultiProtocol Label Switched (MPLS) networks and Ethernet Virtual Local Area Network (VLAN) networks. A series of new technologies have been developed to carry Ethernet VLAN tagged frames on SONET/SDH and WDM networks, such as Generic Framing Procedure (GFP) and ITU G.709, respectively. These technologies form the basis of our solution for connection-oriented internetworking. The benefit of developing such an architecture is that it allows different providers to choose different connection-oriented networking technologies for their networks, and yet be able to allow their customers to connect to those of other providers. As Metcalfe, the inventor of Ethernet, noted, the value of a network service grows exponentially with the number of endpoints to which any single endpoint can connect. Therefore internetworking solutions are key to commercial success. The technical effectiveness of our solutions was measured with proof-of-concept prototypes and experiments. These solutions were shown to be highly effective. Economic feasibility requires business case analyses that were beyond the scope of this project. The project results are beneficial to the public as they demonstrate the viability of simultaneously supporting different types of networks and data communication services much like the variety of services available for the transportation of people and goods. For example, Fedex service offers a deadline based delivery while the USPS offers basic package delivery service. Similarly, a circuit network can offer a deadline based delivery of a data file while the IP-routed network offers only basic delivery service with no guarantees. Two project Web sites, 13 publications, 7 software programs, 21 presentations resulted from this work. This report provides the complete list of publications, software programs and presentations. As for student education and training (human resources), this DOE project, along with an NSF project, jointly supported two postdoctoral fellowships, three PhDs, three Masters, and two undergraduate students. Specifically, two of the Masters students were directly funded on this DOE project.« less

Knowledge acquisition for case-based reasoning systems

NASA Technical Reports Server (NTRS)

Riesbeck, Christopher K.

1988-01-01

Case-based reasoning (CBR) is a simple idea: solve new problems by adapting old solutions to similar problems. The CBR approach offers several potential advantages over rule-based reasoning: rules are not combined blindly in a search for solutions, solutions can be explained in terms of concrete examples, and performance can improve automatically as new problems are solved and added to the case library. Moving CBR for the university research environment to the real world requires smooth interfaces for getting knowledge from experts. Described are the basic elements of an interface for acquiring three basic bodies of knowledge that any case-based reasoner requires: the case library of problems and their solutions, the analysis rules that flesh out input problem specifications so that relevant cases can be retrieved, and the adaptation rules that adjust old solutions to fit new problems.

The Identification of Reasons, Solutions, and Techniques Informing a Theory-Based Intervention Targeting Recreational Sports Participation.

PubMed

St Quinton, Tom; Brunton, Julie A

2018-06-01

This study is the 3rd piece of formative research utilizing the theory of planned behavior to inform the development of a behavior change intervention. Focus groups were used to identify reasons for and solutions to previously identified key beliefs in addition to potentially effective behavior change techniques. A purposive sample of 22 first-year undergraduate students (n = 8 men; M age  = 19.8 years, SD = 1.3 years) attending a university in the North of England was used. Focus groups were audio-recorded; recordings were transcribed verbatim, analyzed thematically, and coded for recurrent themes. The data revealed 14 reasons regarding enjoyment, 11 reasons for friends' approval, 11 reasons for friends' own participation, 14 reasons for the approval of family members, and 10 solutions to time constraints. Twelve distinct techniques were suggested to attend to these reasons and solutions. This qualitative research will be used to inform the development of a theory-based intervention to increase students' participation in university recreational sports.

Validation results of the IAG Dancer project for distributed GPS analysis

NASA Astrophysics Data System (ADS)

Boomkamp, H.

2012-12-01

The number of permanent GPS stations in the world has grown far too large to allow processing of all this data at analysis centers. The majority of these GPS sites do not even make their observation data available to the analysis centers, for various valid reasons. The current ITRF solution is still based on centralized analysis by the IGS, and subsequent densification of the reference frame via regional network solutions. Minor inconsistencies in analysis methods, software systems and data quality imply that this centralized approach is unlikely to ever reach the ambitious accuracy objectives of GGOS. The dependence on published data also makes it clear that a centralized approach will never provide a true global ITRF solution for all GNSS receivers in the world. If the data does not come to the analysis, the only alternative is to bring the analysis to the data. The IAG Dancer project has implemented a distributed GNSS analysis system on the internet in which each receiver can have its own analysis center in the form of a freely distributed JAVA peer-to-peer application. Global parameters for satellite orbits, clocks and polar motion are solved via a distributed least squares solution among all participating receivers. A Dancer instance can run on any computer that has simultaneous access to the receiver data and to the public internet. In the future, such a process may be embedded in the receiver firmware directly. GPS network operators can join the Dancer ITRF realization without having to publish their observation data or estimation products. GPS users can run a Dancer process without contributing to the global solution, to have direct access to the ITRF in near real-time. The Dancer software has been tested on-line since late 2011. A global network of processes has gradually evolved to allow stabilization and tuning of the software in order to reach a fully operational system. This presentation reports on the current performance of the Dancer system, and demonstrates the obvious benefits of distributed analysis of geodetic data in general. IAG Dancer screenshot

GBU-X bounding requirements for highly flexible munitions

NASA Astrophysics Data System (ADS)

Bagby, Patrick T.; Shaver, Jonathan; White, Reed; Cafarelli, Sergio; Hébert, Anthony J.

2017-04-01

This paper will present the results of an investigation into requirements for existing software and hardware solutions for open digital communication architectures that support weapon subsystem integration. The underlying requirements of such a communication architecture would be to achieve the lowest latency possible at a reasonable cost point with respect to the mission objective of the weapon. The determination of the latency requirements of the open architecture software and hardware were derived through the use of control system and stability margins analyses. Studies were performed on the throughput and latency of different existing communication transport methods. The two architectures that were tested in this study include Data Distribution Service (DDS) and Modular Open Network Architecture (MONARCH). This paper defines what levels of latency can be achieved with current technology and how this capability may translate to future weapons. The requirements moving forward within communications solutions are discussed.

Modeling Mental Spatial Reasoning about Cardinal Directions

ERIC Educational Resources Information Center

Schultheis, Holger; Bertel, Sven; Barkowsky, Thomas

2014-01-01

This article presents research into human mental spatial reasoning with orientation knowledge. In particular, we look at reasoning problems about cardinal directions that possess multiple valid solutions (i.e., are spatially underdetermined), at human preferences for some of these solutions, and at representational and procedural factors that lead…

Data-Aware Retrodiction for Asynchronous Harmonic Measurement in a Cyber-Physical Energy System

PubMed Central

Liu, Youda; Wang, Xue; Liu, Yanchi; Cui, Sujin

2016-01-01

Cyber-physical energy systems provide a networked solution for safety, reliability and efficiency problems in smart grids. On the demand side, the secure and trustworthy energy supply requires real-time supervising and online power quality assessing. Harmonics measurement is necessary in power quality evaluation. However, under the large-scale distributed metering architecture, harmonic measurement faces the out-of-sequence measurement (OOSM) problem, which is the result of latencies in sensing or the communication process and brings deviations in data fusion. This paper depicts a distributed measurement network for large-scale asynchronous harmonic analysis and exploits a nonlinear autoregressive model with exogenous inputs (NARX) network to reorder the out-of-sequence measuring data. The NARX network gets the characteristics of the electrical harmonics from practical data rather than the kinematic equations. Thus, the data-aware network approximates the behavior of the practical electrical parameter with real-time data and improves the retrodiction accuracy. Theoretical analysis demonstrates that the data-aware method maintains a reasonable consumption of computing resources. Experiments on a practical testbed of a cyber-physical system are implemented, and harmonic measurement and analysis accuracy are adopted to evaluate the measuring mechanism under a distributed metering network. Results demonstrate an improvement of the harmonics analysis precision and validate the asynchronous measuring method in cyber-physical energy systems. PMID:27548171

Automatic Correction Algorithm of Hyfrology Feature Attribute in National Geographic Census

NASA Astrophysics Data System (ADS)

Li, C.; Guo, P.; Liu, X.

2017-09-01

A subset of the attributes of hydrologic features data in national geographic census are not clear, the current solution to this problem was through manual filling which is inefficient and liable to mistakes. So this paper proposes an automatic correction algorithm of hydrologic features attribute. Based on the analysis of the structure characteristics and topological relation, we put forward three basic principles of correction which include network proximity, structure robustness and topology ductility. Based on the WJ-III map workstation, we realize the automatic correction of hydrologic features. Finally, practical data is used to validate the method. The results show that our method is highly reasonable and efficient.

[The microcirculatory bed of the human epididymis].

PubMed

Aleksieiev, O M

1998-08-01

Based on the material of 24 human epididymides at ages 18 to 54, hemomicrocirculatory bed was studied of epididymis in man with the aid of a complex of morphologic techniques (injection of 20% Chinese ink-gelatine suspension, injection of a weak solution of caustic silver, transmission electron microscopy). It has been ascertained that architectonics and ultrastructural features of various links of the hemomicrocirculatory bed have signs of regional specificity for the subcapsular vascular network, small seminal ducts of caput epididymidis, ductus epididymidis of the head, body and tail of the organ. Reasons are discussed why specific hemomicrocirculatory bed should be caused to develop in different parts of the organ.

How large customer direct power transaction mode give consideration to power generation cleaning and power saving

NASA Astrophysics Data System (ADS)

Liu, Yu; Zeng, Ming; Liu, Wei; Li, Ran

2017-05-01

The so-called Large Customers' Direct Power Transaction, refers to the mode that the users on high voltage level, or being seized of hold the large power or independent power distribution, have the qualification of purchasing electricity directly from the generation companies and pay reasonable electricity transmission and distribution fee to the power network enterprises because the transaction is through its transmission channel. The Direct Purchase promotes the marketization level of electricity trading, but there are some problems in its developing process, especially whether promotes the green optimal allocation of power resources, this paper aims to explore the solution.

Identification of the connections in biologically inspired neural networks

NASA Technical Reports Server (NTRS)

Demuth, H.; Leung, K.; Beale, M.; Hicklin, J.

1990-01-01

We developed an identification method to find the strength of the connections between neurons from their behavior in small biologically-inspired artificial neural networks. That is, given the network external inputs and the temporal firing pattern of the neurons, we can calculate a solution for the strengths of the connections between neurons and the initial neuron activations if a solution exists. The method determines directly if there is a solution to a particular neural network problem. No training of the network is required. It should be noted that this is a first pass at the solution of a difficult problem. The neuron and network models chosen are related to biology but do not contain all of its complexities, some of which we hope to add to the model in future work. A variety of new results have been obtained. First, the method has been tailored to produce connection weight matrix solutions for networks with important features of biological neural (bioneural) networks. Second, a computationally efficient method of finding a robust central solution has been developed. This later method also enables us to find the most consistent solution in the presence of noisy data. Prospects of applying our method to identify bioneural network connections are exciting because such connections are almost impossible to measure in the laboratory. Knowledge of such connections would facilitate an understanding of bioneural networks and would allow the construction of the electronic counterparts of bioneural networks on very large scale integrated (VLSI) circuits.

Spatio-Temporal Neural Networks for Vision, Reasoning and Rapid Decision Making

DTIC Science & Technology

1994-08-31

something that is obviously not pattern for long-term knowledge base (LTKB) facts. As a matter possiblc in common neural networks (as units in a...Conferences on Neural Davis, P. (19W0) Application of op~tical chaos to temporal pattern search in a Networks . Piscataway, NJ. [SC] nonlinear optical...Science Institute PROJECT TITLE: Spatio-temporal Neural Networks for Vision, Reasoning and Rapid Decision Making (N00014-93-1-1149) Number of ONR

Using multi-class queuing network to solve performance models of e-business sites.

PubMed

Zheng, Xiao-ying; Chen, De-ren

2004-01-01

Due to e-business's variety of customers with different navigational patterns and demands, multi-class queuing network is a natural performance model for it. The open multi-class queuing network(QN) models are based on the assumption that no service center is saturated as a result of the combined loads of all the classes. Several formulas are used to calculate performance measures, including throughput, residence time, queue length, response time and the average number of requests. The solution technique of closed multi-class QN models is an approximate mean value analysis algorithm (MVA) based on three key equations, because the exact algorithm needs huge time and space requirement. As mixed multi-class QN models, include some open and some closed classes, the open classes should be eliminated to create a closed multi-class QN so that the closed model algorithm can be applied. Some corresponding examples are given to show how to apply the algorithms mentioned in this article. These examples indicate that multi-class QN is a reasonably accurate model of e-business and can be solved efficiently.

Emotional and cognitive stimuli differentially engage the default network during inductive reasoning

PubMed Central

Deckersbach, Thilo; Carlson, Lindsay E.; Beucke, Jan C.; Dougherty, Darin D.

2012-01-01

The brain’s default network (DN) is comprised of several cortical regions demonstrating robust intrinsic connectivity at rest. The authors sought to examine the differential effects of emotional reasoning and reasoning under certainty upon the DN through the employment of an event-related fMRI design in healthy participants. Participants were presented with syllogistic arguments which were organized into a 2 × 2 factorial design in which the first factor was emotional salience and the second factor was certainty/uncertainty. We demonstrate that regions of the DN were activated both during reasoning that is emotionally salient and during reasoning which is more certain, suggesting that these processes are neurally instantiated on a network level. In addition, we present evidence that emotional reasoning preferentially activates the dorsomedial (dMPFC) subsystem of the DN, whereas reasoning in the context of certainty activates areas specific to the DN’s medial temporal (MTL) subsystem. We postulate that emotional reasoning mobilizes the dMPFC subsystem of the DN because this type of reasoning relies upon the recruitment of introspective and self-relevant data such as personal bias and temperament. In contrast, activation of the MTL subsystem during certainty argues that this form of reasoning involves the recruitment of mnemonic and semantic associations to derive conclusions. PMID:21296864

Emotional and cognitive stimuli differentially engage the default network during inductive reasoning.

PubMed

Eldaief, Mark C; Deckersbach, Thilo; Carlson, Lindsay E; Beucke, Jan C; Dougherty, Darin D

2012-04-01

The brain's default network (DN) is comprised of several cortical regions demonstrating robust intrinsic connectivity at rest. The authors sought to examine the differential effects of emotional reasoning and reasoning under certainty upon the DN through the employment of an event-related fMRI design in healthy participants. Participants were presented with syllogistic arguments which were organized into a 2 × 2 factorial design in which the first factor was emotional salience and the second factor was certainty/uncertainty. We demonstrate that regions of the DN were activated both during reasoning that is emotionally salient and during reasoning which is more certain, suggesting that these processes are neurally instantiated on a network level. In addition, we present evidence that emotional reasoning preferentially activates the dorsomedial (dMPFC) subsystem of the DN, whereas reasoning in the context of certainty activates areas specific to the DN's medial temporal (MTL) subsystem. We postulate that emotional reasoning mobilizes the dMPFC subsystem of the DN because this type of reasoning relies upon the recruitment of introspective and self-relevant data such as personal bias and temperament. In contrast, activation of the MTL subsystem during certainty argues that this form of reasoning involves the recruitment of mnemonic and semantic associations to derive conclusions.

Using Sorting Networks for Skill Building and Reasoning

ERIC Educational Resources Information Center

Andre, Robert; Wiest, Lynda R.

2007-01-01

Sorting networks, used in graph theory, have instructional value as a skill- building tool as well as an interesting exploration in discrete mathematics. Students can practice mathematics facts and develop reasoning and logic skills with this topic. (Contains 4 figures.)

False belief and counterfactual reasoning in a social environment.

PubMed

Van Hoeck, Nicole; Begtas, Elizabet; Steen, Johan; Kestemont, Jenny; Vandekerckhove, Marie; Van Overwalle, Frank

2014-04-15

Behavioral studies indicate that theory of mind and counterfactual reasoning are strongly related cognitive processes. In a neuroimaging study, we explored the common and distinct regions underlying these inference processes. We directly compared false belief reasoning (inferring an agent's false belief about an object's location or content) and counterfactual reasoning (inferring what the object's location or content would be if an agent had acted differently), both in contrast with a baseline condition of conditional reasoning (inferring what the true location or content of an object is). Results indicate that these three types of reasoning about social scenarios are supported by activations in the mentalizing network (left temporo-parietal junction and precuneus) and the executive control network (bilateral prefrontal cortex [PFC] and right inferior parietal lobule). In addition, representing a false belief or counterfactual state (both not directly observable in the external world) recruits additional activity in the executive control network (left dorsolateral PFC and parietal lobe). The results further suggest that counterfactual reasoning is a more complex cognitive process than false belief reasoning, showing stronger activation of the dorsomedial, left dorsolateral PFC, cerebellum and left temporal cortex. Copyright © 2013 Elsevier Inc. All rights reserved.

SU-F-R-10: Selecting the Optimal Solution for Multi-Objective Radiomics Model

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhou, Z; Folkert, M; Wang, J

2016-06-15

Purpose: To develop an evidential reasoning approach for selecting the optimal solution from a Pareto solution set obtained by a multi-objective radiomics model for predicting distant failure in lung SBRT. Methods: In the multi-objective radiomics model, both sensitivity and specificity are considered as the objective functions simultaneously. A Pareto solution set with many feasible solutions will be resulted from the multi-objective optimization. In this work, an optimal solution Selection methodology for Multi-Objective radiomics Learning model using the Evidential Reasoning approach (SMOLER) was proposed to select the optimal solution from the Pareto solution set. The proposed SMOLER method used the evidentialmore » reasoning approach to calculate the utility of each solution based on pre-set optimal solution selection rules. The solution with the highest utility was chosen as the optimal solution. In SMOLER, an optimal learning model coupled with clonal selection algorithm was used to optimize model parameters. In this study, PET, CT image features and clinical parameters were utilized for predicting distant failure in lung SBRT. Results: Total 126 solution sets were generated by adjusting predictive model parameters. Each Pareto set contains 100 feasible solutions. The solution selected by SMOLER within each Pareto set was compared to the manually selected optimal solution. Five-cross-validation was used to evaluate the optimal solution selection accuracy of SMOLER. The selection accuracies for five folds were 80.00%, 69.23%, 84.00%, 84.00%, 80.00%, respectively. Conclusion: An optimal solution selection methodology for multi-objective radiomics learning model using the evidential reasoning approach (SMOLER) was proposed. Experimental results show that the optimal solution can be found in approximately 80% cases.« less

Optimal percolation on multiplex networks.

PubMed

Osat, Saeed; Faqeeh, Ali; Radicchi, Filippo

2017-11-16

Optimal percolation is the problem of finding the minimal set of nodes whose removal from a network fragments the system into non-extensive disconnected clusters. The solution to this problem is important for strategies of immunization in disease spreading, and influence maximization in opinion dynamics. Optimal percolation has received considerable attention in the context of isolated networks. However, its generalization to multiplex networks has not yet been considered. Here we show that approximating the solution of the optimal percolation problem on a multiplex network with solutions valid for single-layer networks extracted from the multiplex may have serious consequences in the characterization of the true robustness of the system. We reach this conclusion by extending many of the methods for finding approximate solutions of the optimal percolation problem from single-layer to multiplex networks, and performing a systematic analysis on synthetic and real-world multiplex networks.

76 FR 32366 - Determination That ORLAAM (Levomethadyl Acetate Hydrochloride) Oral Solution, 10 Milligrams...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-06-06

...) Oral Solution, 10 Milligrams/Milliliter, Was Not Withdrawn From Sale for Reasons of Safety or... milligrams (mg)/milliliter (mL), was not withdrawn from sale for reasons of safety or effectiveness. This... the drug's NDA or ANDA for reasons of safety or effectiveness or if FDA determines that the listed...

A Framework to Implement IoT Network Performance Modelling Techniques for Network Solution Selection †

PubMed Central

Delaney, Declan T.; O’Hare, Gregory M. P.

2016-01-01

No single network solution for Internet of Things (IoT) networks can provide the required level of Quality of Service (QoS) for all applications in all environments. This leads to an increasing number of solutions created to fit particular scenarios. Given the increasing number and complexity of solutions available, it becomes difficult for an application developer to choose the solution which is best suited for an application. This article introduces a framework which autonomously chooses the best solution for the application given the current deployed environment. The framework utilises a performance model to predict the expected performance of a particular solution in a given environment. The framework can then choose an apt solution for the application from a set of available solutions. This article presents the framework with a set of models built using data collected from simulation. The modelling technique can determine with up to 85% accuracy the solution which performs the best for a particular performance metric given a set of solutions. The article highlights the fractured and disjointed practice currently in place for examining and comparing communication solutions and aims to open a discussion on harmonising testing procedures so that different solutions can be directly compared and offers a framework to achieve this within IoT networks. PMID:27916929

A Framework to Implement IoT Network Performance Modelling Techniques for Network Solution Selection.

PubMed

Delaney, Declan T; O'Hare, Gregory M P

2016-12-01

No single network solution for Internet of Things (IoT) networks can provide the required level of Quality of Service (QoS) for all applications in all environments. This leads to an increasing number of solutions created to fit particular scenarios. Given the increasing number and complexity of solutions available, it becomes difficult for an application developer to choose the solution which is best suited for an application. This article introduces a framework which autonomously chooses the best solution for the application given the current deployed environment. The framework utilises a performance model to predict the expected performance of a particular solution in a given environment. The framework can then choose an apt solution for the application from a set of available solutions. This article presents the framework with a set of models built using data collected from simulation. The modelling technique can determine with up to 85% accuracy the solution which performs the best for a particular performance metric given a set of solutions. The article highlights the fractured and disjointed practice currently in place for examining and comparing communication solutions and aims to open a discussion on harmonising testing procedures so that different solutions can be directly compared and offers a framework to achieve this within IoT networks.

Self-organization and solution of shortest-path optimization problems with memristive networks

NASA Astrophysics Data System (ADS)

Pershin, Yuriy V.; Di Ventra, Massimiliano

2013-07-01

We show that memristive networks, namely networks of resistors with memory, can efficiently solve shortest-path optimization problems. Indeed, the presence of memory (time nonlocality) promotes self organization of the network into the shortest possible path(s). We introduce a network entropy function to characterize the self-organized evolution, show the solution of the shortest-path problem and demonstrate the healing property of the solution path. Finally, we provide an algorithm to solve the traveling salesman problem. Similar considerations apply to networks of memcapacitors and meminductors, and networks with memory in various dimensions.

Effect of nanograin-boundary networks generation on corrosion of carburized martensitic stainless steel.

PubMed

Boonruang, Chatdanai; Thong-On, Atcharawadi; Kidkhunthod, Pinit

2018-02-02

Martensitic stainless steel parts used in carbonaceous atmosphere at high temperature are subject to corrosion which results in a large amount of lost energy and high repair and maintenance costs. This work therefore proposes a model for surface development and corrosion mechanism as a solution to reduce corrosion costs. The morphology, phase, and corrosion behavior of steel are investigated using GIXRD, XANES, and EIS. The results show formation of nanograin-boundary networks in the protective layer of martensitic stainless steel. This Cr 2 O 3 -Cr 7 C 3 nanograin mixture on the FeCr 2 O 4 layer causes ion transport which is the main reason for the corrosion reaction during carburizing of the steel. The results reveal the rate determining steps in the corrosion mechanism during carburizing of steel. These steps are the diffusion of uncharged active gases in the stagnant-gas layer over the steel surface followed by the conversion of C into C 4- and O into O 2- at the gas-oxide interface simultaneously with the migration of Cr 3+ from the metal-oxide interface to the gas-oxide interface. It is proposed that previous research on Al 2 O 3 coatings may be the solution to producing effective coatings that overcome the corrosion challenges discussed in this work.

Frequency-Dependent Enhancement of Fluid Intelligence Induced by Transcranial Oscillatory Potentials

DOE Office of Scientific and Technical Information (OSTI.GOV)

Santarnecchi, Emiliano; Polizzotto, Nicola Riccardo; Godone, Marco

Everyday problem solving requires the ability to go beyond experience by efficiently encoding and manipulating new information, i.e., fluid intelligence (Gf) [1]. Performance in tasks involving Gf, such as logical and abstract reasoning, has been shown to rely on distributed neural networks, with a crucial role played by prefrontal regions [2]. Synchronization of neuronal activity in the gamma band is a ubiquitous phenomenon within the brain; however, no evidence of its causal involvement in cognition exists to date [3]. Here, we show an enhancement of Gf ability in a cognitive task induced by exogenous rhythmic stimulation within the gamma band.more » Imperceptible alternating current [4] delivered through the scalp over the left middle frontal gyrus resulted in a frequency-specific shortening of the time required to find the correct solution in a visuospatial abstract reasoning task classically employed to measure Gf abilities (i.e., Raven’s matrices) [5]. Crucially, gamma-band stimulation (γ-tACS) selectively enhanced performance only on more complex trials involving conditional/logical reasoning. The finding presented here supports a direct involvement of gamma oscillatory activity in the mechanisms underlying higher-order human cognition.« less

A New Neural Network Approach Including First-Guess for Retrieval of Atmospheric Water Vapor, Cloud Liquid Water Path, Surface Temperature and Emissivities Over Land From Satellite Microwave Observations

NASA Technical Reports Server (NTRS)

Aires, F.; Prigent, C.; Rossow, W. B.; Rothstein, M.; Hansen, James E. (Technical Monitor)

2000-01-01

The analysis of microwave observations over land to determine atmospheric and surface parameters is still limited due to the complexity of the inverse problem. Neural network techniques have already proved successful as the basis of efficient retrieval methods for non-linear cases, however, first-guess estimates, which are used in variational methods to avoid problems of solution non-uniqueness or other forms of solution irregularity, have up to now not been used with neural network methods. In this study, a neural network approach is developed that uses a first-guess. Conceptual bridges are established between the neural network and variational methods. The new neural method retrieves the surface skin temperature, the integrated water vapor content, the cloud liquid water path and the microwave surface emissivities between 19 and 85 GHz over land from SSM/I observations. The retrieval, in parallel, of all these quantities improves the results for consistency reasons. A data base to train the neural network is calculated with a radiative transfer model and a a global collection of coincident surface and atmospheric parameters extracted from the National Center for Environmental Prediction reanalysis, from the International Satellite Cloud Climatology Project data and from microwave emissivity atlases previously calculated. The results of the neural network inversion are very encouraging. The r.m.s. error of the surface temperature retrieval over the globe is 1.3 K in clear sky conditions and 1.6 K in cloudy scenes. Water vapor is retrieved with a r.m.s. error of 3.8 kg/sq m in clear conditions and 4.9 kg/sq m in cloudy situations. The r.m.s. error in cloud liquid water path is 0.08 kg/sq m . The surface emissivities are retrieved with an accuracy of better than 0.008 in clear conditions and 0.010 in cloudy conditions. Microwave land surface temperature retrieval presents a very attractive complement to the infrared estimates in cloudy areas: time record of land surface temperature will be produced.

AI and simulation: What can they learn from each other

NASA Technical Reports Server (NTRS)

Colombano, Silvano P.

1988-01-01

Simulation and Artificial Intelligence share a fertile common ground both from a practical and from a conceptual point of view. Strengths and weaknesses of both Knowledge Based System and Modeling and Simulation are examined and three types of systems that combine the strengths of both technologies are discussed. These types of systems are a practical starting point, however, the real strengths of both technologies will be exploited only when they are combined in a common knowledge representation paradigm. From an even deeper conceptual point of view, one might even argue that the ability to reason from a set of facts (i.e., Expert System) is less representative of human reasoning than the ability to make a model of the world, change it as required, and derive conclusions about the expected behavior of world entities. This is a fundamental problem in AI, and Modeling Theory can contribute to its solution. The application of Knowledge Engineering technology to a Distributed Processing Network Simulator (DPNS) is discussed.

Developing a Network of and for Geometric Reasoning

ERIC Educational Resources Information Center

Mamolo, Ami; Ruttenberg-Rozen, Robyn; Whiteley, Walter

2015-01-01

In this article, we develop a theoretical model for restructuring mathematical tasks, usually considered advanced, with a network of spatial visual representations designed to support geometric reasoning for learners of disparate ages, stages, strengths, and preparation. Through our geometric reworking of the well-known "open box…

Single- and Multiple-Objective Optimization with Differential Evolution and Neural Networks

NASA Technical Reports Server (NTRS)

Rai, Man Mohan

2006-01-01

Genetic and evolutionary algorithms have been applied to solve numerous problems in engineering design where they have been used primarily as optimization procedures. These methods have an advantage over conventional gradient-based search procedures became they are capable of finding global optima of multi-modal functions and searching design spaces with disjoint feasible regions. They are also robust in the presence of noisy data. Another desirable feature of these methods is that they can efficiently use distributed and parallel computing resources since multiple function evaluations (flow simulations in aerodynamics design) can be performed simultaneously and independently on ultiple processors. For these reasons genetic and evolutionary algorithms are being used more frequently in design optimization. Examples include airfoil and wing design and compressor and turbine airfoil design. They are also finding increasing use in multiple-objective and multidisciplinary optimization. This lecture will focus on an evolutionary method that is a relatively new member to the general class of evolutionary methods called differential evolution (DE). This method is easy to use and program and it requires relatively few user-specified constants. These constants are easily determined for a wide class of problems. Fine-tuning the constants will off course yield the solution to the optimization problem at hand more rapidly. DE can be efficiently implemented on parallel computers and can be used for continuous, discrete and mixed discrete/continuous optimization problems. It does not require the objective function to be continuous and is noise tolerant. DE and applications to single and multiple-objective optimization will be included in the presentation and lecture notes. A method for aerodynamic design optimization that is based on neural networks will also be included as a part of this lecture. The method offers advantages over traditional optimization methods. It is more flexible than other methods in dealing with design in the context of both steady and unsteady flows, partial and complete data sets, combined experimental and numerical data, inclusion of various constraints and rules of thumb, and other issues that characterize the aerodynamic design process. Neural networks provide a natural framework within which a succession of numerical solutions of increasing fidelity, incorporating more realistic flow physics, can be represented and utilized for optimization. Neural networks also offer an excellent framework for multiple-objective and multi-disciplinary design optimization. Simulation tools from various disciplines can be integrated within this framework and rapid trade-off studies involving one or many disciplines can be performed. The prospect of combining neural network based optimization methods and evolutionary algorithms to obtain a hybrid method with the best properties of both methods will be included in this presentation. Achieving solution diversity and accurate convergence to the exact Pareto front in multiple objective optimization usually requires a significant computational effort with evolutionary algorithms. In this lecture we will also explore the possibility of using neural networks to obtain estimates of the Pareto optimal front using non-dominated solutions generated by DE as training data. Neural network estimators have the potential advantage of reducing the number of function evaluations required to obtain solution accuracy and diversity, thus reducing cost to design.

Wireless Infrastructure for Performing Monitoring, Diagnostics, and Control HVAC and Other Energy-Using Systems in Small Commercial Buildings

DOE Office of Scientific and Technical Information (OSTI.GOV)

Patrick O'Neill

This project focused on developing a low-cost wireless infrastructure for monitoring, diagnosing, and controlling building systems and equipment. End users receive information via the Internet and need only a web browser and Internet connection. The system used wireless communications for: (1) collecting data centrally on site from many wireless sensors installed on building equipment, (2) transmitting control signals to actuators and (3) transmitting data to an offsite network operations center where it is processed and made available to clients on the Web (see Figure 1). Although this wireless infrastructure can be applied to any building system, it was tested onmore » two representative applications: (1) monitoring and diagnostics for packaged rooftop HVAC units used widely on small commercial buildings and (2) continuous diagnosis and control of scheduling errors such as lights and equipment left on during unoccupied hours. This project developed a generic infrastructure for performance monitoring, diagnostics, and control, applicable to a broad range of building systems and equipment, but targeted specifically to small to medium commercial buildings (an underserved market segment). The proposed solution is based on two wireless technologies. The first, wireless telemetry, is used for cell phones and paging and is reliable and widely available. This risk proved to be easily managed during the project. The second technology is on-site wireless communication for acquiring data from sensors and transmitting control signals. The technology must enable communication with many nodes, overcome physical obstructions, operate in environments with other electrical equipment, support operation with on-board power (instead of line power) for some applications, operate at low transmission power in license-free radio bands, and be low cost. We proposed wireless mesh networking to meet these needs. This technology is relatively new and has been applied only in research and tests. This proved to be a major challenge for the project and was ultimately abandoned in favor of a directly wired solution for collecting sensor data at the building. The primary reason for this was the relatively short ranges at which we were able to effectively place the sensor nodes from the central receiving unit. Several different mesh technologies were attempted with similar results. Two hardware devices were created during the original performance period of the project. The first device, the WEB-MC, is a master control unit that has two radios, a CPU, memory, and serves as the central communications device for the WEB-MC System (Currently called the 'BEST Wireless HVAC Maintenance System' as a tentative commercial product name). The WEB-MC communicates with the local mesh network system via one of its antennas. Communication with the mesh network enables the WEB-MC to configure the network, send/receive data from individual motes, and serves as the primary mechanism for collecting sensor data at remote locations. The second antenna enables the WEB-MC to connect to a cellular network ('Long-Haul Communications') to transfer data to and from the NorthWrite Network Operations Center (NOC). A third 'all-in-one' hardware solution was created after the project was extended (Phase 2) and additional resources were provided. The project team leveraged a project funded by the State of Washington to develop a hardware solution that integrated the functionality of the original two devices. The primary reason for this approach was to eliminate the mesh network technical difficulties that severely limited the functionality of the original hardware approach. There were five separate software developments required to deliver the functionality needed for this project. These include the Data Server (or Network Operations Center), Web Application, Diagnostic Software, WEB-MC Embedded Software, Mote Embedded Software. Each of these developments was necessarily dependent on the others. This resulted in a challenging management task - requiring high bandwidth communications among all the team members. Fortunately, the project team performed exceptionally well together and was able to work through the various challenges that this presented - for example, when one software tool required a detailed description of the output of a second tool, before that tool had been fully designed.« less

Cumulative Significance of Hyporheic Exchange and Biogeochemical Processing in River Networks

NASA Astrophysics Data System (ADS)

Harvey, J. W.; Gomez-Velez, J. D.

2014-12-01

Biogeochemical reactions in rivers that decrease excessive loads of nutrients, metals, organic compounds, etc. are enhanced by hydrologic interactions with microbially and geochemically active sediments of the hyporheic zone. The significance of reactions in individual hyporheic flow paths has been shown to be controlled by the contact time between river water and sediment and the intrinsic reaction rate in the sediment. However, little is known about how the cumulative effects of hyporheic processing in large river basins. We used the river network model NEXSS (Gomez-Velez and Harvey, submitted) to simulate hyporheic exchange through synthetic river networks based on the best available models of network topology, hydraulic geometry and scaling of geomorphic features, grain size, hydraulic conductivity, and intrinsic reaction rates of nutrients and metals in river sediment. The dimensionless reaction significance factor, RSF (Harvey et al., 2013) was used to quantify the cumulative removal fraction of a reactive solute by hyporheic processing. SF scales reaction progress in a single pass through the hyporheic zone with the proportion of stream discharge passing through the hyporheic zone for a specified distance. Reaction progress is optimal where the intrinsic reaction timescale in sediment matches the residence time of hyporheic flow and is less efficient in longer residence time hyporheic flow as a result of the decreasing proportion of river flow that is processed by longer residence time hyporheic flow paths. In contrast, higher fluxes through short residence time hyporheic flow paths may be inefficient because of the repeated surface-subsurface exchanges required to complete the reaction. Using NEXSS we found that reaction efficiency may be high in both small streams and large rivers, although for different reasons. In small streams reaction progress generally is dominated by faster pathways of vertical exchange beneath submerged bedforms. Slower exchange beneath meandering river banks mainly has importance only in large rivers. For solutes entering networks in proportion to water inputs it is the lower order streams that tend to dominate cumulative reaction progress.

THREAT ANTICIPATION AND DECEPTIVE REASONING USING BAYESIAN BELIEF NETWORKS

DOE Office of Scientific and Technical Information (OSTI.GOV)

Allgood, Glenn O; Olama, Mohammed M; Lake, Joe E

Recent events highlight the need for tools to anticipate threats posed by terrorists. Assessing these threats requires combining information from disparate data sources such as analytic models, simulations, historical data, sensor networks, and user judgments. These disparate data can be combined in a coherent, analytically defensible, and understandable manner using a Bayesian belief network (BBN). In this paper, we develop a BBN threat anticipatory model based on a deceptive reasoning algorithm using a network engineering process that treats the probability distributions of the BBN nodes within the broader context of the system development process.

Analytical reasoning task reveals limits of social learning in networks.

PubMed

Rahwan, Iyad; Krasnoshtan, Dmytro; Shariff, Azim; Bonnefon, Jean-François

2014-04-06

Social learning-by observing and copying others-is a highly successful cultural mechanism for adaptation, outperforming individual information acquisition and experience. Here, we investigate social learning in the context of the uniquely human capacity for reflective, analytical reasoning. A hallmark of the human mind is its ability to engage analytical reasoning, and suppress false associative intuitions. Through a set of laboratory-based network experiments, we find that social learning fails to propagate this cognitive strategy. When people make false intuitive conclusions and are exposed to the analytic output of their peers, they recognize and adopt this correct output. But they fail to engage analytical reasoning in similar subsequent tasks. Thus, humans exhibit an 'unreflective copying bias', which limits their social learning to the output, rather than the process, of their peers' reasoning-even when doing so requires minimal effort and no technical skill. In contrast to much recent work on observation-based social learning, which emphasizes the propagation of successful behaviour through copying, our findings identify a limit on the power of social networks in situations that require analytical reasoning.

Wireless sensor networks to assess the impacts of global change in Sierra Nevada (Spain) mountains

NASA Astrophysics Data System (ADS)

Sánchez-Cano, Francisco M.; Bonet-García, Francisco J.; Pérez-Luque, Antonio J.; Suárez-Muñoz, María

2017-04-01

Sierra Nevada Global Change Observatory (southern Spain) aims to improve the ability of ecosystems to address the impacts of global change. To this end, a monitoring program has been implemented based on the collection of long time series on a multitude of biophysical variables. This initiative is part of the Long Term Ecological Research network and is connected to similar ones at national and international level. One of the specific objectives of this LTER site is to improve understanding of the relationships between abiotic factors and ecosystem functioning / structure. Wireless sensor networks are a key instrument for achieving this aim. This contribution describes the design and management of a sensor network that is intended to monitor several biophysical variables with high temporal and spatial resolution in Quercus pyrenaica forests located in this mountain region. The following solution has been adopted in order to obtain the observational data (physical and biological variables). The biological variables will be monitored by PAR sensors (photosynthetically active radiation), and the physical variables will be acquired by a meteorological station and a sensor network composed of temperature and soil moisture sensors, as well as air temperature and humidity ones. To complete the monitoring of the biological variables, a NDVI (Normalized Difference Vegetation Index) camera will be deployed focusing to a Quercus pyrenaica forest from the opposite slope. It should be noted that all monitoring systems exposed will be powered by solar energy. The management of the sensor network covers the deployment of more than 100 sensors, guaranteeing both remote accessibility and reliability of the data. The chosen solution is provided by the company Adevice whose ONE-GO communication system ensures a consistent and efficient sending of those values read by the different sensors towards a central point, from where the information (RAW data) is accessible through WiFi/3G. RAW data is dumped daily in our data center for further processing with the open source software Get-IT. Get-IT was developed by the CNR (National Research Council of Italy) in the context of the RITMARE Flagship Project and LifeWatch Italy in order to combine geographic information with observational data by coupling GeoNode with SOS implementation by 52° North. This solution conforms to our requirements for two reasons, the first is that it provides data persistence, metadata editing and data visualisation tools. The second is that it is the solution adopted by LTER, platform previously mentioned in which we are integrated. This research has been funded by eLTER (Integrated European Long-Term Ecosystem & Socio-Ecological Research Infrastructure) Horizon 2020 EU project, and Sierra Nevada Global Change Observatory (LTER-site).

The experimental identification of magnetorheological dampers and evaluation of their controllers

NASA Astrophysics Data System (ADS)

Metered, H.; Bonello, P.; Oyadiji, S. O.

2010-05-01

Magnetorheological (MR) fluid dampers are semi-active control devices that have been applied over a wide range of practical vibration control applications. This paper concerns the experimental identification of the dynamic behaviour of an MR damper and the use of the identified parameters in the control of such a damper. Feed-forward and recurrent neural networks are used to model both the direct and inverse dynamics of the damper. Training and validation of the proposed neural networks are achieved by using the data generated through dynamic tests with the damper mounted on a tensile testing machine. The validation test results clearly show that the proposed neural networks can reliably represent both the direct and inverse dynamic behaviours of an MR damper. The effect of the cylinder's surface temperature on both the direct and inverse dynamics of the damper is studied, and the neural network model is shown to be reasonably robust against significant temperature variation. The inverse recurrent neural network model is introduced as a damper controller and experimentally evaluated against alternative controllers proposed in the literature. The results reveal that the neural-based damper controller offers superior damper control. This observation and the added advantages of low-power requirement, extended service life of the damper and the minimal use of sensors, indicate that a neural-based damper controller potentially offers the most cost-effective vibration control solution among the controllers investigated.

Receptive field optimisation and supervision of a fuzzy spiking neural network.

PubMed

Glackin, Cornelius; Maguire, Liam; McDaid, Liam; Sayers, Heather

2011-04-01

This paper presents a supervised training algorithm that implements fuzzy reasoning on a spiking neural network. Neuron selectivity is facilitated using receptive fields that enable individual neurons to be responsive to certain spike train firing rates and behave in a similar manner as fuzzy membership functions. The connectivity of the hidden and output layers in the fuzzy spiking neural network (FSNN) is representative of a fuzzy rule base. Fuzzy C-Means clustering is utilised to produce clusters that represent the antecedent part of the fuzzy rule base that aid classification of the feature data. Suitable cluster widths are determined using two strategies; subjective thresholding and evolutionary thresholding respectively. The former technique typically results in compact solutions in terms of the number of neurons, and is shown to be particularly suited to small data sets. In the latter technique a pool of cluster candidates is generated using Fuzzy C-Means clustering and then a genetic algorithm is employed to select the most suitable clusters and to specify cluster widths. In both scenarios, the network is supervised but learning only occurs locally as in the biological case. The advantages and disadvantages of the network topology for the Fisher Iris and Wisconsin Breast Cancer benchmark classification tasks are demonstrated and directions of current and future work are discussed. Copyright © 2010 Elsevier Ltd. All rights reserved.

Load Balancing in Structured P2P Networks

NASA Astrophysics Data System (ADS)

Zhu, Yingwu

In this chapter we start by addressing the importance and necessity of load balancing in structured P2P networks, due to three main reasons. First, structured P2P networks assume uniform peer capacities while peer capacities are heterogeneous in deployed P2P networks. Second, resorting to pseudo-uniformity of the hash function used to generate node IDs and data item keys leads to imbalanced overlay address space and item distribution. Lastly, placement of data items cannot be randomized in some applications (e.g., range searching). We then present an overview of load aggregation and dissemination techniques that are required by many load balancing algorithms. Two techniques are discussed including tree structure-based approach and gossip-based approach. They make different tradeoffs between estimate/aggregate accuracy and failure resilience. To address the issue of load imbalance, three main solutions are described: virtual server-based approach, power of two choices, and address-space and item balancing. While different in their designs, they all aim to improve balance on the address space and data item distribution. As a case study, the chapter discusses a virtual server-based load balancing algorithm that strives to ensure fair load distribution among nodes and minimize load balancing cost in bandwidth. Finally, the chapter concludes with future research and a summary.

Security issues in healthcare applications using wireless medical sensor networks: a survey.

PubMed

Kumar, Pardeep; Lee, Hoon-Jae

2012-01-01

Healthcare applications are considered as promising fields for wireless sensor networks, where patients can be monitored using wireless medical sensor networks (WMSNs). Current WMSN healthcare research trends focus on patient reliable communication, patient mobility, and energy-efficient routing, as a few examples. However, deploying new technologies in healthcare applications without considering security makes patient privacy vulnerable. Moreover, the physiological data of an individual are highly sensitive. Therefore, security is a paramount requirement of healthcare applications, especially in the case of patient privacy, if the patient has an embarrassing disease. This paper discusses the security and privacy issues in healthcare application using WMSNs. We highlight some popular healthcare projects using wireless medical sensor networks, and discuss their security. Our aim is to instigate discussion on these critical issues since the success of healthcare application depends directly on patient security and privacy, for ethic as well as legal reasons. In addition, we discuss the issues with existing security mechanisms, and sketch out the important security requirements for such applications. In addition, the paper reviews existing schemes that have been recently proposed to provide security solutions in wireless healthcare scenarios. Finally, the paper ends up with a summary of open security research issues that need to be explored for future healthcare applications using WMSNs.

Security Issues in Healthcare Applications Using Wireless Medical Sensor Networks: A Survey

PubMed Central

Kumar, Pardeep; Lee, Hoon-Jae

2012-01-01

Healthcare applications are considered as promising fields for wireless sensor networks, where patients can be monitored using wireless medical sensor networks (WMSNs). Current WMSN healthcare research trends focus on patient reliable communication, patient mobility, and energy-efficient routing, as a few examples. However, deploying new technologies in healthcare applications without considering security makes patient privacy vulnerable. Moreover, the physiological data of an individual are highly sensitive. Therefore, security is a paramount requirement of healthcare applications, especially in the case of patient privacy, if the patient has an embarrassing disease. This paper discusses the security and privacy issues in healthcare application using WMSNs. We highlight some popular healthcare projects using wireless medical sensor networks, and discuss their security. Our aim is to instigate discussion on these critical issues since the success of healthcare application depends directly on patient security and privacy, for ethic as well as legal reasons. In addition, we discuss the issues with existing security mechanisms, and sketch out the important security requirements for such applications. In addition, the paper reviews existing schemes that have been recently proposed to provide security solutions in wireless healthcare scenarios. Finally, the paper ends up with a summary of open security research issues that need to be explored for future healthcare applications using WMSNs. PMID:22368458

Robust Analysis of Network-Based Real-Time Kinematic for GNSS-Derived Heights.

PubMed

Bae, Tae-Suk; Grejner-Brzezinska, Dorota; Mader, Gerald; Dennis, Michael

2015-10-26

New guidelines and procedures for real-time (RT) network-based solutions are required in order to support Global Navigation Satellite System (GNSS) derived heights. Two kinds of experiments were carried out to analyze the performance of the network-based real-time kinematic (RTK) solutions. New test marks were installed in different surrounding environments, and the existing GPS benchmarks were used for analyzing the effect of different factors, such as baseline lengths, antenna types, on the final accuracy and reliability of the height estimation. The RT solutions are categorized into three groups: single-base RTK, multiple-epoch network RTK (mRTN), and single-epoch network RTK (sRTN). The RTK solution can be biased up to 9 mm depending on the surrounding environment, but there was no notable bias for a longer reference base station (about 30 km) In addition, the occupation time for the network RTK was investigated in various cases. There is no explicit bias in the solution for different durations, but smoother results were obtained for longer durations. Further investigation is needed into the effect of changing the occupation time between solutions and into the possibility of using single-epoch solutions in precise determination of heights by GNSS.

A graph decomposition-based approach for water distribution network optimization

NASA Astrophysics Data System (ADS)

Zheng, Feifei; Simpson, Angus R.; Zecchin, Aaron C.; Deuerlein, Jochen W.

2013-04-01

A novel optimization approach for water distribution network design is proposed in this paper. Using graph theory algorithms, a full water network is first decomposed into different subnetworks based on the connectivity of the network's components. The original whole network is simplified to a directed augmented tree, in which the subnetworks are substituted by augmented nodes and directed links are created to connect them. Differential evolution (DE) is then employed to optimize each subnetwork based on the sequence specified by the assigned directed links in the augmented tree. Rather than optimizing the original network as a whole, the subnetworks are sequentially optimized by the DE algorithm. A solution choice table is established for each subnetwork (except for the subnetwork that includes a supply node) and the optimal solution of the original whole network is finally obtained by use of the solution choice tables. Furthermore, a preconditioning algorithm is applied to the subnetworks to produce an approximately optimal solution for the original whole network. This solution specifies promising regions for the final optimization algorithm to further optimize the subnetworks. Five water network case studies are used to demonstrate the effectiveness of the proposed optimization method. A standard DE algorithm (SDE) and a genetic algorithm (GA) are applied to each case study without network decomposition to enable a comparison with the proposed method. The results show that the proposed method consistently outperforms the SDE and GA (both with tuned parameters) in terms of both the solution quality and efficiency.

The Reasons and Solutions for Problems in Rural School Consolidation

ERIC Educational Resources Information Center

Qingyang, Guo

2013-01-01

Based on investigations in six midwestern provinces/autonomous regions, Hubei, Henan, Guangxi, Yunnan, Shaanxi, and Inner Mongolia, this article analyzes the reasons for problems in the process of consolidating rural schools and their solutions.

Decentralized session initiation protocol solution in ad hoc networks

NASA Astrophysics Data System (ADS)

Han, Lu; Jin, Zhigang; Shu, Yantai; Dong, Linfang

2006-10-01

With the fast development of ad hoc networks, SIP has attracted more and more attention in multimedia service. This paper proposes a new architecture to provide SIP service for ad hoc users, although there is no centralized SIP server deployed. In this solution, we provide the SIP service by the introduction of two nodes: Designated SIP Server (DS) and its Backup Server (BDS). The nodes of ad hoc network designate DS and BDS when they join the session nodes set and when some pre-defined events occur. A new sip message type called REGISTRAR is presented so nodes can send others REGISTRAR message to declare they want to be DS. According to the IP information taken in the message, an algorithm works like the election of DR and BDR in OSPF protocol is used to vote DS and BDS SIP servers. Naturally, the DS will be replaced by BDS when the DS is down for predicable or unpredictable reasons. To facilitate this, the DS should register to the BDS and transfer a backup of the SIP users' database. Considering the possibility DS or BDS may abruptly go down, a special policy is given. When there is no DS and BDS, a new election procedure is triggered just like the startup phase. The paper also describes how SIP works normally in the decentralized model as well as the evaluation of its performance. All sessions based on SIP in ad hoc such as DS voting have been tested in the real experiments within a 500m*500m square area where about 30 random nodes are placed.

Green wireless body area nanonetworks: energy management and the game of survival.

PubMed

Misra, Sudip; Islam, Nabiul; Mahapatro, Judhistir; Rodrigues, Joel Jose P C

2014-03-01

In this paper, we envisage the architecture of Green Wireless Body Area Nanonetwork (GBAN) as a collection of nanodevices, in which each device is capable of communicating in both the molecular and wireless electromagnetic communication modes. The term green refers to the fact that the nanodevices in such a network can harvest energy from their surrounding environment, so that no nanodevice gets old solely due to the reasons attributed to energy depletion. However, the residual energy of a nanodevice can deplete substantially with the lapse of time, if the rate of energy consumption is not comparable with the rate of energy harvesting. It is observed that the rate of energy harvesting is nonlinear and sporadic in nature. So, the management of energy of the nanodevices is fundamentally important. We specifically address this problem in a ubiquitous healthcare monitoring scenario and formulate it as a cooperative Nash Bargaining game. The optimal strategy obtained from the Nash equilibrium solution provides improved network performance in terms of throughput and delay.

The Unified Lunar Control Network 2005

USGS Publications Warehouse

Archinal, Brent A.; Rosiek, Mark R.; Kirk, Randolph L.; Redding, Bonnie L.

2006-01-01

This report documents a new general unified lunar control network and lunar topographic model based on a combination of Clementine images and a previous network derived from Earth-based & Apollo photographs, and Mariner 10, & Galileo images. This photogrammetric network solution is the largest planetary control network ever completed. It includes the determination of the 3-D positions of 272,931 points on the lunar surface and the correction of the camera angles for 43,866 Clementine images, using 546,126 tie point measurements. The solution RMS is 20 ?m (= 0.9 pixels) in the image plane, with the largest residual of 6.4 pixels. The explanation given here, along with the accompanying files, comprises the release of the network information and of global lunar digital elevation models (DEMs) derived from the network. A paper that will describe the solution and network in further detail will be submitted to a refereed journal, and will include additional background information, solution details, discussion of accuracy and precision, and explanatory figures.

Contrast research of CDMA and GSM network optimization

NASA Astrophysics Data System (ADS)

Wu, Yanwen; Liu, Zehong; Zhou, Guangyue

2004-03-01

With the development of mobile telecommunication network, users of CDMA advanced their request of network service quality. While the operators also change their network management object from signal coverage to performance improvement. In that case, reasonably layout & optimization of mobile telecommunication network, reasonably configuration of network resource, improvement of the service quality, and increase the enterprise's core competition ability, all those have been concerned by the operator companies. This paper firstly looked into the flow of CDMA network optimization. Then it dissertated to some keystones in the CDMA network optimization, like PN code assignment, calculation of soft handover, etc. As GSM is also the similar cellular mobile telecommunication system like CDMA, so this paper also made a contrast research of CDMA and GSM network optimization in details, including the similarity and the different. In conclusion, network optimization is a long time job; it will run through the whole process of network construct. By the adjustment of network hardware (like BTS equipments, RF systems, etc.) and network software (like parameter optimized, configuration optimized, capacity optimized, etc.), network optimization work can improve the performance and service quality of the network.

Security Issues in Cross-Organizational Peer-to-Peer Applications and Some Solutions

NASA Astrophysics Data System (ADS)

Gupta, Ankur; Awasthi, Lalit K.

Peer-to-Peer networks have been widely used for sharing millions of terabytes of content, for large-scale distributed computing and for a variety of other novel applications, due to their scalability and fault-tolerance. However, the scope of P2P networks has somehow been limited to individual computers connected to the internet. P2P networks are also notorious for blatant copyright violations and facilitating several kinds of security attacks. Businesses and large organizations have thus stayed away from deploying P2P applications citing security loopholes in P2P systems as the biggest reason for non-adoption. In theory P2P applications can help fulfill many organizational requirements such as collaboration and joint projects with other organizations, access to specialized computing infrastructure and finally accessing the specialized information/content and expert human knowledge available at other organizations. These potentially beneficial interactions necessitate that the research community attempt to alleviate the security shortcomings in P2P systems and ensure their acceptance and wide deployment. This research paper therefore examines the security issues prevalent in enabling cross-organizational P2P interactions and provides some technical insights into how some of these issues can be resolved.

Comparison of stationary and oscillatory dynamics described by differential equations and Boolean maps in transcriptional regulatory circuits

NASA Astrophysics Data System (ADS)

Ye, Weiming; Li, Pengfei; Huang, Xuhui; Xia, Qinzhi; Mi, Yuanyuan; Chen, Runsheng; Hu, Gang

2010-10-01

Exploring the principle and relationship of gene transcriptional regulations (TR) has been becoming a generally researched issue. So far, two major mathematical methods, ordinary differential equation (ODE) method and Boolean map (BM) method have been widely used for these purposes. It is commonly believed that simplified BMs are reasonable approximations of more realistic ODEs, and both methods may reveal qualitatively the same essential features though the dynamical details of both systems may show some differences. In this Letter we exhaustively enumerated all the 3-gene networks and many autonomous randomly constructed TR networks with more genes by using both the ODE and BM methods. In comparison we found that both methods provide practically identical results in most of cases of steady solutions. However, to our great surprise, most of network structures showing periodic cycles with the BM method possess only stationary states in ODE descriptions. These observations strongly suggest that many periodic oscillations and other complicated oscillatory states revealed by the BM rule may be related to the computational errors of variable and time discretizations and rarely have correspondence in realistic biology transcriptional regulatory circuits.

Resting state morphology predicts the effect of theta burst stimulation in false belief reasoning.

PubMed

Hartwright, Charlotte E; Hardwick, Robert M; Apperly, Ian A; Hansen, Peter C

2016-10-01

When required to represent a perspective that conflicts with one's own, functional magnetic resonance imaging (fMRI) suggests that the right ventrolateral prefrontal cortex (rvlPFC) supports the inhibition of that conflicting self-perspective. The present task dissociated inhibition of self-perspective from other executive control processes by contrasting belief reasoning-a cognitive state where the presence of conflicting perspectives was manipulated-with a conative desire state wherein no systematic conflict existed. Linear modeling was used to examine the effect of continuous theta burst stimulation (cTBS) to rvlPFC on participants' reaction times in belief and desire reasoning. It was anticipated that cTBS applied to rvlPFC would affect belief but not desire reasoning, by modulating activity in the Ventral Attention System (VAS). We further anticipated that this effect would be mediated by functional connectivity within this network, which was identified using resting state fMRI and an unbiased model-free approach. Simple reaction-time analysis failed to detect an effect of cTBS. However, by additionally modeling individual measures from within the stimulated network, the hypothesized effect of cTBS to belief (but, importantly, not desire) reasoning was demonstrated. Structural morphology within the stimulated region, rvlPFC, and right temporoparietal junction were demonstrated to underlie this effect. These data provide evidence that inconsistencies found with cTBS can be mediated by the composition of the functional network that is being stimulated. We suggest that the common claim that this network constitutes the VAS explains the effect of cTBS to this network on false belief reasoning. Hum Brain Mapp 37:3502-3514, 2016. © 2016 Wiley Periodicals, Inc. © 2016 Wiley Periodicals, Inc.

Existence and global exponential stability of periodic solution of memristor-based BAM neural networks with time-varying delays.

PubMed

Li, Hongfei; Jiang, Haijun; Hu, Cheng

2016-03-01

In this paper, we investigate a class of memristor-based BAM neural networks with time-varying delays. Under the framework of Filippov solutions, boundedness and ultimate boundedness of solutions of memristor-based BAM neural networks are guaranteed by Chain rule and inequalities technique. Moreover, a new method involving Yoshizawa-like theorem is favorably employed to acquire the existence of periodic solution. By applying the theory of set-valued maps and functional differential inclusions, an available Lyapunov functional and some new testable algebraic criteria are derived for ensuring the uniqueness and global exponential stability of periodic solution of memristor-based BAM neural networks. The obtained results expand and complement some previous work on memristor-based BAM neural networks. Finally, a numerical example is provided to show the applicability and effectiveness of our theoretical results. Copyright © 2015 Elsevier Ltd. All rights reserved.

The effect of explanations on mathematical reasoning tasks

NASA Astrophysics Data System (ADS)

Norqvist, Mathias

2018-01-01

Studies in mathematics education often point to the necessity for students to engage in more cognitively demanding activities than just solving tasks by applying given solution methods. Previous studies have shown that students that engage in creative mathematically founded reasoning to construct a solution method, perform significantly better in follow up tests than students that are given a solution method and engage in algorithmic reasoning. However, teachers and textbooks, at least occasionally, provide explanations together with an algorithmic method, and this could possibly be more efficient than creative reasoning. In this study, three matched groups practiced with either creative, algorithmic, or explained algorithmic tasks. The main finding was that students that practiced with creative tasks did, outperform the students that practiced with explained algorithmic tasks in a post-test, despite a much lower practice score. The two groups that got a solution method presented, performed similarly in both practice and post-test, even though one group got an explanation to the given solution method. Additionally, there were some differences between the groups in which variables predicted the post-test score.

Implementations of back propagation algorithm in ecosystems applications

NASA Astrophysics Data System (ADS)

Ali, Khalda F.; Sulaiman, Riza; Elamir, Amir Mohamed

2015-05-01

Artificial Neural Networks (ANNs) have been applied to an increasing number of real world problems of considerable complexity. Their most important advantage is in solving problems which are too complex for conventional technologies, that do not have an algorithmic solutions or their algorithmic Solutions is too complex to be found. In general, because of their abstraction from the biological brain, ANNs are developed from concept that evolved in the late twentieth century neuro-physiological experiments on the cells of the human brain to overcome the perceived inadequacies with conventional ecological data analysis methods. ANNs have gained increasing attention in ecosystems applications, because of ANN's capacity to detect patterns in data through non-linear relationships, this characteristic confers them a superior predictive ability. In this research, ANNs is applied in an ecological system analysis. The neural networks use the well known Back Propagation (BP) Algorithm with the Delta Rule for adaptation of the system. The Back Propagation (BP) training Algorithm is an effective analytical method for adaptation of the ecosystems applications, the main reason because of their capacity to detect patterns in data through non-linear relationships. This characteristic confers them a superior predicting ability. The BP algorithm uses supervised learning, which means that we provide the algorithm with examples of the inputs and outputs we want the network to compute, and then the error is calculated. The idea of the back propagation algorithm is to reduce this error, until the ANNs learns the training data. The training begins with random weights, and the goal is to adjust them so that the error will be minimal. This research evaluated the use of artificial neural networks (ANNs) techniques in an ecological system analysis and modeling. The experimental results from this research demonstrate that an artificial neural network system can be trained to act as an expert ecosystem analyzer for many applications in ecological fields. The pilot ecosystem analyzer shows promising ability for generalization and requires further tuning and refinement of the basis neural network system for optimal performance.

Chance of Vulnerability Reduction in Application-Specific NoC through Distance Aware Mapping Algorithm

NASA Astrophysics Data System (ADS)

Janidarmian, Majid; Fekr, Atena Roshan; Bokharaei, Vahhab Samadi

2011-08-01

Mapping algorithm which means which core should be linked to which router is one of the key issues in the design flow of network-on-chip. To achieve an application-specific NoC design procedure that minimizes the communication cost and improves the fault tolerant property, first a heuristic mapping algorithm that produces a set of different mappings in a reasonable time is presented. This algorithm allows the designers to identify the set of most promising solutions in a large design space, which has low communication costs while yielding optimum communication costs in some cases. Another evaluated parameter, vulnerability index, is then considered as a principle of estimating the fault-tolerance property in all produced mappings. Finally, in order to yield a mapping which considers trade-offs between these two parameters, a linear function is defined and introduced. It is also observed that more flexibility to prioritize solutions within the design space is possible by adjusting a set of if-then rules in fuzzy logic.

Enhancing robustness of interdependent network by adding connectivity and dependence links

NASA Astrophysics Data System (ADS)

Cui, Pengshuai; Zhu, Peidong; Wang, Ke; Xun, Peng; Xia, Zhuoqun

2018-05-01

Enhancing robustness of interdependent networks by adding connectivity links has been researched extensively, however, few of them are focusing on adding both connectivity and dependence links to enhance robustness. In this paper, we aim to study how to allocate the limited costs reasonably to add both connectivity and dependence links. Firstly, we divide the attackers into stubborn attackers and smart attackers according to whether would they change their attack modes with the changing of network structure; Then by simulations, link addition strategies are given separately according to different attackers, with which we can allocate the limited costs to add connectivity links and dependence links reasonably and achieve more robustness than only adding connectivity links or dependence links. The results show that compared to only adding connectivity links or dependence links, allocating the limited resources reasonably and adding both connectivity links and dependence links could bring more robustness to the interdependent networks.

Integrating legacy medical data sensors in a wireless network infrastucture.

PubMed

Dembeyiotis, S; Konnis, G; Koutsouris, D

2005-01-01

In the process of developing a wireless networking solution to provide effective field-deployable communications and telemetry support for rescuers during major natural disasters, we are faced with the task of interfacing the multitude of medical and other legacy data collection sensors to the network grid. In this paper, we detail a number of solutions, with particular attention given to the issue of data security. The chosen implementation allows for sensor control and management from remote network locations, while the sensors can wirelessly transmit their data to nearby network nodes securely, utilizing the latest commercially available cryptography solutions. Initial testing validates the design choices, while the network-enabled sensors are being integrated in the overall wireless network security framework.

76 FR 25310 - Notice of Intent To Grant a Partially Exclusive Patent License to videoNEXT Network Solutions, Inc.

Federal Register 2010, 2011, 2012, 2013, 2014

2011-05-04

... DEPARTMENT OF DEFENSE Department of the Army Notice of Intent To Grant a Partially Exclusive Patent License to videoNEXT Network Solutions, Inc. AGENCY: Department of the Army, DoD. ACTION: Notice... notice of its intent to grant to videoNEXT Network Solutions, Inc., a corporation having its principle...

Exponential Stability of Almost Periodic Solutions for Memristor-Based Neural Networks with Distributed Leakage Delays.

PubMed

Xu, Changjin; Li, Peiluan; Pang, Yicheng

2016-12-01

In this letter, we deal with a class of memristor-based neural networks with distributed leakage delays. By applying a new Lyapunov function method, we obtain some sufficient conditions that ensure the existence, uniqueness, and global exponential stability of almost periodic solutions of neural networks. We apply the results of this solution to prove the existence and stability of periodic solutions for this delayed neural network with periodic coefficients. We then provide an example to illustrate the effectiveness of the theoretical results. Our results are completely new and complement the previous studies Chen, Zeng, and Jiang ( 2014 ) and Jiang, Zeng, and Chen ( 2015 ).

Optimization of multicast optical networks with genetic algorithm

NASA Astrophysics Data System (ADS)

Lv, Bo; Mao, Xiangqiao; Zhang, Feng; Qin, Xi; Lu, Dan; Chen, Ming; Chen, Yong; Cao, Jihong; Jian, Shuisheng

2007-11-01

In this letter, aiming to obtain the best multicast performance of optical network in which the video conference information is carried by specified wavelength, we extend the solutions of matrix games with the network coding theory and devise a new method to solve the complex problems of multicast network switching. In addition, an experimental optical network has been testified with best switching strategies by employing the novel numerical solution designed with an effective way of genetic algorithm. The result shows that optimal solutions with genetic algorithm are accordance with the ones with the traditional fictitious play method.

Analytical reasoning task reveals limits of social learning in networks

PubMed Central

Rahwan, Iyad; Krasnoshtan, Dmytro; Shariff, Azim; Bonnefon, Jean-François

2014-01-01

Social learning—by observing and copying others—is a highly successful cultural mechanism for adaptation, outperforming individual information acquisition and experience. Here, we investigate social learning in the context of the uniquely human capacity for reflective, analytical reasoning. A hallmark of the human mind is its ability to engage analytical reasoning, and suppress false associative intuitions. Through a set of laboratory-based network experiments, we find that social learning fails to propagate this cognitive strategy. When people make false intuitive conclusions and are exposed to the analytic output of their peers, they recognize and adopt this correct output. But they fail to engage analytical reasoning in similar subsequent tasks. Thus, humans exhibit an ‘unreflective copying bias’, which limits their social learning to the output, rather than the process, of their peers’ reasoning—even when doing so requires minimal effort and no technical skill. In contrast to much recent work on observation-based social learning, which emphasizes the propagation of successful behaviour through copying, our findings identify a limit on the power of social networks in situations that require analytical reasoning. PMID:24501275

Network Terminations: A Compilation of Possible Answers.

ERIC Educational Resources Information Center

Wilson, John S.

An examination of 20 library network terminations reveals five major reasons for termination: lack of adequate funding, absorption by larger networks, loosely structured governance, partial termination of services, and networks programmed for short durations. Two tables present survey data. (RAA)

Case Study on Optimal Routing in Logistics Network by Priority-based Genetic Algorithm

NASA Astrophysics Data System (ADS)

Wang, Xiaoguang; Lin, Lin; Gen, Mitsuo; Shiota, Mitsushige

Recently, research on logistics caught more and more attention. One of the important issues on logistics system is to find optimal delivery routes with the least cost for products delivery. Numerous models have been developed for that reason. However, due to the diversity and complexity of practical problem, the existing models are usually not very satisfying to find the solution efficiently and convinently. In this paper, we treat a real-world logistics case with a company named ABC Co. ltd., in Kitakyusyu Japan. Firstly, based on the natures of this conveyance routing problem, as an extension of transportation problem (TP) and fixed charge transportation problem (fcTP) we formulate the problem as a minimum cost flow (MCF) model. Due to the complexity of fcTP, we proposed a priority-based genetic algorithm (pGA) approach to find the most acceptable solution to this problem. In this pGA approach, a two-stage path decoding method is adopted to develop delivery paths from a chromosome. We also apply the pGA approach to this problem, and compare our results with the current logistics network situation, and calculate the improvement of logistics cost to help the management to make decisions. Finally, in order to check the effectiveness of the proposed method, the results acquired are compared with those come from the two methods/ software, such as LINDO and CPLEX.

Towards reasoning and coordinating action in the mental space.

PubMed

Mohan, Vishwanathan; Morasso, Pietro

2007-08-01

Unlike a purely reactive system where the motor output is exclusively controlled by the actual sensory input, a cognitive system must be capable of running mental processes which virtually simulate action sequences aimed at achieving a goal. The mental process either attempts to find a feasible course of action compatible with a number of constraints (Internal, Environmental, Task Specific etc) or selects it from a repertoire of previously learned actions, according to the parameters of the task. If neither reasoning process succeeds, a typical backup strategy is to look for a tool that might allow the operator to match all the task constraints. This further necessitates having the capability to alter ones own goal structures to generate sub-goals which must be successfully accomplished in order to achieve the primary goal. In this paper, we introduce a forward/inverse motor control architecture (FMC/IMC) that relaxes an internal model of the overall kinematic chain to a virtual force field applied to the end effector, in the intended direction of movement. This is analogous to the mechanism of coordinating the motion of a wooden marionette by means of attached strings. The relaxation of the FMC/IMC pair provides a general solution for mentally simulating an action of reaching a target position taking into consideration a range of geometric constraints (range of motion in the joint space, internal and external constraints in the workspace) as well as effort-related constraints (range of torque of the actuators, etc.). In case, the forward simulation is successful, the movement is executed; otherwise the residual "error" or measure of inconsistency is taken as a starting point for breaking the action plan into a sequence of sub actions. This process is achieved using a recurrent neural network (RNN) which coordinates the overall reasoning process of framing and issuing goals to the forward inverse models, searching for alternatives tools in solution space and formation of sub-goals based on past context knowledge and present inputs. The RNN + FMC/IMC system is able to successfully reason and coordinate a diverse range of reaching and grasping sequences with/without tools. Using a simple robotic platform (5 DOF Scorbot arm + Stereo vision) we present results of reasoning and coordination of arm/tool movements (real and mental simulation) specifically directed towards solving the classical 2-stick paradigm from animal reasoning at a non linguistic level.

GraphStore: A Distributed Graph Storage System for Big Data Networks

ERIC Educational Resources Information Center

Martha, VenkataSwamy

2013-01-01

Networks, such as social networks, are a universal solution for modeling complex problems in real time, especially in the Big Data community. While previous studies have attempted to enhance network processing algorithms, none have paved a path for the development of a persistent storage system. The proposed solution, GraphStore, provides an…

Neural networks and logical reasoning systems: a translation table.

PubMed

Martins, J; Mendes, R V

2001-04-01

A correspondence is established between the basic elements of logic reasoning systems (knowledge bases, rules, inference and queries) and the structure and dynamical evolution laws of neural networks. The correspondence is pictured as a translation dictionary which might allow to go back and forth between symbolic and network formulations, a desirable step in learning-oriented systems and multicomputer networks. In the framework of Horn clause logics, it is found that atomic propositions with n arguments correspond to nodes with nth order synapses, rules to synaptic intensity constraints, forward chaining to synaptic dynamics and queries either to simple node activation or to a query tensor dynamics.

OWL reasoning framework over big biological knowledge network.

PubMed

Chen, Huajun; Chen, Xi; Gu, Peiqin; Wu, Zhaohui; Yu, Tong

2014-01-01

Recently, huge amounts of data are generated in the domain of biology. Embedded with domain knowledge from different disciplines, the isolated biological resources are implicitly connected. Thus it has shaped a big network of versatile biological knowledge. Faced with such massive, disparate, and interlinked biological data, providing an efficient way to model, integrate, and analyze the big biological network becomes a challenge. In this paper, we present a general OWL (web ontology language) reasoning framework to study the implicit relationships among biological entities. A comprehensive biological ontology across traditional Chinese medicine (TCM) and western medicine (WM) is used to create a conceptual model for the biological network. Then corresponding biological data is integrated into a biological knowledge network as the data model. Based on the conceptual model and data model, a scalable OWL reasoning method is utilized to infer the potential associations between biological entities from the biological network. In our experiment, we focus on the association discovery between TCM and WM. The derived associations are quite useful for biologists to promote the development of novel drugs and TCM modernization. The experimental results show that the system achieves high efficiency, accuracy, scalability, and effectivity.

OWL Reasoning Framework over Big Biological Knowledge Network

PubMed Central

Chen, Huajun; Chen, Xi; Gu, Peiqin; Wu, Zhaohui; Yu, Tong

2014-01-01

Recently, huge amounts of data are generated in the domain of biology. Embedded with domain knowledge from different disciplines, the isolated biological resources are implicitly connected. Thus it has shaped a big network of versatile biological knowledge. Faced with such massive, disparate, and interlinked biological data, providing an efficient way to model, integrate, and analyze the big biological network becomes a challenge. In this paper, we present a general OWL (web ontology language) reasoning framework to study the implicit relationships among biological entities. A comprehensive biological ontology across traditional Chinese medicine (TCM) and western medicine (WM) is used to create a conceptual model for the biological network. Then corresponding biological data is integrated into a biological knowledge network as the data model. Based on the conceptual model and data model, a scalable OWL reasoning method is utilized to infer the potential associations between biological entities from the biological network. In our experiment, we focus on the association discovery between TCM and WM. The derived associations are quite useful for biologists to promote the development of novel drugs and TCM modernization. The experimental results show that the system achieves high efficiency, accuracy, scalability, and effectivity. PMID:24877076

Evidence reasoning method for constructing conditional probability tables in a Bayesian network of multimorbidity.

PubMed

Du, Yuanwei; Guo, Yubin

2015-01-01

The intrinsic mechanism of multimorbidity is difficult to recognize and prediction and diagnosis are difficult to carry out accordingly. Bayesian networks can help to diagnose multimorbidity in health care, but it is difficult to obtain the conditional probability table (CPT) because of the lack of clinically statistical data. Today, expert knowledge and experience are increasingly used in training Bayesian networks in order to help predict or diagnose diseases, but the CPT in Bayesian networks is usually irrational or ineffective for ignoring realistic constraints especially in multimorbidity. In order to solve these problems, an evidence reasoning (ER) approach is employed to extract and fuse inference data from experts using a belief distribution and recursive ER algorithm, based on which evidence reasoning method for constructing conditional probability tables in Bayesian network of multimorbidity is presented step by step. A multimorbidity numerical example is used to demonstrate the method and prove its feasibility and application. Bayesian network can be determined as long as the inference assessment is inferred by each expert according to his/her knowledge or experience. Our method is more effective than existing methods for extracting expert inference data accurately and is fused effectively for constructing CPTs in a Bayesian network of multimorbidity.

Security and Dependability Solutions for Networks and Devices

NASA Astrophysics Data System (ADS)

Gücrgens, Sigrid; Fuchs, Andreas

In this chapter we give an overview over the denotation of the SERENITY artefacts S&D Classes, Patterns and Implementations in the context of networks and devices. In order to demonstrate their necessity we sketch an example for confidential and authentic communication and storage that utilizes a trusted platform module, and model the relevant pattern. We then dissociate solutions for network and device related S&D requirements from those targeting the context of organizational or workflow and web services based solutions. Then we give a summary of the broad field of application for network and device solutions. Finally we clarify the meaning and interaction between classes, patterns and implementations by giving some concrete examples.

Cross-Domain Analogies as Relating Derived Relations among Two Separate Relational Networks

PubMed Central

Ruiz, Francisco J; Luciano, Carmen

2011-01-01

Contemporary behavior analytic research is making headway in analyzing analogy as the establishment of a relation of coordination among common types of trained or derived relations. Previous studies have been focused on within-domain analogy. The current study expands previous research by analyzing cross-domain analogy as relating relations among separate relational networks and by correlating participants' performance with a standard measure of analogical reasoning. In two experiments, adult participants first completed general intelligence and analogical reasoning tests. Subsequently, they were exposed to a computerized conditional discrimination training procedure designed to create two relational networks, each consisting of two 3-member equivalence classes. The critical test was a two-part analogical test in which participants had to relate combinatorial relations of coordination and distinction between the two relational networks. In Experiment 1, combinatorial relations for each network were individually tested prior to analogical testing, but in Experiment 2 they were not. Across both experiments, 65% of participants passed the analogical test on the first attempt. Moreover, results from the training procedure were strongly correlated with the standard measure of analogical reasoning. PMID:21547072

Incorporating Resilience into Dynamic Social Models

DTIC Science & Technology

2016-07-20

solved by simply using the information provided by the scenario. Instead, additional knowledge is required from relevant fields that study these...resilience function by leveraging Bayesian Knowledge Bases (BKBs), a probabilistic reasoning network framework[5],[6]. BKBs allow for inferencing...reasoning network framework based on Bayesian Knowledge Bases (BKBs). BKBs are central to our social resilience framework as they are used to

Special Libraries and Multitype Networks.

ERIC Educational Resources Information Center

Segal, JoAn S.

1989-01-01

Describes the history of multitype library networks; examines the reasons why special libraries and other network participants have resisted the inclusion of special libraries in these networks; and discusses the benefits to both special libraries and to other libraries in the network that would result from special library participation. (17…

Application of artifical intelligence principles to the analysis of "crazy" speech.

PubMed

Garfield, D A; Rapp, C

1994-04-01

Artificial intelligence computer simulation methods can be used to investigate psychotic or "crazy" speech. Here, symbolic reasoning algorithms establish semantic networks that schematize speech. These semantic networks consist of two main structures: case frames and object taxonomies. Node-based reasoning rules apply to object taxonomies and pathway-based reasoning rules apply to case frames. Normal listeners may recognize speech as "crazy talk" based on violations of node- and pathway-based reasoning rules. In this article, three separate segments of schizophrenic speech illustrate violations of these rules. This artificial intelligence approach is compared and contrasted with other neurolinguistic approaches and is discussed as a conceptual link between neurobiological and psychodynamic understandings of psychopathology.

Evidential reasoning research on intrusion detection

NASA Astrophysics Data System (ADS)

Wang, Xianpei; Xu, Hua; Zheng, Sheng; Cheng, Anyu

2003-09-01

In this paper, we mainly aim at D-S theory of evidence and the network intrusion detection these two fields. It discusses the method how to apply this probable reasoning as an AI technology to the Intrusion Detection System (IDS). This paper establishes the application model, describes the new mechanism of reasoning and decision-making and analyses how to implement the model based on the synscan activities detection on the network. The results suggest that if only rational probability values were assigned at the beginning, the engine can, according to the rules of evidence combination and hierarchical reasoning, compute the values of belief and finally inform the administrators of the qualities of the traced activities -- intrusions, normal activities or abnormal activities.

Final Report - Cloud-Based Management Platform for Distributed, Multi-Domain Networks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chowdhury, Pulak; Mukherjee, Biswanath

2017-11-03

In this Department of Energy (DOE) Small Business Innovation Research (SBIR) Phase II project final report, Ennetix presents the development of a solution for end-to-end monitoring, analysis, and visualization of network performance for distributed networks. This solution benefits enterprises of all sizes, operators of distributed and federated networks, and service providers.

Enabling Controlling Complex Networks with Local Topological Information.

PubMed

Li, Guoqi; Deng, Lei; Xiao, Gaoxi; Tang, Pei; Wen, Changyun; Hu, Wuhua; Pei, Jing; Shi, Luping; Stanley, H Eugene

2018-03-15

Complex networks characterize the nature of internal/external interactions in real-world systems including social, economic, biological, ecological, and technological networks. Two issues keep as obstacles to fulfilling control of large-scale networks: structural controllability which describes the ability to guide a dynamical system from any initial state to any desired final state in finite time, with a suitable choice of inputs; and optimal control, which is a typical control approach to minimize the cost for driving the network to a predefined state with a given number of control inputs. For large complex networks without global information of network topology, both problems remain essentially open. Here we combine graph theory and control theory for tackling the two problems in one go, using only local network topology information. For the structural controllability problem, a distributed local-game matching method is proposed, where every node plays a simple Bayesian game with local information and local interactions with adjacent nodes, ensuring a suboptimal solution at a linear complexity. Starring from any structural controllability solution, a minimizing longest control path method can efficiently reach a good solution for the optimal control in large networks. Our results provide solutions for distributed complex network control and demonstrate a way to link the structural controllability and optimal control together.

Generating Researcher Networks with Identified Persons on a Semantic Service Platform

NASA Astrophysics Data System (ADS)

Jung, Hanmin; Lee, Mikyoung; Kim, Pyung; Lee, Seungwoo

This paper describes a Semantic Web-based method to acquire researcher networks by means of identification scheme, ontology, and reasoning. Three steps are required to realize it; resolving co-references, finding experts, and generating researcher networks. We adopt OntoFrame as an underlying semantic service platform and apply reasoning to make direct relations between far-off classes in ontology schema. 453,124 Elsevier journal articles with metadata and full-text documents in information technology and biomedical domains have been loaded and served on the platform as a test set.

The Effect of Explanations on Mathematical Reasoning Tasks

ERIC Educational Resources Information Center

Norqvist, Mathias

2018-01-01

Studies in mathematics education often point to the necessity for students to engage in more cognitively demanding activities than just solving tasks by applying given solution methods. Previous studies have shown that students that engage in creative mathematically founded reasoning to construct a solution method, perform significantly better in…

Communicative versus strategic rationality: Habermas theory of communicative action and the social brain.

PubMed

Schaefer, Michael; Heinze, Hans-Jochen; Rotte, Michael; Denke, Claudia

2013-01-01

In the philosophical theory of communicative action, rationality refers to interpersonal communication rather than to a knowing subject. Thus, a social view of rationality is suggested. The theory differentiates between two kinds of rationality, the emancipative communicative and the strategic or instrumental reasoning. Using experimental designs in an fMRI setting, recent studies explored similar questions of reasoning in the social world and linked them with a neural network including prefrontal and parietal brain regions. Here, we employed an fMRI approach to highlight brain areas associated with strategic and communicative reasoning according to the theory of communicative action. Participants were asked to assess different social scenarios with respect to communicative or strategic rationality. We found a network of brain areas including temporal pole, precuneus, and STS more activated when participants performed communicative reasoning compared with strategic thinking and a control condition. These brain regions have been previously linked to moral sensitivity. In contrast, strategic rationality compared with communicative reasoning and control was associated with less activation in areas known to be related to moral sensitivity, emotional processing, and language control. The results suggest that strategic reasoning is associated with reduced social and emotional cognitions and may use different language related networks. Thus, the results demonstrate experimental support for the assumptions of the theory of communicative action.

Active transport on disordered microtubule networks: the generalized random velocity model.

PubMed

Kahana, Aviv; Kenan, Gilad; Feingold, Mario; Elbaum, Michael; Granek, Rony

2008-11-01

The motion of small cargo particles on microtubules by means of motor proteins in disordered microtubule networks is investigated theoretically using both analytical tools and computer simulations. Different network topologies in two and three dimensions are considered, one of which has been recently studied experimentally by Salman [Biophys. J. 89, 2134 (2005)]. A generalization of the random velocity model is used to derive the mean-square displacement of the cargo particle. We find that all cases belong to the class of anomalous superdiffusion, which is sensitive mainly to the dimensionality of the network and only marginally to its topology. Yet in three dimensions the motion is very close to simple diffusion, with sublogarithmic corrections that depend on the network topology. When details of the thermal diffusion in the bulk solution are included, no significant change to the asymptotic time behavior is found. However, a small asymmetry in the mean microtubule polarity affects the corresponding long-time behavior. We also study a three-dimensional model of the microtubule network in living animal cells. Three first-passage-time problems of intracellular transport are simulated and analyzed for different motor processivities: (i) cargo that originates near the nucleus and has to reach the membrane, (ii) cargo that originates from the membrane and has to reach the nucleus, and (iii) cargo that leaves the nucleus and has to reach a specific target in the cytoplasm. We conclude that while a higher motor processivity increases the transport efficiency in cases (i) and (ii), in case (iii) it has the opposite effect. We conjecture that the balance between the different network tasks, as manifested in cases (i) and (ii) versus case (iii), may be the reason for the evolutionary choice of a finite motor processivity.

Active transport on disordered microtubule networks: The generalized random velocity model

NASA Astrophysics Data System (ADS)

Kahana, Aviv; Kenan, Gilad; Feingold, Mario; Elbaum, Michael; Granek, Rony

2008-11-01

The motion of small cargo particles on microtubules by means of motor proteins in disordered microtubule networks is investigated theoretically using both analytical tools and computer simulations. Different network topologies in two and three dimensions are considered, one of which has been recently studied experimentally by Salman [Biophys. J. 89, 2134 (2005)]. A generalization of the random velocity model is used to derive the mean-square displacement of the cargo particle. We find that all cases belong to the class of anomalous superdiffusion, which is sensitive mainly to the dimensionality of the network and only marginally to its topology. Yet in three dimensions the motion is very close to simple diffusion, with sublogarithmic corrections that depend on the network topology. When details of the thermal diffusion in the bulk solution are included, no significant change to the asymptotic time behavior is found. However, a small asymmetry in the mean microtubule polarity affects the corresponding long-time behavior. We also study a three-dimensional model of the microtubule network in living animal cells. Three first-passage-time problems of intracellular transport are simulated and analyzed for different motor processivities: (i) cargo that originates near the nucleus and has to reach the membrane, (ii) cargo that originates from the membrane and has to reach the nucleus, and (iii) cargo that leaves the nucleus and has to reach a specific target in the cytoplasm. We conclude that while a higher motor processivity increases the transport efficiency in cases (i) and (ii), in case (iii) it has the opposite effect. We conjecture that the balance between the different network tasks, as manifested in cases (i) and (ii) versus case (iii), may be the reason for the evolutionary choice of a finite motor processivity.

Supervised Learning in Spiking Neural Networks for Precise Temporal Encoding

PubMed Central

Gardner, Brian; Grüning, André

2016-01-01

Precise spike timing as a means to encode information in neural networks is biologically supported, and is advantageous over frequency-based codes by processing input features on a much shorter time-scale. For these reasons, much recent attention has been focused on the development of supervised learning rules for spiking neural networks that utilise a temporal coding scheme. However, despite significant progress in this area, there still lack rules that have a theoretical basis, and yet can be considered biologically relevant. Here we examine the general conditions under which synaptic plasticity most effectively takes place to support the supervised learning of a precise temporal code. As part of our analysis we examine two spike-based learning methods: one of which relies on an instantaneous error signal to modify synaptic weights in a network (INST rule), and the other one relying on a filtered error signal for smoother synaptic weight modifications (FILT rule). We test the accuracy of the solutions provided by each rule with respect to their temporal encoding precision, and then measure the maximum number of input patterns they can learn to memorise using the precise timings of individual spikes as an indication of their storage capacity. Our results demonstrate the high performance of the FILT rule in most cases, underpinned by the rule’s error-filtering mechanism, which is predicted to provide smooth convergence towards a desired solution during learning. We also find the FILT rule to be most efficient at performing input pattern memorisations, and most noticeably when patterns are identified using spikes with sub-millisecond temporal precision. In comparison with existing work, we determine the performance of the FILT rule to be consistent with that of the highly efficient E-learning Chronotron rule, but with the distinct advantage that our FILT rule is also implementable as an online method for increased biological realism. PMID:27532262

Supervised Learning in Spiking Neural Networks for Precise Temporal Encoding.

PubMed

Gardner, Brian; Grüning, André

2016-01-01

Precise spike timing as a means to encode information in neural networks is biologically supported, and is advantageous over frequency-based codes by processing input features on a much shorter time-scale. For these reasons, much recent attention has been focused on the development of supervised learning rules for spiking neural networks that utilise a temporal coding scheme. However, despite significant progress in this area, there still lack rules that have a theoretical basis, and yet can be considered biologically relevant. Here we examine the general conditions under which synaptic plasticity most effectively takes place to support the supervised learning of a precise temporal code. As part of our analysis we examine two spike-based learning methods: one of which relies on an instantaneous error signal to modify synaptic weights in a network (INST rule), and the other one relying on a filtered error signal for smoother synaptic weight modifications (FILT rule). We test the accuracy of the solutions provided by each rule with respect to their temporal encoding precision, and then measure the maximum number of input patterns they can learn to memorise using the precise timings of individual spikes as an indication of their storage capacity. Our results demonstrate the high performance of the FILT rule in most cases, underpinned by the rule's error-filtering mechanism, which is predicted to provide smooth convergence towards a desired solution during learning. We also find the FILT rule to be most efficient at performing input pattern memorisations, and most noticeably when patterns are identified using spikes with sub-millisecond temporal precision. In comparison with existing work, we determine the performance of the FILT rule to be consistent with that of the highly efficient E-learning Chronotron rule, but with the distinct advantage that our FILT rule is also implementable as an online method for increased biological realism.

Constraint satisfaction adaptive neural network and heuristics combined approaches for generalized job-shop scheduling.

PubMed

Yang, S; Wang, D

2000-01-01

This paper presents a constraint satisfaction adaptive neural network, together with several heuristics, to solve the generalized job-shop scheduling problem, one of NP-complete constraint satisfaction problems. The proposed neural network can be easily constructed and can adaptively adjust its weights of connections and biases of units based on the sequence and resource constraints of the job-shop scheduling problem during its processing. Several heuristics that can be combined with the neural network are also presented. In the combined approaches, the neural network is used to obtain feasible solutions, the heuristic algorithms are used to improve the performance of the neural network and the quality of the obtained solutions. Simulations have shown that the proposed neural network and its combined approaches are efficient with respect to the quality of solutions and the solving speed.

Breeding novel solutions in the brain: a model of Darwinian neurodynamics.

PubMed

Szilágyi, András; Zachar, István; Fedor, Anna; de Vladar, Harold P; Szathmáry, Eörs

2016-01-01

Background : The fact that surplus connections and neurons are pruned during development is well established. We complement this selectionist picture by a proof-of-principle model of evolutionary search in the brain, that accounts for new variations in theory space. We present a model for Darwinian evolutionary search for candidate solutions in the brain. Methods : We combine known components of the brain - recurrent neural networks (acting as attractors), the action selection loop and implicit working memory - to provide the appropriate Darwinian architecture. We employ a population of attractor networks with palimpsest memory. The action selection loop is employed with winners-share-all dynamics to select for candidate solutions that are transiently stored in implicit working memory. Results : We document two processes: selection of stored solutions and evolutionary search for novel solutions. During the replication of candidate solutions attractor networks occasionally produce recombinant patterns, increasing variation on which selection can act. Combinatorial search acts on multiplying units (activity patterns) with hereditary variation and novel variants appear due to (i) noisy recall of patterns from the attractor networks, (ii) noise during transmission of candidate solutions as messages between networks, and, (iii) spontaneously generated, untrained patterns in spurious attractors. Conclusions : Attractor dynamics of recurrent neural networks can be used to model Darwinian search. The proposed architecture can be used for fast search among stored solutions (by selection) and for evolutionary search when novel candidate solutions are generated in successive iterations. Since all the suggested components are present in advanced nervous systems, we hypothesize that the brain could implement a truly evolutionary combinatorial search system, capable of generating novel variants.

Neural network for nonsmooth pseudoconvex optimization with general convex constraints.

PubMed

Bian, Wei; Ma, Litao; Qin, Sitian; Xue, Xiaoping

2018-05-01

In this paper, a one-layer recurrent neural network is proposed for solving a class of nonsmooth, pseudoconvex optimization problems with general convex constraints. Based on the smoothing method, we construct a new regularization function, which does not depend on any information of the feasible region. Thanks to the special structure of the regularization function, we prove the global existence, uniqueness and "slow solution" character of the state of the proposed neural network. Moreover, the state solution of the proposed network is proved to be convergent to the feasible region in finite time and to the optimal solution set of the related optimization problem subsequently. In particular, the convergence of the state to an exact optimal solution is also considered in this paper. Numerical examples with simulation results are given to show the efficiency and good characteristics of the proposed network. In addition, some preliminary theoretical analysis and application of the proposed network for a wider class of dynamic portfolio optimization are included. Copyright © 2018 Elsevier Ltd. All rights reserved.

Lightweight CoAP-Based Bootstrapping Service for the Internet of Things.

PubMed

Garcia-Carrillo, Dan; Marin-Lopez, Rafael

2016-03-11

The Internet of Things (IoT) is becoming increasingly important in several fields of industrial applications and personal applications, such as medical e-health, smart cities, etc. The research into protocols and security aspects related to this area is continuously advancing in making these networks more reliable and secure, taking into account these aspects by design. Bootstrapping is a procedure by which a user obtains key material and configuration information, among other parameters, to operate as an authenticated party in a security domain. Until now solutions have focused on re-using security protocols that were not developed for IoT constraints. For this reason, in this work we propose a design and implementation of a lightweight bootstrapping service for IoT networks that leverages one of the application protocols used in IoT : Constrained Application Protocol (CoAP). Additionally, in order to provide flexibility, scalability, support for large scale deployment, accountability and identity federation, our design uses technologies such as the Extensible Authentication Protocol (EAP) and Authentication Authorization and Accounting (AAA). We have named this service CoAP-EAP. First, we review the state of the art in the field of bootstrapping and specifically for IoT. Second, we detail the bootstrapping service: the architecture with entities and interfaces and the flow operation. Third, we obtain performance measurements of CoAP-EAP (bootstrapping time, memory footprint, message processing time, message length and energy consumption) and compare them with PANATIKI. The most significant and constrained representative of the bootstrapping solutions related with CoAP-EAP. As we will show, our solution provides significant improvements, mainly due to an important reduction of the message length.

Lightweight CoAP-Based Bootstrapping Service for the Internet of Things

PubMed Central

Garcia-Carrillo, Dan; Marin-Lopez, Rafael

2016-01-01

The Internet of Things (IoT) is becoming increasingly important in several fields of industrial applications and personal applications, such as medical e-health, smart cities, etc. The research into protocols and security aspects related to this area is continuously advancing in making these networks more reliable and secure, taking into account these aspects by design. Bootstrapping is a procedure by which a user obtains key material and configuration information, among other parameters, to operate as an authenticated party in a security domain. Until now solutions have focused on re-using security protocols that were not developed for IoT constraints. For this reason, in this work we propose a design and implementation of a lightweight bootstrapping service for IoT networks that leverages one of the application protocols used in IoT : Constrained Application Protocol (CoAP). Additionally, in order to provide flexibility, scalability, support for large scale deployment, accountability and identity federation, our design uses technologies such as the Extensible Authentication Protocol (EAP) and Authentication Authorization and Accounting (AAA). We have named this service CoAP-EAP. First, we review the state of the art in the field of bootstrapping and specifically for IoT. Second, we detail the bootstrapping service: the architecture with entities and interfaces and the flow operation. Third, we obtain performance measurements of CoAP-EAP (bootstrapping time, memory footprint, message processing time, message length and energy consumption) and compare them with PANATIKI. The most significant and constrained representative of the bootstrapping solutions related with CoAP-EAP. As we will show, our solution provides significant improvements, mainly due to an important reduction of the message length. PMID:26978362

Integrated Evaluation of Reliability and Power Consumption of Wireless Sensor Networks.

PubMed

Dâmaso, Antônio; Rosa, Nelson; Maciel, Paulo

2017-11-05

Power consumption is a primary interest in Wireless Sensor Networks (WSNs), and a large number of strategies have been proposed to evaluate it. However, those approaches usually neither consider reliability issues nor the power consumption of applications executing in the network. A central concern is the lack of consolidated solutions that enable us to evaluate the power consumption of applications and the network stack also considering their reliabilities. To solve this problem, we introduce a fully automatic solution to design power consumption aware WSN applications and communication protocols. The solution presented in this paper comprises a methodology to evaluate the power consumption based on the integration of formal models, a set of power consumption and reliability models, a sensitivity analysis strategy to select WSN configurations and a toolbox named EDEN to fully support the proposed methodology. This solution allows accurately estimating the power consumption of WSN applications and the network stack in an automated way.

Artificial neural networks and approximate reasoning for intelligent control in space

NASA Technical Reports Server (NTRS)

Berenji, Hamid R.

1991-01-01

A method is introduced for learning to refine the control rules of approximate reasoning-based controllers. A reinforcement-learning technique is used in conjunction with a multi-layer neural network model of an approximate reasoning-based controller. The model learns by updating its prediction of the physical system's behavior. The model can use the control knowledge of an experienced operator and fine-tune it through the process of learning. Some of the space domains suitable for applications of the model such as rendezvous and docking, camera tracking, and tethered systems control are discussed.

Diluted connectivity in pattern association networks facilitates the recall of information from the hippocampus to the neocortex.

PubMed

Rolls, Edmund T

2015-01-01

The recall of information stored in the hippocampus involves a series of corticocortical backprojections via the entorhinal cortex, parahippocampal gyrus, and one or more neocortical stages. Each stage is considered to be a pattern association network, with the retrieval cue at each stage the firing of neurons in the previous stage. The leading factor that determines the capacity of this multistage pattern association backprojection pathway is the number of connections onto any one neuron, which provides a quantitative basis for why there are as many backprojections between adjacent stages in the hierarchy as forward projections. The issue arises of why this multistage backprojection system uses diluted connectivity. One reason is that a multistage backprojection system with expansion of neuron numbers at each stage enables the hippocampus to address during recall the very large numbers of neocortical neurons, which would otherwise require hippocampal neurons to make very large numbers of synapses if they were directly onto neocortical neurons. The second reason is that as shown here, diluted connectivity in the backprojection pathways reduces the probability of more than one connection onto a receiving neuron in the backprojecting pathways, which otherwise reduces the capacity of the system, that is the number of memories that can be recalled from the hippocampus to the neocortex. For similar reasons, diluted connectivity is advantageous in pattern association networks in other brain systems such as the orbitofrontal cortex and amygdala; for related reasons, in autoassociation networks in, for example, the hippocampal CA3 and the neocortex; and for the different reason that diluted connectivity facilitates the operation of competitive networks in forward-connected cortical systems. © 2015 Elsevier B.V. All rights reserved.

Reasons Why Training and Development Fails...and What You Can Do about It.

ERIC Educational Resources Information Center

Phillips, Jack L.; Phillips, Patricia P.

2002-01-01

Among the reasons why training and development fail are lack of alignment with needs, failure to recognize nontraining solutions, lack of objectives, expensive solutions, lack of accountability for results, failure to prepare for transfer, lack of management support, failure to isolate the effects of training, lack of executive commitment and…

Multicultural Content and Class Participation: Do Students Self-Censor?

ERIC Educational Resources Information Center

Hyde, Cheryl A.; Ruth, Betty J.

2002-01-01

Through survey and focus group data, examined student discomfort in social work courses, reasons for self-censorship, and solutions to self-censorship. Found that general classroom factors (being too shy or being unprepared), not political correctness, were more likely to be reasons for self-censorship. Solutions focused on the faculty's role in…

Optimal placement of multiple types of communicating sensors with availability and coverage redundancy constraints

NASA Astrophysics Data System (ADS)

Vecherin, Sergey N.; Wilson, D. Keith; Pettit, Chris L.

2010-04-01

Determination of an optimal configuration (numbers, types, and locations) of a sensor network is an important practical problem. In most applications, complex signal propagation effects and inhomogeneous coverage preferences lead to an optimal solution that is highly irregular and nonintuitive. The general optimization problem can be strictly formulated as a binary linear programming problem. Due to the combinatorial nature of this problem, however, its strict solution requires significant computational resources (NP-complete class of complexity) and is unobtainable for large spatial grids of candidate sensor locations. For this reason, a greedy algorithm for approximate solution was recently introduced [S. N. Vecherin, D. K. Wilson, and C. L. Pettit, "Optimal sensor placement with terrain-based constraints and signal propagation effects," Unattended Ground, Sea, and Air Sensor Technologies and Applications XI, SPIE Proc. Vol. 7333, paper 73330S (2009)]. Here further extensions to the developed algorithm are presented to include such practical needs and constraints as sensor availability, coverage by multiple sensors, and wireless communication of the sensor information. Both communication and detection are considered in a probabilistic framework. Communication signal and signature propagation effects are taken into account when calculating probabilities of communication and detection. Comparison of approximate and strict solutions on reduced-size problems suggests that the approximate algorithm yields quick and good solutions, which thus justifies using that algorithm for full-size problems. Examples of three-dimensional outdoor sensor placement are provided using a terrain-based software analysis tool.

On Applicability of Network Coding Technique for 6LoWPAN-based Sensor Networks.

PubMed

Amanowicz, Marek; Krygier, Jaroslaw

2018-05-26

In this paper, the applicability of the network coding technique in 6LoWPAN-based sensor multihop networks is examined. The 6LoWPAN is one of the standards proposed for the Internet of Things architecture. Thus, we can expect the significant growth of traffic in such networks, which can lead to overload and decrease in the sensor network lifetime. The authors propose the inter-session network coding mechanism that can be implemented in resource-limited sensor motes. The solution reduces the overall traffic in the network, and in consequence, the energy consumption is decreased. Used procedures take into account deep header compressions of the native 6LoWPAN packets and the hop-by-hop changes of the header structure. Applied simplifications reduce signaling traffic that is typically occurring in network coding deployments, keeping the solution usefulness for the wireless sensor networks with limited resources. The authors validate the proposed procedures in terms of end-to-end packet delay, packet loss ratio, traffic in the air, total energy consumption, and network lifetime. The solution has been tested in a real wireless sensor network. The results confirm the efficiency of the proposed technique, mostly in delay-tolerant sensor networks.

High-Order Accurate Solutions to the Helmholtz Equation in the Presence of Boundary Singularities

DTIC Science & Technology

2015-03-31

FD scheme is only consistent for classical solutions of the PDE . For this reason, we implement the method of singularity subtraction as a means for...regularity due to the boundary conditions. This is because the FD scheme is only consistent for classical solutions of the PDE . For this reason, we...Introduction In the present work, we develop a high-order numerical method for solving linear elliptic PDEs with well-behaved variable coefficients on

Complexity in relational processing predicts changes in functional brain network dynamics.

PubMed

Cocchi, Luca; Halford, Graeme S; Zalesky, Andrew; Harding, Ian H; Ramm, Brentyn J; Cutmore, Tim; Shum, David H K; Mattingley, Jason B

2014-09-01

The ability to link variables is critical to many high-order cognitive functions, including reasoning. It has been proposed that limits in relating variables depend critically on relational complexity, defined formally as the number of variables to be related in solving a problem. In humans, the prefrontal cortex is known to be important for reasoning, but recent studies have suggested that such processes are likely to involve widespread functional brain networks. To test this hypothesis, we used functional magnetic resonance imaging and a classic measure of deductive reasoning to examine changes in brain networks as a function of relational complexity. As expected, behavioral performance declined as the number of variables to be related increased. Likewise, increments in relational complexity were associated with proportional enhancements in brain activity and task-based connectivity within and between 2 cognitive control networks: A cingulo-opercular network for maintaining task set, and a fronto-parietal network for implementing trial-by-trial control. Changes in effective connectivity as a function of increased relational complexity suggested a key role for the left dorsolateral prefrontal cortex in integrating and implementing task set in a trial-by-trial manner. Our findings show that limits in relational processing are manifested in the brain as complexity-dependent modulations of large-scale networks. © The Author 2013. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

A Social Network System Based on an Ontology in the Korea Institute of Oriental Medicine

NASA Astrophysics Data System (ADS)

Kim, Sang-Kyun; Han, Jeong-Min; Song, Mi-Young

We in this paper propose a social network based on ontology in Korea Institute of Oriental Medicine (KIOM). By using the social network, researchers can find collaborators and share research results with others so that studies in Korean Medicine fields can be activated. For this purpose, first, personal profiles, scholarships, careers, licenses, academic activities, research results, and personal connections for all of researchers in KIOM are collected. After relationship and hierarchy among ontology classes and attributes of classes are defined through analyzing the collected information, a social network ontology are constructed using FOAF and OWL. This ontology can be easily interconnected with other social network by FOAF and provide the reasoning based on OWL ontology. In future, we construct the search and reasoning system using the ontology. Moreover, if the social network is activated, we will open it to whole Korean Medicine fields.

Sensitivity Analysis of Genetic Algorithm Parameters for Optimal Groundwater Monitoring Network Design

NASA Astrophysics Data System (ADS)

Abdeh-Kolahchi, A.; Satish, M.; Datta, B.

2004-05-01

A state art groundwater monitoring network design is introduced. The method combines groundwater flow and transport results with optimization Genetic Algorithm (GA) to identify optimal monitoring well locations. Optimization theory uses different techniques to find a set of parameter values that minimize or maximize objective functions. The suggested groundwater optimal monitoring network design is based on the objective of maximizing the probability of tracking a transient contamination plume by determining sequential monitoring locations. The MODFLOW and MT3DMS models included as separate modules within the Groundwater Modeling System (GMS) are used to develop three dimensional groundwater flow and contamination transport simulation. The groundwater flow and contamination simulation results are introduced as input to the optimization model, using Genetic Algorithm (GA) to identify the groundwater optimal monitoring network design, based on several candidate monitoring locations. The groundwater monitoring network design model is used Genetic Algorithms with binary variables representing potential monitoring location. As the number of decision variables and constraints increase, the non-linearity of the objective function also increases which make difficulty to obtain optimal solutions. The genetic algorithm is an evolutionary global optimization technique, which is capable of finding the optimal solution for many complex problems. In this study, the GA approach capable of finding the global optimal solution to a groundwater monitoring network design problem involving 18.4X 1018 feasible solutions will be discussed. However, to ensure the efficiency of the solution process and global optimality of the solution obtained using GA, it is necessary that appropriate GA parameter values be specified. The sensitivity analysis of genetic algorithms parameters such as random number, crossover probability, mutation probability, and elitism are discussed for solution of monitoring network design.

The Coverage Problem in Video-Based Wireless Sensor Networks: A Survey

PubMed Central

Costa, Daniel G.; Guedes, Luiz Affonso

2010-01-01

Wireless sensor networks typically consist of a great number of tiny low-cost electronic devices with limited sensing and computing capabilities which cooperatively communicate to collect some kind of information from an area of interest. When wireless nodes of such networks are equipped with a low-power camera, visual data can be retrieved, facilitating a new set of novel applications. The nature of video-based wireless sensor networks demands new algorithms and solutions, since traditional wireless sensor networks approaches are not feasible or even efficient for that specialized communication scenario. The coverage problem is a crucial issue of wireless sensor networks, requiring specific solutions when video-based sensors are employed. In this paper, it is surveyed the state of the art of this particular issue, regarding strategies, algorithms and general computational solutions. Open research areas are also discussed, envisaging promising investigation considering coverage in video-based wireless sensor networks. PMID:22163651

Implementing Proactive Network Management Solutions in the Residence Halls

ERIC Educational Resources Information Center

Bedi, Param

2005-01-01

This paper discusses how to implement networking solutions in residence halls at Arcadia University in Philadelphia. Sections of the paper include: (1) About Arcadia University; (2) Residence Halls Network; (3) How Campus Manager Helped Arcadia University; (4) What Is Campus Manager; (5) How Campus Manager Works; (6) Campus Manager Remediation…

Common quandaries and their practical solutions in Bayesian network modeling

Treesearch

Bruce G. Marcot

2017-01-01

Use and popularity of Bayesian network (BN) modeling has greatly expanded in recent years, but many common problems remain. Here, I summarize key problems in BN model construction and interpretation,along with suggested practical solutions. Problems in BN model construction include parameterizing probability values, variable definition, complex network structures,...

Maximizing algebraic connectivity in air transportation networks

NASA Astrophysics Data System (ADS)

Wei, Peng

In air transportation networks the robustness of a network regarding node and link failures is a key factor for its design. An experiment based on the real air transportation network is performed to show that the algebraic connectivity is a good measure for network robustness. Three optimization problems of algebraic connectivity maximization are then formulated in order to find the most robust network design under different constraints. The algebraic connectivity maximization problem with flight routes addition or deletion is first formulated. Three methods to optimize and analyze the network algebraic connectivity are proposed. The Modified Greedy Perturbation Algorithm (MGP) provides a sub-optimal solution in a fast iterative manner. The Weighted Tabu Search (WTS) is designed to offer a near optimal solution with longer running time. The relaxed semi-definite programming (SDP) is used to set a performance upper bound and three rounding techniques are discussed to find the feasible solution. The simulation results present the trade-off among the three methods. The case study on two air transportation networks of Virgin America and Southwest Airlines show that the developed methods can be applied in real world large scale networks. The algebraic connectivity maximization problem is extended by adding the leg number constraint, which considers the traveler's tolerance for the total connecting stops. The Binary Semi-Definite Programming (BSDP) with cutting plane method provides the optimal solution. The tabu search and 2-opt search heuristics can find the optimal solution in small scale networks and the near optimal solution in large scale networks. The third algebraic connectivity maximization problem with operating cost constraint is formulated. When the total operating cost budget is given, the number of the edges to be added is not fixed. Each edge weight needs to be calculated instead of being pre-determined. It is illustrated that the edge addition and the weight assignment can not be studied separately for the problem with operating cost constraint. Therefore a relaxed SDP method with golden section search is developed to solve both at the same time. The cluster decomposition is utilized to solve large scale networks.

Optimizing Nutrient Uptake in Biological Transport Networks

NASA Astrophysics Data System (ADS)

Ronellenfitsch, Henrik; Katifori, Eleni

2013-03-01

Many biological systems employ complex networks of vascular tubes to facilitate transport of solute nutrients, examples include the vascular system of plants (phloem), some fungi, and the slime-mold Physarum. It is believed that such networks are optimized through evolution for carrying out their designated task. We propose a set of hydrodynamic governing equations for solute transport in a complex network, and obtain the optimal network architecture for various classes of optimizing functionals. We finally discuss the topological properties and statistical mechanics of the resulting complex networks, and examine correspondence of the obtained networks to those found in actual biological systems.

Rigorous theoretical constraint on constant negative EoS parameter [Formula: see text] and its effect for the late Universe.

PubMed

Burgazli, Alvina; Eingorn, Maxim; Zhuk, Alexander

In this paper, we consider the Universe at the late stage of its evolution and deep inside the cell of uniformity. At these scales, the Universe is filled with inhomogeneously distributed discrete structures (galaxies, groups and clusters of galaxies). Supposing that the Universe contains also the cosmological constant and a perfect fluid with a negative constant equation of state (EoS) parameter [Formula: see text] (e.g., quintessence, phantom or frustrated network of topological defects), we investigate scalar perturbations of the Friedmann-Robertson-Walker metrics due to inhomogeneities. Our analysis shows that, to be compatible with the theory of scalar perturbations, this perfect fluid, first, should be clustered and, second, should have the EoS parameter [Formula: see text]. In particular, this value corresponds to the frustrated network of cosmic strings. Therefore, the frustrated network of domain walls with [Formula: see text] is ruled out. A perfect fluid with [Formula: see text] neither accelerates nor decelerates the Universe. We also obtain the equation for the nonrelativistic gravitational potential created by a system of inhomogeneities. Due to the perfect fluid with [Formula: see text], the physically reasonable solutions take place for flat, open and closed Universes. This perfect fluid is concentrated around the inhomogeneities and results in screening of the gravitational potential.

Ionospheric Sounding Opportunities Using Signal Data From Preexisting Amateur Radio And Other Networks

NASA Astrophysics Data System (ADS)

Cushley, A. C.; Noel, J. M. A.

2015-12-01

Amateur radio and other transmissions used for dedicated purposes, such as the Automatic Packet Reporting System (APRS) and Automatic Dependent Surveillance Broadcast (ADS-B), are signals that exist for another reason, but can be used for ionospheric sounding. Whether mandated and government funded or voluntarily constructed and operated, these networks provide data that can be used for scientific and operational purposes which rely on space weather data. Given the current state of the global economic environment and fiscal consequences to scientific research funding in Canada, these types of networks offer an innovative solution with preexisting hardware for more real-time and archival space-weather data to supplement current methods, particularly for data assimilation, modelling and forecasting. Furthermore, mobile ground-based transmitters offer more flexibility for deployment than stationary receivers. Numerical modelling has demonstrated that APRS and ADS-B signals are subject to Faraday rotation (FR) as they pass through the ionosphere. Ray tracingtechniques were used to determine the characteristics of individual waves, including the wave path and the state of polarization. The modelled FR was computed and converted to total electron content (TEC) along the raypaths. TEC data can be used as input for computerized ionospheric tomography (CIT) in order to reconstruct electron density maps of the ionosphere.

47 CFR 20.18 - 911 Service.

Code of Federal Regulations, 2014 CFR

2014-10-01

... data from both network-based solutions and handset-based solutions may be blended to measure compliance... shall be applied to the accuracy data from each solution and measured against the network-based accuracy... the 911 operator will not be able to call the user back, and that the user should convey the exact...

Designing Interference-Robust Wireless Mesh Networks Using a Defender-Attacker-Defender Model

DTIC Science & Technology

2015-02-01

solution does not provide more network flow than the undefended attacker’s solution. (However, our tool stores alternate, runner -up solutions that often...approximate real WMNs. 51 LIST OF REFERENCES Alderson, D.L., Brown, G.G., & Carlyle, W.M. (2014). Assessing and improving operational resilience

A New IMS Based Inter-working Solution

NASA Astrophysics Data System (ADS)

Zhu, Zhongwen; Brunner, Richard

With the evolution of third generation network, more and more multimedia services are developed and deployed. Any new service to be deployed in IMS network is required to inter-work with existing Internet communities or legacy terminal users in order to appreciate the end users, who are the main drivers for the service to succeed. The challenge for Inter-working between IMS (IP Multimedia Subsystem) and non-IMS network is “how to handle recipient’s address”. This is because each network has its own routable address schema. For instance, the address for Google Talk user is xmpp:xyz@google.com, which is un-routable in IMS network. Hereafter a new Inter-working (IW) solution between IMS and non-IMS network is proposed for multimedia services that include Instant Messaging, Chat, and File transfer, etc. It is an end-to-end solution built on IMS infrastructure. The Public Service Identity (PSI) defined in 3GPP standard (3rd Generation Partnership Project) is used to allow terminal clients to allocate this IW service. When sending the SIP (Session Initial Protocol) request out for multimedia services, the terminal includes the recipient’s address in the payload instead of the “Request-URI” header. In the network, the proposed solution provides the mapping rules between different networks in MM-IW (Multimedia IW). The detailed technical description and the corresponding use cases are present. The comparison with other alternatives is made. The benefits of the proposed solution are highlighted.

Fuzzy Neural Networks for Decision Support in Negotiation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sakas, D. P.; Vlachos, D. S.; Simos, T. E.

There is a large number of parameters which one can take into account when building a negotiation model. These parameters in general are uncertain, thus leading to models which represents them with fuzzy sets. On the other hand, the nature of these parameters makes them very difficult to model them with precise values. During negotiation, these parameters play an important role by altering the outcomes or changing the state of the negotiators. One reasonable way to model this procedure is to accept fuzzy relations (from theory or experience). The action of these relations to fuzzy sets, produce new fuzzy setsmore » which describe now the new state of the system or the modified parameters. But, in the majority of these situations, the relations are multidimensional, leading to complicated models and exponentially increasing computational time. In this paper a solution to this problem is presented. The use of fuzzy neural networks is shown that it can substitute the use of fuzzy relations with comparable results. Finally a simple simulation is carried in order to test the new method.« less

Localization Algorithm with On-line Path Loss Estimation and Node Selection

PubMed Central

Bel, Albert; Vicario, José López; Seco-Granados, Gonzalo

2011-01-01

RSS-based localization is considered a low-complexity algorithm with respect to other range techniques such as TOA or AOA. The accuracy of RSS methods depends on the suitability of the propagation models used for the actual propagation conditions. In indoor environments, in particular, it is very difficult to obtain a good propagation model. For that reason, we present a cooperative localization algorithm that dynamically estimates the path loss exponent by using RSS measurements. Since the energy consumption is a key point in sensor networks, we propose a node selection mechanism to limit the number of neighbours of a given node that are used for positioning purposes. Moreover, the selection mechanism is also useful to discard bad links that could negatively affect the performance accuracy. As a result, we derive a practical solution tailored to the strict requirements of sensor networks in terms of complexity, size and cost. We present results based on both computer simulations and real experiments with the Crossbow MICA2 motes showing that the proposed scheme offers a good trade-off in terms of position accuracy and energy efficiency. PMID:22163992

Polyelectrolyte induced formation of silver nanoparticles in copolymer hydrogel and their application as catalyst

DOE Office of Scientific and Technical Information (OSTI.GOV)

He, Yongqiang; Huang, Guanbo, E-mail: gbhuang2007@hotmail.com; Pan, Zeng

2015-10-15

Highlights: • A simple route for the in situ preparation of Ag nanoparticles has been developed. • The Ag loaded hydrogel showed catalytic activity for reduction of 4-nitrophenol. • The catalyst can be recovered by simple separation and showed good recyclability. - Abstract: A simple route for the in situ preparation of catalytically active Ag nanoparticles (NPs) in hydrogel networks has been developed. The electronegativity of the amide and carboxyl groups on the poly(acrylamide-co-acryl acid) chains caused strong binding of the Ag{sup +} ions which made the ions distribute uniformly inside the hydrogels. When the Ag{sup +} loaded hydrogels weremore » immersed in NaBH{sub 4} solution, the Ag{sup +} ions on the polymer networks were reduced to Ag NPs. The resultant hydrogel showed good catalytic activity for the reduction of a common organic pollutant, 4-nitrophenol, with sodium borohydride. A kinetic study of the catalytic reaction was carried out and a possible reason for the decline of the catalytic performance with reuse is proposed.« less

Phase separation in living micellar networks

NASA Astrophysics Data System (ADS)

Cristobal, G.; Rouch, J.; Curély, J.; Panizza, P.

We present a lattice model based on two n→0 spin vectors, capable of treating the thermodynamics of living networks in micellar solutions at any surfactant concentration. We establish an isomorphism between the coupling constants in the two spin vector Hamiltonian and the surfactant energies involved in the micellar situation. Solving this Hamiltonian in the mean-field approximation allows one to calculate osmotic pressure, aggregation number, free end and cross-link densities at any surfactant concentration. We derive a phase diagram, including changes in topology such as the transition between spheres and rods and between saturated and unsaturated networks. A phase separation can be found between a saturated network and a dilute solution composed of long flexible micelles or a saturated network and a solution of spherical micelles.

Diagnostics in the Extendable Integrated Support Environment (EISE)

NASA Technical Reports Server (NTRS)

Brink, James R.; Storey, Paul

1988-01-01

Extendable Integrated Support Environment (EISE) is a real-time computer network consisting of commercially available hardware and software components to support systems level integration, modifications, and enhancement to weapons systems. The EISE approach offers substantial potential savings by eliminating unique support environments in favor of sharing common modules for the support of operational weapon systems. An expert system is being developed that will help support diagnosing faults in this network. This is a multi-level, multi-expert diagnostic system that uses experiential knowledge relating symptoms to faults and also reasons from structural and functional models of the underlying physical model when experiential reasoning is inadequate. The individual expert systems are orchestrated by a supervisory reasoning controller, a meta-level reasoner which plans the sequence of reasoning steps to solve the given specific problem. The overall system, termed the Diagnostic Executive, accesses systems level performance checks and error reports, and issues remote test procedures to formulate and confirm fault hypotheses.

ACCURATE CHEMICAL MASTER EQUATION SOLUTION USING MULTI-FINITE BUFFERS

PubMed Central

Cao, Youfang; Terebus, Anna; Liang, Jie

2016-01-01

The discrete chemical master equation (dCME) provides a fundamental framework for studying stochasticity in mesoscopic networks. Because of the multi-scale nature of many networks where reaction rates have large disparity, directly solving dCMEs is intractable due to the exploding size of the state space. It is important to truncate the state space effectively with quantified errors, so accurate solutions can be computed. It is also important to know if all major probabilistic peaks have been computed. Here we introduce the Accurate CME (ACME) algorithm for obtaining direct solutions to dCMEs. With multi-finite buffers for reducing the state space by O(n!), exact steady-state and time-evolving network probability landscapes can be computed. We further describe a theoretical framework of aggregating microstates into a smaller number of macrostates by decomposing a network into independent aggregated birth and death processes, and give an a priori method for rapidly determining steady-state truncation errors. The maximal sizes of the finite buffers for a given error tolerance can also be pre-computed without costly trial solutions of dCMEs. We show exactly computed probability landscapes of three multi-scale networks, namely, a 6-node toggle switch, 11-node phage-lambda epigenetic circuit, and 16-node MAPK cascade network, the latter two with no known solutions. We also show how probabilities of rare events can be computed from first-passage times, another class of unsolved problems challenging for simulation-based techniques due to large separations in time scales. Overall, the ACME method enables accurate and efficient solutions of the dCME for a large class of networks. PMID:27761104

Mobile Virtual Private Networking

NASA Astrophysics Data System (ADS)

Pulkkis, Göran; Grahn, Kaj; Mårtens, Mathias; Mattsson, Jonny

Mobile Virtual Private Networking (VPN) solutions based on the Internet Security Protocol (IPSec), Transport Layer Security/Secure Socket Layer (SSL/TLS), Secure Shell (SSH), 3G/GPRS cellular networks, Mobile IP, and the presently experimental Host Identity Protocol (HIP) are described, compared and evaluated. Mobile VPN solutions based on HIP are recommended for future networking because of superior processing efficiency and network capacity demand features. Mobile VPN implementation issues associated with the IP protocol versions IPv4 and IPv6 are also evaluated. Mobile VPN implementation experiences are presented and discussed.

Terminal attractors for addressable memory in neural networks

NASA Technical Reports Server (NTRS)

Zak, Michail

1988-01-01

A new type of attractors - terminal attractors - for an addressable memory in neural networks operating in continuous time is introduced. These attractors represent singular solutions of the dynamical system. They intersect (or envelope) the families of regular solutions while each regular solution approaches the terminal attractor in a finite time period. It is shown that terminal attractors can be incorporated into neural networks such that any desired set of these attractors with prescribed basins is provided by an appropriate selection of the weight matrix.

Communicative versus Strategic Rationality: Habermas Theory of Communicative Action and the Social Brain

PubMed Central

Schaefer, Michael; Heinze, Hans-Jochen; Rotte, Michael; Denke, Claudia

2013-01-01

In the philosophical theory of communicative action, rationality refers to interpersonal communication rather than to a knowing subject. Thus, a social view of rationality is suggested. The theory differentiates between two kinds of rationality, the emancipative communicative and the strategic or instrumental reasoning. Using experimental designs in an fMRI setting, recent studies explored similar questions of reasoning in the social world and linked them with a neural network including prefrontal and parietal brain regions. Here, we employed an fMRI approach to highlight brain areas associated with strategic and communicative reasoning according to the theory of communicative action. Participants were asked to assess different social scenarios with respect to communicative or strategic rationality. We found a network of brain areas including temporal pole, precuneus, and STS more activated when participants performed communicative reasoning compared with strategic thinking and a control condition. These brain regions have been previously linked to moral sensitivity. In contrast, strategic rationality compared with communicative reasoning and control was associated with less activation in areas known to be related to moral sensitivity, emotional processing, and language control. The results suggest that strategic reasoning is associated with reduced social and emotional cognitions and may use different language related networks. Thus, the results demonstrate experimental support for the assumptions of the theory of communicative action. PMID:23734238

First field trial of Virtual Network Operator oriented network on demand (NoD) service provisioning over software defined multi-vendor OTN networks

NASA Astrophysics Data System (ADS)

Li, Yajie; Zhao, Yongli; Zhang, Jie; Yu, Xiaosong; Chen, Haoran; Zhu, Ruijie; Zhou, Quanwei; Yu, Chenbei; Cui, Rui

2017-01-01

A Virtual Network Operator (VNO) is a provider and reseller of network services from other telecommunications suppliers. These network providers are categorized as virtual because they do not own the underlying telecommunication infrastructure. In terms of business operation, VNO can provide customers with personalized services by leasing network infrastructure from traditional network providers. The unique business modes of VNO lead to the emergence of network on demand (NoD) services. The conventional network provisioning involves a series of manual operation and configuration, which leads to high cost in time. Considering the advantages of Software Defined Networking (SDN), this paper proposes a novel NoD service provisioning solution to satisfy the private network need of VNOs. The solution is first verified in the real software defined multi-domain optical networks with multi-vendor OTN equipment. With the proposed solution, NoD service can be deployed via online web portals in near-real time. It reinvents the customer experience and redefines how network services are delivered to customers via an online self-service portal. Ultimately, this means a customer will be able to simply go online, click a few buttons and have new services almost instantaneously.

Combined Simulated Annealing and Genetic Algorithm Approach to Bus Network Design

NASA Astrophysics Data System (ADS)

Liu, Li; Olszewski, Piotr; Goh, Pong-Chai

A new method - combined simulated annealing (SA) and genetic algorithm (GA) approach is proposed to solve the problem of bus route design and frequency setting for a given road network with fixed bus stop locations and fixed travel demand. The method involves two steps: a set of candidate routes is generated first and then the best subset of these routes is selected by the combined SA and GA procedure. SA is the main process to search for a better solution to minimize the total system cost, comprising user and operator costs. GA is used as a sub-process to generate new solutions. Bus demand assignment on two alternative paths is performed at the solution evaluation stage. The method was implemented on four theoretical grid networks of different size and a benchmark network. Several GA operators (crossover and mutation) were utilized and tested for their effectiveness. The results show that the proposed method can efficiently converge to the optimal solution on a small network but computation time increases significantly with network size. The method can also be used for other transport operation management problems.

NOA: A Scalable Multi-Parent Clustering Hierarchy for WSNs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cree, Johnathan V.; Delgado-Frias, Jose; Hughes, Michael A.

2012-08-10

NOA is a multi-parent, N-tiered, hierarchical clustering algorithm that provides a scalable, robust and reliable solution to autonomous configuration of large-scale wireless sensor networks. The novel clustering hierarchy's inherent benefits can be utilized by in-network data processing techniques to provide equally robust, reliable and scalable in-network data processing solutions capable of reducing the amount of data sent to sinks. Utilizing a multi-parent framework, NOA reduces the cost of network setup when compared to hierarchical beaconing solutions by removing the expense of r-hop broadcasting (r is the radius of the cluster) needed to build the network and instead passes network topologymore » information among shared children. NOA2, a two-parent clustering hierarchy solution, and NOA3, the three-parent variant, saw up to an 83% and 72% reduction in overhead, respectively, when compared to performing one round of a one-parent hierarchical beaconing, as well as 92% and 88% less overhead when compared to one round of two- and three-parent hierarchical beaconing hierarchy.« less

A multilevel layout algorithm for visualizing physical and genetic interaction networks, with emphasis on their modular organization.

PubMed

Tuikkala, Johannes; Vähämaa, Heidi; Salmela, Pekka; Nevalainen, Olli S; Aittokallio, Tero

2012-03-26

Graph drawing is an integral part of many systems biology studies, enabling visual exploration and mining of large-scale biological networks. While a number of layout algorithms are available in popular network analysis platforms, such as Cytoscape, it remains poorly understood how well their solutions reflect the underlying biological processes that give rise to the network connectivity structure. Moreover, visualizations obtained using conventional layout algorithms, such as those based on the force-directed drawing approach, may become uninformative when applied to larger networks with dense or clustered connectivity structure. We implemented a modified layout plug-in, named Multilevel Layout, which applies the conventional layout algorithms within a multilevel optimization framework to better capture the hierarchical modularity of many biological networks. Using a wide variety of real life biological networks, we carried out a systematic evaluation of the method in comparison with other layout algorithms in Cytoscape. The multilevel approach provided both biologically relevant and visually pleasant layout solutions in most network types, hence complementing the layout options available in Cytoscape. In particular, it could improve drawing of large-scale networks of yeast genetic interactions and human physical interactions. In more general terms, the biological evaluation framework developed here enables one to assess the layout solutions from any existing or future graph drawing algorithm as well as to optimize their performance for a given network type or structure. By making use of the multilevel modular organization when visualizing biological networks, together with the biological evaluation of the layout solutions, one can generate convenient visualizations for many network biology applications.

The extended tracking network and indications of baseline precision and accuracy in the North Andes

NASA Technical Reports Server (NTRS)

Freymueller, Jeffrey T.; Kellogg, James N.

1990-01-01

The CASA Uno Global Positioning System (GPS) experiment (January-February 1988) included an extended tracking network which covered three continents in addition to the network of scientific interest in Central and South America. The repeatability of long baselines (400-1000 km) in South America is improved by up to a factor of two in the horizontal vector baseline components by using tracking stations in the Pacific and Europe to supplement stations in North America. In every case but one, the differences between the mean solutions obtained using different tracking networks was equal to or smaller than day-to-day rms repeatabilities for the same baselines. The mean solutions obtained by using tracking stations in North America and the Pacific agreed at the 2-3 millimeter level with those using tracking stations in North America and Europe. The agreement of the extended tracking network solutions suggests that a broad distribution of tracking stations provides better geometric constraints on the satellite orbits and that solutions are not sensitive to changes in tracking network configuration when an extended network is use. A comparison of the results from the North Andes and a baseline in North America suggests that the use of a geometrically strong extended tracking network is most important when the network of interest is far from North America.

Investigating the Small-Scale Spatial Variabilty of Precipitable Water Vapor by Adding Single-Frequency Receivers into an Existing Dual-Frequency Receiver Network

NASA Astrophysics Data System (ADS)

Krietemeyer, Andreas; ten Veldhuis, Marie-claire; van de Giesen, Nick

2017-04-01

Exploiting GNSS signal delays is one possibility to obtain Precipitable Water Vapor (PWV) estimates in the atmosphere. The technique is well known since the early 1990s and by now an established method in the meteorological community. The data is crucial for weather forecasting and its assimilation into numerical weather forecasting models is a topic of ongoing research. However, the spatial resolution of ground based GNSS receivers is usually low, in the order of tens of kilometres. Since severe weather events such as convective storms can be concentrated in spatial extent, existing GNSS networks are often not sufficient to retrieve small scale PWV fluctuations and need to be densified. For economic reasons, the use of low-cost single-frequency receivers is a promising solution. In this study, we will deploy a network of single-frequency receivers to densify an existing dual-frequency network in order to investigate the spatial and temporal PWV variations. We demonstrate a test network consisting of four single-frequency receivers in the Rotterdam area (Netherlands). In order to eliminate the delay caused by the ionosphere, the Satellite-specific Epoch-differenced Ionospheric Delay model (SEID) is applied, using a surrounding dual-frequency network distributed over a radius of approximately 25 km. With the synthesized L2 frequency, the tropospheric delays are estimated using the Precise Point Positioning (PPP) strategy and International GNSS Service (IGS) final orbits. The PWV time series are validated by a comparison of a collocated single-frequency and a dual-frequency receiver. The time series themselves form the basis for potential further studies like data assimilation into numerical weather models and GNSS tomography to study the impact of the increased spatial resolution on local heavy rain forecast.

Collaborative learning in networks.

PubMed

Mason, Winter; Watts, Duncan J

2012-01-17

Complex problems in science, business, and engineering typically require some tradeoff between exploitation of known solutions and exploration for novel ones, where, in many cases, information about known solutions can also disseminate among individual problem solvers through formal or informal networks. Prior research on complex problem solving by collectives has found the counterintuitive result that inefficient networks, meaning networks that disseminate information relatively slowly, can perform better than efficient networks for problems that require extended exploration. In this paper, we report on a series of 256 Web-based experiments in which groups of 16 individuals collectively solved a complex problem and shared information through different communication networks. As expected, we found that collective exploration improved average success over independent exploration because good solutions could diffuse through the network. In contrast to prior work, however, we found that efficient networks outperformed inefficient networks, even in a problem space with qualitative properties thought to favor inefficient networks. We explain this result in terms of individual-level explore-exploit decisions, which we find were influenced by the network structure as well as by strategic considerations and the relative payoff between maxima. We conclude by discussing implications for real-world problem solving and possible extensions.

Collaborative learning in networks

PubMed Central

Mason, Winter; Watts, Duncan J.

2012-01-01

Complex problems in science, business, and engineering typically require some tradeoff between exploitation of known solutions and exploration for novel ones, where, in many cases, information about known solutions can also disseminate among individual problem solvers through formal or informal networks. Prior research on complex problem solving by collectives has found the counterintuitive result that inefficient networks, meaning networks that disseminate information relatively slowly, can perform better than efficient networks for problems that require extended exploration. In this paper, we report on a series of 256 Web-based experiments in which groups of 16 individuals collectively solved a complex problem and shared information through different communication networks. As expected, we found that collective exploration improved average success over independent exploration because good solutions could diffuse through the network. In contrast to prior work, however, we found that efficient networks outperformed inefficient networks, even in a problem space with qualitative properties thought to favor inefficient networks. We explain this result in terms of individual-level explore-exploit decisions, which we find were influenced by the network structure as well as by strategic considerations and the relative payoff between maxima. We conclude by discussing implications for real-world problem solving and possible extensions. PMID:22184216

Flexible sampling large-scale social networks by self-adjustable random walk

NASA Astrophysics Data System (ADS)

Xu, Xiao-Ke; Zhu, Jonathan J. H.

2016-12-01

Online social networks (OSNs) have become an increasingly attractive gold mine for academic and commercial researchers. However, research on OSNs faces a number of difficult challenges. One bottleneck lies in the massive quantity and often unavailability of OSN population data. Sampling perhaps becomes the only feasible solution to the problems. How to draw samples that can represent the underlying OSNs has remained a formidable task because of a number of conceptual and methodological reasons. Especially, most of the empirically-driven studies on network sampling are confined to simulated data or sub-graph data, which are fundamentally different from real and complete-graph OSNs. In the current study, we propose a flexible sampling method, called Self-Adjustable Random Walk (SARW), and test it against with the population data of a real large-scale OSN. We evaluate the strengths of the sampling method in comparison with four prevailing methods, including uniform, breadth-first search (BFS), random walk (RW), and revised RW (i.e., MHRW) sampling. We try to mix both induced-edge and external-edge information of sampled nodes together in the same sampling process. Our results show that the SARW sampling method has been able to generate unbiased samples of OSNs with maximal precision and minimal cost. The study is helpful for the practice of OSN research by providing a highly needed sampling tools, for the methodological development of large-scale network sampling by comparative evaluations of existing sampling methods, and for the theoretical understanding of human networks by highlighting discrepancies and contradictions between existing knowledge/assumptions of large-scale real OSN data.

Performance Evaluation of LoRa Considering Scenario Conditions.

PubMed

Sanchez-Iborra, Ramon; Sanchez-Gomez, Jesus; Ballesta-Viñas, Juan; Cano, Maria-Dolores; Skarmeta, Antonio F

2018-03-03

New verticals within the Internet of Things (IoT) paradigm such as smart cities, smart farming, or goods monitoring, among many others, are demanding strong requirements to the Radio Access Network (RAN) in terms of coverage, end-node's power consumption, and scalability. The technologies employed so far to provide IoT scenarios with connectivity, e.g., wireless sensor network and cellular technologies, are not able to simultaneously cope with these three requirements. Thus, a novel solution known as Low Power - Wide Area Network (LP-WAN) has emerged as a promising alternative to provide with low-cost and low-power-consumption connectivity to end-nodes spread in a wide area. Concretely, the Long-Range Wide Area Network (LoRaWAN) technology is one of the LP-WAN platforms that is receiving greater attention from both the industry and the academia. For that reason, in this work, a comprehensive performance evaluation of LoRaWAN under different environmental conditions is presented. The results are obtained from three real scenarios, namely, urban, suburban, and rural, considering both dynamic and static conditions, hence a discussion about the most proper LoRaWAN physical-layer configuration for each scenario is provided. Besides, a theoretical coverage study is also conducted by the use of a radio planning tool considering topographic maps and a precise propagation model. From the attained results, it can be concluded that it is necessary to evaluate the propagation conditions of the deployment scenario prior to the system implantation in order to reach a compromise between the robustness of the network and the transmission data-rate.

Brain tumor segmentation with Deep Neural Networks.

PubMed

Havaei, Mohammad; Davy, Axel; Warde-Farley, David; Biard, Antoine; Courville, Aaron; Bengio, Yoshua; Pal, Chris; Jodoin, Pierre-Marc; Larochelle, Hugo

2017-01-01

In this paper, we present a fully automatic brain tumor segmentation method based on Deep Neural Networks (DNNs). The proposed networks are tailored to glioblastomas (both low and high grade) pictured in MR images. By their very nature, these tumors can appear anywhere in the brain and have almost any kind of shape, size, and contrast. These reasons motivate our exploration of a machine learning solution that exploits a flexible, high capacity DNN while being extremely efficient. Here, we give a description of different model choices that we've found to be necessary for obtaining competitive performance. We explore in particular different architectures based on Convolutional Neural Networks (CNN), i.e. DNNs specifically adapted to image data. We present a novel CNN architecture which differs from those traditionally used in computer vision. Our CNN exploits both local features as well as more global contextual features simultaneously. Also, different from most traditional uses of CNNs, our networks use a final layer that is a convolutional implementation of a fully connected layer which allows a 40 fold speed up. We also describe a 2-phase training procedure that allows us to tackle difficulties related to the imbalance of tumor labels. Finally, we explore a cascade architecture in which the output of a basic CNN is treated as an additional source of information for a subsequent CNN. Results reported on the 2013 BRATS test data-set reveal that our architecture improves over the currently published state-of-the-art while being over 30 times faster. Copyright © 2016 Elsevier B.V. All rights reserved.

Performance Evaluation of LoRa Considering Scenario Conditions

PubMed Central

Sanchez-Gomez, Jesus; Ballesta-Viñas, Juan

2018-01-01

New verticals within the Internet of Things (IoT) paradigm such as smart cities, smart farming, or goods monitoring, among many others, are demanding strong requirements to the Radio Access Network (RAN) in terms of coverage, end-node’s power consumption, and scalability. The technologies employed so far to provide IoT scenarios with connectivity, e.g., wireless sensor network and cellular technologies, are not able to simultaneously cope with these three requirements. Thus, a novel solution known as Low Power - Wide Area Network (LP-WAN) has emerged as a promising alternative to provide with low-cost and low-power-consumption connectivity to end-nodes spread in a wide area. Concretely, the Long-Range Wide Area Network (LoRaWAN) technology is one of the LP-WAN platforms that is receiving greater attention from both the industry and the academia. For that reason, in this work, a comprehensive performance evaluation of LoRaWAN under different environmental conditions is presented. The results are obtained from three real scenarios, namely, urban, suburban, and rural, considering both dynamic and static conditions, hence a discussion about the most proper LoRaWAN physical-layer configuration for each scenario is provided. Besides, a theoretical coverage study is also conducted by the use of a radio planning tool considering topographic maps and a precise propagation model. From the attained results, it can be concluded that it is necessary to evaluate the propagation conditions of the deployment scenario prior to the system implantation in order to reach a compromise between the robustness of the network and the transmission data-rate. PMID:29510524

Accelerating the Delivery of Home Performance Upgrades through a Synergistic Business Model

DOE Office of Scientific and Technical Information (OSTI.GOV)

Schirber, Tom; Ojczyk, Cindy

Achieving Building America energy savings goals (40% by 2030) will require many existing homes to install energy upgrades. Engaging large numbers of homeowners in building science-guided upgrades during a single remodeling event has been difficult for a number of reasons. Performance upgrades in existing homes tend to occur over multiple years and usually result from component failures (furnace failure) and weather damage (ice dams, roofing, siding). This research attempted to: A) understand the homeowner's motivations regarding investing in building science based performance upgrades; B) determining a rapidly scalable approach to engage large numbers of homeowners directly through existing customer networks;more » and C) access a business model that will manage all aspects of the contractor-homeowner-performance professional interface to ensure good upgrade decisions over time. The solution results from a synergistic approach utilizing networks of suppliers merging with networks of homeowner customers. Companies in the $400 to $800 billion home services industry have proven direct marketing and sales proficiencies that have led to the development of vast customer networks. Companies such as pest control, lawn care, and security have nurtured these networks by successfully addressing the ongoing needs of homes. This long-term access to customers and trust established with consistent delivery has also provided opportunities for home service providers to grow by successfully introducing new products and services like attic insulation and air sealing. The most important component for success is a business model that will facilitate and manage the process. The team analyzes a group that developed a working model.« less

Building America Case Study: Accelerating the Delivery of Home-Performance Upgrades Using a Synergistic Business Model, Minneapolis, Minnesota

DOE Office of Scientific and Technical Information (OSTI.GOV)

Achieving Building America energy savings goals (40 percent by 2030) will require many existing homes to install energy upgrades. Engaging large numbers of homeowners in building science-guided upgrades during a single remodeling event has been difficult for a number of reasons. Performance upgrades in existing homes tend to occur over multiple years and usually result from component failures (furnace failure) and weather damage (ice dams, roofing, siding). This research attempted to: A) Understand the homeowner's motivations regarding investing in building science based performance upgrades. B) Determining a rapidly scalable approach to engage large numbers of homeowners directly through existing customermore » networks. C) Access a business model that will manage all aspects of the contractor-homeowner-performance professional interface to ensure good upgrade decisions over time. The solution results from a synergistic approach utilizing networks of suppliers merging with networks of homeowner customers. Companies in the $400 to $800 billion home services industry have proven direct marketing and sales proficiencies that have led to the development of vast customer networks. Companies such as pest control, lawn care, and security have nurtured these networks by successfully addressing the ongoing needs of homes. This long-term access to customers and trust established with consistent delivery has also provided opportunities for home service providers to grow by successfully introducing new products and services like attic insulation and air sealing. The most important component for success is a business model that will facilitate and manage the process. The team analyzes a group that developed a working model.« less

A Characterization of Dynamic Reasoning: Reasoning with Time as Parameter

ERIC Educational Resources Information Center

Keene, Karen Allen

2007-01-01

Students incorporate and use the implicit and explicit parameter time to support their mathematical reasoning and deepen their understandings as they participate in a differential equations class during instruction on solutions to systems of differential equations. Therefore, dynamic reasoning is defined as developing and using conceptualizations…

Understanding Proportional Reasoning for Teaching

ERIC Educational Resources Information Center

Kastberg, Signe E.; D'Ambrosio, Beatriz; Lynch-Davis, Kathleen

2012-01-01

Proportional reasoning is an important cornerstone in children's mathematical development. This sort of reasoning has been shown to develop across the early years of schooling (ages 8 to 10) through the middle years (ages 11-14). In the early years, children tend to use additive reasoning to generate solutions to problems, while later comparisons…

Relationships between Fractional Knowledge and Algebraic Reasoning: The Case of Willa

ERIC Educational Resources Information Center

Lee, Mi Yeon; Hackenberg, Amy J.

2014-01-01

To investigate relationships between students' quantitative reasoning with fractions and their algebraic reasoning, a clinical interview study was conducted with 18 middle and high school students. The students were interviewed twice, once to explore their quantitative reasoning with fractions and once to explore their solutions of problems…

Mathematics as Reasoning--Episodes from Japan.

ERIC Educational Resources Information Center

Sawada, Daiyo

1997-01-01

Describes three episodes in Sendai, Japan: (1) reasoning with number patterns (grade one); (2) engaging in logical analysis (grade five); and (3) a reason to reason (grade five). Observation of these episodes reinforces importance of the teacher's patience in guiding the lesson and encouraging several alternative solutions from students. Lessons…

Metadata behind the Interoperability of Wireless Sensor Networks

PubMed Central

Ballari, Daniela; Wachowicz, Monica; Callejo, Miguel Angel Manso

2009-01-01

Wireless Sensor Networks (WSNs) produce changes of status that are frequent, dynamic and unpredictable, and cannot be represented using a linear cause-effect approach. Consequently, a new approach is needed to handle these changes in order to support dynamic interoperability. Our approach is to introduce the notion of context as an explicit representation of changes of a WSN status inferred from metadata elements, which in turn, leads towards a decision-making process about how to maintain dynamic interoperability. This paper describes the developed context model to represent and reason over different WSN status based on four types of contexts, which have been identified as sensing, node, network and organisational contexts. The reasoning has been addressed by developing contextualising and bridges rules. As a result, we were able to demonstrate how contextualising rules have been used to reason on changes of WSN status as a first step towards maintaining dynamic interoperability. PMID:22412330

Metadata behind the Interoperability of Wireless Sensor Networks.

PubMed

Ballari, Daniela; Wachowicz, Monica; Callejo, Miguel Angel Manso

2009-01-01

Wireless Sensor Networks (WSNs) produce changes of status that are frequent, dynamic and unpredictable, and cannot be represented using a linear cause-effect approach. Consequently, a new approach is needed to handle these changes in order to support dynamic interoperability. Our approach is to introduce the notion of context as an explicit representation of changes of a WSN status inferred from metadata elements, which in turn, leads towards a decision-making process about how to maintain dynamic interoperability. This paper describes the developed context model to represent and reason over different WSN status based on four types of contexts, which have been identified as sensing, node, network and organisational contexts. The reasoning has been addressed by developing contextualising and bridges rules. As a result, we were able to demonstrate how contextualising rules have been used to reason on changes of WSN status as a first step towards maintaining dynamic interoperability.

Fronto-Parietal Network Reconfiguration Supports the Development of Reasoning Ability

PubMed Central

Wendelken, Carter; Ferrer, Emilio; Whitaker, Kirstie J.; Bunge, Silvia A.

2016-01-01

The goal of this fMRI study was to examine how well developmental improvements in reasoning ability can be explained by changes in functional connectivity between specific nodes in prefrontal and parietal cortices. To this end, we examined connectivity within the lateral fronto-parietal network (LFPN) and its relation to reasoning ability in 132 children and adolescents aged 6–18 years, 56 of whom were scanned twice over the course of 1.5 years. Developmental changes in strength of connections within the LFPN were most prominent in late childhood and early adolescence. Reasoning ability was related to functional connectivity between left rostrolateral prefrontal cortex (RLPFC) and inferior parietal lobule (IPL), but only among 12–18-year olds. For 9–11-year olds, reasoning ability was most strongly related to connectivity between left and right RLPFC; this relationship was mediated by working memory. For 6–8-year olds, significant relationships between connectivity and performance were not observed; in this group, processing speed was the primary mediator of improvement in reasoning ability. We conclude that different connections best support reasoning at different points in development and that RLPFC-IPL connectivity becomes an important predictor of reasoning during adolescence. PMID:25824536

Integrated Evaluation of Reliability and Power Consumption of Wireless Sensor Networks

PubMed Central

Dâmaso, Antônio; Maciel, Paulo

2017-01-01

Power consumption is a primary interest in Wireless Sensor Networks (WSNs), and a large number of strategies have been proposed to evaluate it. However, those approaches usually neither consider reliability issues nor the power consumption of applications executing in the network. A central concern is the lack of consolidated solutions that enable us to evaluate the power consumption of applications and the network stack also considering their reliabilities. To solve this problem, we introduce a fully automatic solution to design power consumption aware WSN applications and communication protocols. The solution presented in this paper comprises a methodology to evaluate the power consumption based on the integration of formal models, a set of power consumption and reliability models, a sensitivity analysis strategy to select WSN configurations and a toolbox named EDEN to fully support the proposed methodology. This solution allows accurately estimating the power consumption of WSN applications and the network stack in an automated way. PMID:29113078

Diffusing wave spectroscopy in Maxwellian fluids.

PubMed

Galvan-Miyoshi, J; Delgado, J; Castillo, R

2008-08-01

We present a critical assessment of the diffusing wave spectroscopy (DWS) technique for obtaining the characteristic lengths and for measuring the loss and storage moduli of a reasonable well-known wormlike micelle (WM) system. For this purpose, we tracked the Brownian motion of particles using DWS embedded in a Maxwellian fluid constituted by a wormlike micellar solution made of cetyltrimethylammonium bromide (CTAB), sodium salicylate (NaSal), and water. We found that the motion of particles was governed by the viscosity of the solvent at short times and by the stress relaxation mechanisms of the giant micelles at longer times. From the time evolution of the mean square displacement of particles, we could obtain for the WM solution the cage size where each particle is harmonically bound at short times, the long-time diffusion coefficient, and experimental values for the exponent that accounts for the broad spectrum of relaxation times at the plateau onset time found in the (deltar2(t)) vs. time curves. In addition, from the (deltar2(t)) vs. time curves, we obtained G'(omega) and G"(omega) for the WM solutions. All the DWS microreological information allowed us to estimate the characteristic lengths of the WM network. We compare our DWS microrheological results and characteristic lengths with those obtained with mechanical rheometers at different NaSal/CTAB concentration ratios and temperatures.

Intelligent diagnosis of jaundice with dynamic uncertain causality graph model.

PubMed

Hao, Shao-Rui; Geng, Shi-Chao; Fan, Lin-Xiao; Chen, Jia-Jia; Zhang, Qin; Li, Lan-Juan

2017-05-01

Jaundice is a common and complex clinical symptom potentially occurring in hepatology, general surgery, pediatrics, infectious diseases, gynecology, and obstetrics, and it is fairly difficult to distinguish the cause of jaundice in clinical practice, especially for general practitioners in less developed regions. With collaboration between physicians and artificial intelligence engineers, a comprehensive knowledge base relevant to jaundice was created based on demographic information, symptoms, physical signs, laboratory tests, imaging diagnosis, medical histories, and risk factors. Then a diagnostic modeling and reasoning system using the dynamic uncertain causality graph was proposed. A modularized modeling scheme was presented to reduce the complexity of model construction, providing multiple perspectives and arbitrary granularity for disease causality representations. A "chaining" inference algorithm and weighted logic operation mechanism were employed to guarantee the exactness and efficiency of diagnostic reasoning under situations of incomplete and uncertain information. Moreover, the causal interactions among diseases and symptoms intuitively demonstrated the reasoning process in a graphical manner. Verification was performed using 203 randomly pooled clinical cases, and the accuracy was 99.01% and 84.73%, respectively, with or without laboratory tests in the model. The solutions were more explicable and convincing than common methods such as Bayesian Networks, further increasing the objectivity of clinical decision-making. The promising results indicated that our model could be potentially used in intelligent diagnosis and help decrease public health expenditure.

Intelligent diagnosis of jaundice with dynamic uncertain causality graph model*

PubMed Central

Hao, Shao-rui; Geng, Shi-chao; Fan, Lin-xiao; Chen, Jia-jia; Zhang, Qin; Li, Lan-juan

2017-01-01

Jaundice is a common and complex clinical symptom potentially occurring in hepatology, general surgery, pediatrics, infectious diseases, gynecology, and obstetrics, and it is fairly difficult to distinguish the cause of jaundice in clinical practice, especially for general practitioners in less developed regions. With collaboration between physicians and artificial intelligence engineers, a comprehensive knowledge base relevant to jaundice was created based on demographic information, symptoms, physical signs, laboratory tests, imaging diagnosis, medical histories, and risk factors. Then a diagnostic modeling and reasoning system using the dynamic uncertain causality graph was proposed. A modularized modeling scheme was presented to reduce the complexity of model construction, providing multiple perspectives and arbitrary granularity for disease causality representations. A “chaining” inference algorithm and weighted logic operation mechanism were employed to guarantee the exactness and efficiency of diagnostic reasoning under situations of incomplete and uncertain information. Moreover, the causal interactions among diseases and symptoms intuitively demonstrated the reasoning process in a graphical manner. Verification was performed using 203 randomly pooled clinical cases, and the accuracy was 99.01% and 84.73%, respectively, with or without laboratory tests in the model. The solutions were more explicable and convincing than common methods such as Bayesian Networks, further increasing the objectivity of clinical decision-making. The promising results indicated that our model could be potentially used in intelligent diagnosis and help decrease public health expenditure. PMID:28471111

Discrete-time neural network for fast solving large linear L1 estimation problems and its application to image restoration.

PubMed

Xia, Youshen; Sun, Changyin; Zheng, Wei Xing

2012-05-01

There is growing interest in solving linear L1 estimation problems for sparsity of the solution and robustness against non-Gaussian noise. This paper proposes a discrete-time neural network which can calculate large linear L1 estimation problems fast. The proposed neural network has a fixed computational step length and is proved to be globally convergent to an optimal solution. Then, the proposed neural network is efficiently applied to image restoration. Numerical results show that the proposed neural network is not only efficient in solving degenerate problems resulting from the nonunique solutions of the linear L1 estimation problems but also needs much less computational time than the related algorithms in solving both linear L1 estimation and image restoration problems.

Experimental demonstration of bandwidth on demand (BoD) provisioning based on time scheduling in software-defined multi-domain optical networks

NASA Astrophysics Data System (ADS)

Zhao, Yongli; Li, Yajie; Wang, Xinbo; Chen, Bowen; Zhang, Jie

2016-09-01

A hierarchical software-defined networking (SDN) control architecture is designed for multi-domain optical networks with the Open Daylight (ODL) controller. The OpenFlow-based Control Virtual Network Interface (CVNI) protocol is deployed between the network orchestrator and the domain controllers. Then, a dynamic bandwidth on demand (BoD) provisioning solution is proposed based on time scheduling in software-defined multi-domain optical networks (SD-MDON). Shared Risk Link Groups (SRLG)-disjoint routing schemes are adopted to separate each tenant for reliability. The SD-MDON testbed is built based on the proposed hierarchical control architecture. Then the proposed time scheduling-based BoD (Ts-BoD) solution is experimentally demonstrated on the testbed. The performance of the Ts-BoD solution is evaluated with respect to blocking probability, resource utilization, and lightpath setup latency.

Simulation of dynamic expansion, contraction, and connectivity in a mountain stream network

NASA Astrophysics Data System (ADS)

Ward, Adam S.; Schmadel, Noah M.; Wondzell, Steven M.

2018-04-01

Headwater stream networks expand and contract in response to changes in stream discharge. The changes in the extent of the stream network are also controlled by geologic or geomorphic setting - some reaches go dry even under relatively wet conditions, other reaches remain flowing under relatively dry conditions. While such patterns are well recognized, we currently lack tools to predict the extent of the stream network and the times and locations where the network is dry within large river networks. Here, we develop a perceptual model of the river corridor in a headwater mountainous catchment, translate this into a reduced-complexity mechanistic model, and implement the model to examine connectivity and network extent over an entire water year. Our model agreed reasonably well with our observations, showing that the extent and connectivity of the river network was most sensitive to hydrologic forcing under the lowest discharges (Qgauge < 1 L s-1), that at intermediate discharges (1 L s-1 < Qgauge < 10 L s-1) the extent of the network changed dramatically with changes in discharge, and that under wet conditions (Qgauge > 10 L s-1) the extent of the network was relatively insensitive to hydrologic forcing and was instead determined by the network topology. We do not expect that the specific thresholds observed in this study would be transferable to other catchments with different geology, topology, or hydrologic forcing. However, we expect that the general pattern should be robust: the dominant controls will shift from hydrologic forcing to geologic setting as discharge increases. Furthermore, our method is readily transferable as the model can be applied with minimal data requirements (a single stream gauge, a digital terrain model, and estimates of hydrogeologic properties) to estimate flow duration or connectivity along the river corridor in unstudied catchments. As the available information increases, the model could be better calibrated to match site-specific observations of network extent, locations of dry reaches, or solute break through curves as demonstrated in this study. Based on the low initial data requirements and ability to later tune the model to a specific site, we suggest example applications of this parsimonious model that may prove useful to both researchers and managers.

BITNET: Past, Present, and Future.

ERIC Educational Resources Information Center

Oberst, Daniel J.; Smith, Sheldon B.

1986-01-01

Discusses history and development of the academic computer network BITNET, including BITNET Network Support Center's growth and services, and international expansion. Network users, reasons for growth, and future developments are reviewed. A BITNET applications sampler and listings of compatible computers and operating systems, sites, and…

A network of experimental forests and ranges: Providing soil solutions for a changing world

Treesearch

Mary Beth Adams

2010-01-01

The network of experimental forests and ranges of the USDA Forest Service represents significant opportunities to provide soil solutions to critical issues of a changing world. This network of 81 experimental forests and ranges encompasses broad geographic, biological, climatic and physical scales, and includes long-term data sets, and long-term experimental...

Silicon-embedded copper nanostructure network for high energy storage

DOEpatents

Yu, Tianyue

2018-01-23

Provided herein are nanostructure networks having high energy storage, electrochemically active electrode materials including nanostructure networks having high energy storage, as well as electrodes and batteries including the nanostructure networks having high energy storage. According to various implementations, the nanostructure networks have high energy density as well as long cycle life. In some implementations, the nanostructure networks include a conductive network embedded with electrochemically active material. In some implementations, silicon is used as the electrochemically active material. The conductive network may be a metal network such as a copper nanostructure network. Methods of manufacturing the nanostructure networks and electrodes are provided. In some implementations, metal nanostructures can be synthesized in a solution that contains silicon powder to make a composite network structure that contains both. The metal nanostructure growth can nucleate in solution and on silicon nanostructure surfaces.

Silicon-embedded copper nanostructure network for high energy storage

DOEpatents

Yu, Tianyue

2016-03-15

Provided herein are nanostructure networks having high energy storage, electrochemically active electrode materials including nanostructure networks having high energy storage, as well as electrodes and batteries including the nanostructure networks having high energy storage. According to various implementations, the nanostructure networks have high energy density as well as long cycle life. In some implementations, the nanostructure networks include a conductive network embedded with electrochemically active material. In some implementations, silicon is used as the electrochemically active material. The conductive network may be a metal network such as a copper nanostructure network. Methods of manufacturing the nanostructure networks and electrodes are provided. In some implementations, metal nanostructures can be synthesized in a solution that contains silicon powder to make a composite network structure that contains both. The metal nanostructure growth can nucleate in solution and on silicon nanostructure surfaces.

A Qualitative Study on Classroom Management and Classroom Discipline Problems, Reasons, and Solutions: A Case of Information Technologies Class

ERIC Educational Resources Information Center

Erdogan, Mehmet; Kursun, Engin; Sisman, Gulcin Tan; Saltan, Fatih; Gok, Ali; Yildiz, Ismail

2010-01-01

The purpose of this study was to investigate classroom management and discipline problems that Information Technology teachers have faced, and to reveal underlying reasons and possible solutions of these problems by considering the views of parents, teachers, and administrator. This study was designed as qualitative study. Subjects of this study…

The Identification of Reasons, Solutions, and Techniques Informing a Theory-Based Intervention Targeting Recreational Sports Participation

ERIC Educational Resources Information Center

St Quinton, Tom; Brunton, Julie A.

2018-01-01

Purpose: This study is the 3rd piece of formative research utilizing the theory of planned behavior to inform the development of a behavior change intervention. Focus groups were used to identify reasons for and solutions to previously identified key beliefs in addition to potentially effective behavior change techniques. Method: A purposive…

A multi-scale network method for two-phase flow in porous media

DOE Office of Scientific and Technical Information (OSTI.GOV)

Khayrat, Karim, E-mail: khayratk@ifd.mavt.ethz.ch; Jenny, Patrick

Pore-network models of porous media are useful in the study of pore-scale flow in porous media. In order to extract macroscopic properties from flow simulations in pore-networks, it is crucial the networks are large enough to be considered representative elementary volumes. However, existing two-phase network flow solvers are limited to relatively small domains. For this purpose, a multi-scale pore-network (MSPN) method, which takes into account flow-rate effects and can simulate larger domains compared to existing methods, was developed. In our solution algorithm, a large pore network is partitioned into several smaller sub-networks. The algorithm to advance the fluid interfaces withinmore » each subnetwork consists of three steps. First, a global pressure problem on the network is solved approximately using the multiscale finite volume (MSFV) method. Next, the fluxes across the subnetworks are computed. Lastly, using fluxes as boundary conditions, a dynamic two-phase flow solver is used to advance the solution in time. Simulation results of drainage scenarios at different capillary numbers and unfavourable viscosity ratios are presented and used to validate the MSPN method against solutions obtained by an existing dynamic network flow solver.« less

Incorporation of varying types of temporal data in a neural network

NASA Technical Reports Server (NTRS)

Cohen, M. E.; Hudson, D. L.

1992-01-01

Most neural network models do not specifically deal with temporal data. Handling of these variables is complicated by the different uses to which temporal data are put, depending on the application. Even within the same application, temporal variables are often used in a number of different ways. In this paper, types of temporal data are discussed, along with their implications for approximate reasoning. Methods for integrating approximate temporal reasoning into existing neural network structures are presented. These methods are illustrated in a medical application for diagnosis of graft-versus-host disease which requires the use of several types of temporal data.

Accurate chemical master equation solution using multi-finite buffers

DOE PAGES

Cao, Youfang; Terebus, Anna; Liang, Jie

2016-06-29

Here, the discrete chemical master equation (dCME) provides a fundamental framework for studying stochasticity in mesoscopic networks. Because of the multiscale nature of many networks where reaction rates have a large disparity, directly solving dCMEs is intractable due to the exploding size of the state space. It is important to truncate the state space effectively with quantified errors, so accurate solutions can be computed. It is also important to know if all major probabilistic peaks have been computed. Here we introduce the accurate CME (ACME) algorithm for obtaining direct solutions to dCMEs. With multifinite buffers for reducing the state spacemore » by $O(n!)$, exact steady-state and time-evolving network probability landscapes can be computed. We further describe a theoretical framework of aggregating microstates into a smaller number of macrostates by decomposing a network into independent aggregated birth and death processes and give an a priori method for rapidly determining steady-state truncation errors. The maximal sizes of the finite buffers for a given error tolerance can also be precomputed without costly trial solutions of dCMEs. We show exactly computed probability landscapes of three multiscale networks, namely, a 6-node toggle switch, 11-node phage-lambda epigenetic circuit, and 16-node MAPK cascade network, the latter two with no known solutions. We also show how probabilities of rare events can be computed from first-passage times, another class of unsolved problems challenging for simulation-based techniques due to large separations in time scales. Overall, the ACME method enables accurate and efficient solutions of the dCME for a large class of networks.« less

Accurate chemical master equation solution using multi-finite buffers

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cao, Youfang; Terebus, Anna; Liang, Jie

Here, the discrete chemical master equation (dCME) provides a fundamental framework for studying stochasticity in mesoscopic networks. Because of the multiscale nature of many networks where reaction rates have a large disparity, directly solving dCMEs is intractable due to the exploding size of the state space. It is important to truncate the state space effectively with quantified errors, so accurate solutions can be computed. It is also important to know if all major probabilistic peaks have been computed. Here we introduce the accurate CME (ACME) algorithm for obtaining direct solutions to dCMEs. With multifinite buffers for reducing the state spacemore » by $O(n!)$, exact steady-state and time-evolving network probability landscapes can be computed. We further describe a theoretical framework of aggregating microstates into a smaller number of macrostates by decomposing a network into independent aggregated birth and death processes and give an a priori method for rapidly determining steady-state truncation errors. The maximal sizes of the finite buffers for a given error tolerance can also be precomputed without costly trial solutions of dCMEs. We show exactly computed probability landscapes of three multiscale networks, namely, a 6-node toggle switch, 11-node phage-lambda epigenetic circuit, and 16-node MAPK cascade network, the latter two with no known solutions. We also show how probabilities of rare events can be computed from first-passage times, another class of unsolved problems challenging for simulation-based techniques due to large separations in time scales. Overall, the ACME method enables accurate and efficient solutions of the dCME for a large class of networks.« less

Research into alternative network approaches for space operations

NASA Technical Reports Server (NTRS)

Kusmanoff, Antone L.; Barton, Timothy J.

1990-01-01

The main goal is to resolve the interoperability problem of applications employing DOD TCP/IP (Department of Defence Transmission Control Protocol/Internet Protocol) family of protocols on a CCITT/ISO based network. The objective is to allow them to communicate over the CCITT/ISO protocol GPLAN (General Purpose Local Area Network) network without modification to the user's application programs. There were two primary assumptions associated with the solution that was actually realized. The first is that the solution had to allow for future movement to the exclusive use of the CCITT/ISO standards. The second is that the solution had to be software transparent to the currently installed TCP/IP and CCITT/ISO user application programs.

Integrating Entropy and Closed Frequent Pattern Mining for Social Network Modelling and Analysis

NASA Astrophysics Data System (ADS)

Adnan, Muhaimenul; Alhajj, Reda; Rokne, Jon

The recent increase in the explicitly available social networks has attracted the attention of the research community to investigate how it would be possible to benefit from such a powerful model in producing effective solutions for problems in other domains where the social network is implicit; we argue that social networks do exist around us but the key issue is how to realize and analyze them. This chapter presents a novel approach for constructing a social network model by an integrated framework that first preparing the data to be analyzed and then applies entropy and frequent closed patterns mining for network construction. For a given problem, we first prepare the data by identifying items and transactions, which arc the basic ingredients for frequent closed patterns mining. Items arc main objects in the problem and a transaction is a set of items that could exist together at one time (e.g., items purchased in one visit to the supermarket). Transactions could be analyzed to discover frequent closed patterns using any of the well-known techniques. Frequent closed patterns have the advantage that they successfully grab the inherent information content of the dataset and is applicable to a broader set of domains. Entropies of the frequent closed patterns arc used to keep the dimensionality of the feature vectors to a reasonable size; it is a kind of feature reduction process. Finally, we analyze the dynamic behavior of the constructed social network. Experiments were conducted on a synthetic dataset and on the Enron corpus email dataset. The results presented in the chapter show that social networks extracted from a feature set as frequent closed patterns successfully carry the community structure information. Moreover, for the Enron email dataset, we present an analysis to dynamically indicate the deviations from each user's individual and community profile. These indications of deviations can be very useful to identify unusual events.

Phase-locked patterns of the Kuramoto model on 3-regular graphs

NASA Astrophysics Data System (ADS)

DeVille, Lee; Ermentrout, Bard

2016-09-01

We consider the existence of non-synchronized fixed points to the Kuramoto model defined on sparse networks: specifically, networks where each vertex has degree exactly three. We show that "most" such networks support multiple attracting phase-locked solutions that are not synchronized and study the depth and width of the basins of attraction of these phase-locked solutions. We also show that it is common in "large enough" graphs to find phase-locked solutions where one or more of the links have angle difference greater than π/2.

Phase-locked patterns of the Kuramoto model on 3-regular graphs.

PubMed

DeVille, Lee; Ermentrout, Bard

2016-09-01

We consider the existence of non-synchronized fixed points to the Kuramoto model defined on sparse networks: specifically, networks where each vertex has degree exactly three. We show that "most" such networks support multiple attracting phase-locked solutions that are not synchronized and study the depth and width of the basins of attraction of these phase-locked solutions. We also show that it is common in "large enough" graphs to find phase-locked solutions where one or more of the links have angle difference greater than π/2.

Hierarchical thinking in network biology: the unbiased modularization of biochemical networks.

PubMed

Papin, Jason A; Reed, Jennifer L; Palsson, Bernhard O

2004-12-01

As reconstructed biochemical reaction networks continue to grow in size and scope, there is a growing need to describe the functional modules within them. Such modules facilitate the study of biological processes by deconstructing complex biological networks into conceptually simple entities. The definition of network modules is often based on intuitive reasoning. As an alternative, methods are being developed for defining biochemical network modules in an unbiased fashion. These unbiased network modules are mathematically derived from the structure of the whole network under consideration.

The aspects of safety in future care settings.

PubMed

Pharow, Peter; Blobel, Bernd G M E; Savastano, Mario

2007-01-01

Communication and cooperation processes in the growing healthcare and welfare domain require a well-defined set of security services provided by a standards-based interoperable security infrastructure. Any communication and collaboration procedures require a verifiable purpose. Without such a purpose for communicating with each other, there's no need to communicate at all. But security is not the only aspect that needs to carefully be investigated. More and more, aspects of safety, privacy, and quality get importance while discussing about future-proof health information systems and health networks--regardless whether local, regional and national ones or even pan-European networks. The patient needs to be moved into the center of each care process. During the course of the current paradigm change from an organization centered via a process-related to a person-centered healthcare and welfare system approach, different new technologies need to be applied in order to meet the new challenges arising from both legal and technical circumstances. International organizations like WHO, UNESCO and the European Parliament increasingly aim at enhancing the safety aspect in future care settings, and so do many projects and studies. Beside typical information and communication devices, extended use of modern IT technology in healthcare and welfare includes large medical devices like, e.g., CT, X-ray and MR but also very tiny devices like sensors worn or implemented in a person's clothing. Safety gets on top of the nations priority list for several reasons. The paper aims at identifying some of these reasons along with possible solutions on how to increase patient's awareness, confidence, and acceptance in future care settings.

Fixed point theorems of GPS carrier phase ambiguity resolution and their application to massive network processing: Ambizap

NASA Astrophysics Data System (ADS)

Blewitt, Geoffrey

2008-12-01

Precise point positioning (PPP) has become popular for Global Positioning System (GPS) geodetic network analysis because for n stations, PPP has O(n) processing time, yet solutions closely approximate those of O(n3) full network analysis. Subsequent carrier phase ambiguity resolution (AR) further improves PPP precision and accuracy; however, full-network bootstrapping AR algorithms are O(n4), limiting single network solutions to n < 100. In this contribution, fixed point theorems of AR are derived and then used to develop "Ambizap," an O(n) algorithm designed to give results that closely approximate full network AR. Ambizap has been tested to n ≈ 2800 and proves to be O(n) in this range, adding only ˜50% to PPP processing time. Tests show that a 98-station network is resolved on a 3-GHz CPU in 7 min, versus 22 h using O(n4) AR methods. Ambizap features a novel network adjustment filter, producing solutions that precisely match O(n4) full network analysis. The resulting coordinates agree to ≪1 mm with current AR methods, much smaller than the ˜3-mm RMS precision of PPP alone. A 2000-station global network can be ambiguity resolved in ˜2.5 h. Together with PPP, Ambizap enables rapid, multiple reanalysis of large networks (e.g., ˜1000-station EarthScope Plate Boundary Observatory) and facilitates the addition of extra stations to an existing network solution without need to reprocess all data. To meet future needs, PPP plus Ambizap is designed to handle ˜10,000 stations per day on a 3-GHz dual-CPU desktop PC.

A multilevel layout algorithm for visualizing physical and genetic interaction networks, with emphasis on their modular organization

PubMed Central

2012-01-01

Background Graph drawing is an integral part of many systems biology studies, enabling visual exploration and mining of large-scale biological networks. While a number of layout algorithms are available in popular network analysis platforms, such as Cytoscape, it remains poorly understood how well their solutions reflect the underlying biological processes that give rise to the network connectivity structure. Moreover, visualizations obtained using conventional layout algorithms, such as those based on the force-directed drawing approach, may become uninformative when applied to larger networks with dense or clustered connectivity structure. Methods We implemented a modified layout plug-in, named Multilevel Layout, which applies the conventional layout algorithms within a multilevel optimization framework to better capture the hierarchical modularity of many biological networks. Using a wide variety of real life biological networks, we carried out a systematic evaluation of the method in comparison with other layout algorithms in Cytoscape. Results The multilevel approach provided both biologically relevant and visually pleasant layout solutions in most network types, hence complementing the layout options available in Cytoscape. In particular, it could improve drawing of large-scale networks of yeast genetic interactions and human physical interactions. In more general terms, the biological evaluation framework developed here enables one to assess the layout solutions from any existing or future graph drawing algorithm as well as to optimize their performance for a given network type or structure. Conclusions By making use of the multilevel modular organization when visualizing biological networks, together with the biological evaluation of the layout solutions, one can generate convenient visualizations for many network biology applications. PMID:22448851

Caught on Video! Using Handheld Digital Video Cameras to Support Evidence-Based Reasoning

ERIC Educational Resources Information Center

Lottero-Perdue, Pamela S.; Nealy, Jennifer; Roland, Christine; Ryan, Amy

2011-01-01

Engaging elementary students in evidence-based reasoning is an essential aspect of science and engineering education. Evidence-based reasoning involves students making claims (i.e., answers to questions, or solutions to problems), providing evidence to support those claims, and articulating their reasoning to connect the evidence to the claim. In…

Considerations on command and response language features for a network of heterogeneous autonomous computers

NASA Technical Reports Server (NTRS)

Engelberg, N.; Shaw, C., III

1984-01-01

The design of a uniform command language to be used in a local area network of heterogeneous, autonomous nodes is considered. After examining the major characteristics of such a network, and after considering the profile of a scientist using the computers on the net as an investigative aid, a set of reasonable requirements for the command language are derived. Taking into account the possible inefficiencies in implementing a guest-layered network operating system and command language on a heterogeneous net, the authors examine command language naming, process/procedure invocation, parameter acquisition, help and response facilities, and other features found in single-node command languages, and conclude that some features may extend simply to the network case, others extend after some restrictions are imposed, and still others require modifications. In addition, it is noted that some requirements considered reasonable (user accounting reports, for example) demand further study before they can be efficiently implemented on a network of the sort described.

Improved personalized recommendation based on a similarity network

NASA Astrophysics Data System (ADS)

Wang, Ximeng; Liu, Yun; Xiong, Fei

2016-08-01

A recommender system helps individual users find the preferred items rapidly and has attracted extensive attention in recent years. Many successful recommendation algorithms are designed on bipartite networks, such as network-based inference or heat conduction. However, most of these algorithms define the resource-allocation methods for an average allocation. That is not reasonable because average allocation cannot indicate the user choice preference and the influence between users which leads to a series of non-personalized recommendation results. We propose a personalized recommendation approach that combines the similarity function and bipartite network to generate a similarity network that improves the resource-allocation process. Our model introduces user influence into the recommender system and states that the user influence can make the resource-allocation process more reasonable. We use four different metrics to evaluate our algorithms for three benchmark data sets. Experimental results show that the improved recommendation on a similarity network can obtain better accuracy and diversity than some competing approaches.

Using fuzzy logic to integrate neural networks and knowledge-based systems

NASA Technical Reports Server (NTRS)

Yen, John

1991-01-01

Outlined here is a novel hybrid architecture that uses fuzzy logic to integrate neural networks and knowledge-based systems. The author's approach offers important synergistic benefits to neural nets, approximate reasoning, and symbolic processing. Fuzzy inference rules extend symbolic systems with approximate reasoning capabilities, which are used for integrating and interpreting the outputs of neural networks. The symbolic system captures meta-level information about neural networks and defines its interaction with neural networks through a set of control tasks. Fuzzy action rules provide a robust mechanism for recognizing the situations in which neural networks require certain control actions. The neural nets, on the other hand, offer flexible classification and adaptive learning capabilities, which are crucial for dynamic and noisy environments. By combining neural nets and symbolic systems at their system levels through the use of fuzzy logic, the author's approach alleviates current difficulties in reconciling differences between low-level data processing mechanisms of neural nets and artificial intelligence systems.

Similarity networks as a knowledge representation for space applications

NASA Technical Reports Server (NTRS)

Bailey, David; Thompson, Donna; Feinstein, Jerald

1987-01-01

Similarity networks are a powerful form of knowledge representation that are useful for many artificial intelligence applications. Similarity networks are used in applications ranging from information analysis and case based reasoning to machine learning and linking symbolic to neural processing. Strengths of similarity networks include simple construction, intuitive object storage, and flexible retrieval techniques that facilitate inferencing. Therefore, similarity networks provide great potential for space applications.

Enabling Research Network Connectivity to Clouds with Virtual Router Technology

NASA Astrophysics Data System (ADS)

Seuster, R.; Casteels, K.; Leavett-Brown, CR; Paterson, M.; Sobie, RJ

2017-10-01

The use of opportunistic cloud resources by HEP experiments has significantly increased over the past few years. Clouds that are owned or managed by the HEP community are connected to the LHCONE network or the research network with global access to HEP computing resources. Private clouds, such as those supported by non-HEP research funds are generally connected to the international research network; however, commercial clouds are either not connected to the research network or only connect to research sites within their national boundaries. Since research network connectivity is a requirement for HEP applications, we need to find a solution that provides a high-speed connection. We are studying a solution with a virtual router that will address the use case when a commercial cloud has research network connectivity in a limited region. In this situation, we host a virtual router in our HEP site and require that all traffic from the commercial site transit through the virtual router. Although this may increase the network path and also the load on the HEP site, it is a workable solution that would enable the use of the remote cloud for low I/O applications. We are exploring some simple open-source solutions. In this paper, we present the results of our studies and how it will benefit our use of private and public clouds for HEP computing.

The Reference Ability Neural Network Study: Life-time stability of reference-ability neural networks derived from task maps of young adults.

PubMed

Habeck, C; Gazes, Y; Razlighi, Q; Steffener, J; Brickman, A; Barulli, D; Salthouse, T; Stern, Y

2016-01-15

Analyses of large test batteries administered to individuals ranging from young to old have consistently yielded a set of latent variables representing reference abilities (RAs) that capture the majority of the variance in age-related cognitive change: Episodic Memory, Fluid Reasoning, Perceptual Processing Speed, and Vocabulary. In a previous paper (Stern et al., 2014), we introduced the Reference Ability Neural Network Study, which administers 12 cognitive neuroimaging tasks (3 for each RA) to healthy adults age 20-80 in order to derive unique neural networks underlying these 4 RAs and investigate how these networks may be affected by aging. We used a multivariate approach, linear indicator regression, to derive a unique covariance pattern or Reference Ability Neural Network (RANN) for each of the 4 RAs. The RANNs were derived from the neural task data of 64 younger adults of age 30 and below. We then prospectively applied the RANNs to fMRI data from the remaining sample of 227 adults of age 31 and above in order to classify each subject-task map into one of the 4 possible reference domains. Overall classification accuracy across subjects in the sample age 31 and above was 0.80±0.18. Classification accuracy by RA domain was also good, but variable; memory: 0.72±0.32; reasoning: 0.75±0.35; speed: 0.79±0.31; vocabulary: 0.94±0.16. Classification accuracy was not associated with cross-sectional age, suggesting that these networks, and their specificity to the respective reference domain, might remain intact throughout the age range. Higher mean brain volume was correlated with increased overall classification accuracy; better overall performance on the tasks in the scanner was also associated with classification accuracy. For the RANN network scores, we observed for each RANN that a higher score was associated with a higher corresponding classification accuracy for that reference ability. Despite the absence of behavioral performance information in the derivation of these networks, we also observed some brain-behavioral correlations, notably for the fluid-reasoning network whose network score correlated with performance on the memory and fluid-reasoning tasks. While age did not influence the expression of this RANN, the slope of the association between network score and fluid-reasoning performance was negatively associated with higher ages. These results provide support for the hypothesis that a set of specific, age-invariant neural networks underlies these four RAs, and that these networks maintain their cognitive specificity and level of intensity across age. Activation common to all 12 tasks was identified as another activation pattern resulting from a mean-contrast Partial-Least-Squares technique. This common pattern did show associations with age and some subject demographics for some of the reference domains, lending support to the overall conclusion that aspects of neural processing that are specific to any cognitive reference ability stay constant across age, while aspects that are common to all reference abilities differ across age. Copyright © 2015 Elsevier Inc. All rights reserved.

Case-based reasoning in design: An apologia

NASA Technical Reports Server (NTRS)

Pulaski, Kirt

1990-01-01

Three positions are presented and defended: the process of generating solutions in problem solving is viewable as a design task; case-based reasoning is a strong method of problem solving; and a synergism exists between case-based reasoning and design problem solving.

Creative and algorithmic mathematical reasoning: effects of transfer-appropriate processing and effortful struggle

NASA Astrophysics Data System (ADS)

Jonsson, Bert; Kulaksiz, Yagmur C.; Lithner, Johan

2016-11-01

Two separate studies, Jonsson et al. (J. Math Behav. 2014;36: 20-32) and Karlsson Wirebring et al. (Trends Neurosci Educ. 2015;4(1-2):6-14), showed that learning mathematics using creative mathematical reasoning and constructing their own solution methods can be more efficient than if students use algorithmic reasoning and are given the solution procedures. It was argued that effortful struggle was the key that explained this difference. It was also argued that the results could not be explained by the effects of transfer-appropriate processing, although this was not empirically investigated. This study evaluated the hypotheses of transfer-appropriate processing and effortful struggle in relation to the specific characteristics associated with algorithmic reasoning task and creative mathematical reasoning task. In a between-subjects design, upper-secondary students were matched according to their working memory capacity.

Video Conferences through the Internet: How to Survive in a Hostile Environment

PubMed Central

Fernández, Carlos; Fernández-Navajas, Julián; Sequeira, Luis; Casadesus, Luis

2014-01-01

This paper analyzes and compares two different video conference solutions, widely used in corporate and home environments, with a special focus on the mechanisms used for adapting the traffic to the network status. The results show how these mechanisms are able to provide a good quality in the hostile environment of the public Internet, a best effort network without delay or delivery guarantees. Both solutions are evaluated in a laboratory, where different network impairments (bandwidth limit, delay, and packet loss) are set, in both the uplink and the downlink, and the reaction of the applications is measured. The tests show how these solutions modify their packet size and interpacket time, in order to increase or reduce the sent data. One of the solutions also uses a scalable video codec, able to adapt the traffic to the network status and to the end devices. PMID:24605066

Free-Energy-Based Design Policy for Robust Network Control against Environmental Fluctuation.

PubMed

Iwai, Takuya; Kominami, Daichi; Murata, Masayuki; Yomo, Tetsuya

2015-01-01

Bioinspired network control is a promising approach for realizing robust network controls. It relies on a probabilistic mechanism composed of positive and negative feedback that allows the system to eventually stabilize on the best solution. When the best solution fails due to environmental fluctuation, the system cannot keep its function until the system finds another solution again. To prevent the temporal loss of the function, the system should prepare some solution candidates and stochastically select available one from them. However, most bioinspired network controls are not designed with this issue in mind. In this paper, we propose a thermodynamics-based design policy that allows systems to retain an appropriate degree of randomness depending on the degree of environmental fluctuation, which prepares the system for the occurrence of environmental fluctuation. Furthermore, we verify the design policy by using an attractor selection model-based multipath routing to run simulation experiments.

Energy-Efficient Cognitive Radio Sensor Networks: Parametric and Convex Transformations

PubMed Central

Naeem, Muhammad; Illanko, Kandasamy; Karmokar, Ashok; Anpalagan, Alagan; Jaseemuddin, Muhammad

2013-01-01

Designing energy-efficient cognitive radio sensor networks is important to intelligently use battery energy and to maximize the sensor network life. In this paper, the problem of determining the power allocation that maximizes the energy-efficiency of cognitive radio-based wireless sensor networks is formed as a constrained optimization problem, where the objective function is the ratio of network throughput and the network power. The proposed constrained optimization problem belongs to a class of nonlinear fractional programming problems. Charnes-Cooper Transformation is used to transform the nonlinear fractional problem into an equivalent concave optimization problem. The structure of the power allocation policy for the transformed concave problem is found to be of a water-filling type. The problem is also transformed into a parametric form for which a ε-optimal iterative solution exists. The convergence of the iterative algorithms is proven, and numerical solutions are presented. The iterative solutions are compared with the optimal solution obtained from the transformed concave problem, and the effects of different system parameters (interference threshold level, the number of primary users and secondary sensor nodes) on the performance of the proposed algorithms are investigated. PMID:23966194

Patient safety problem identification and solution sharing among rural community pharmacists.

PubMed

Galt, Kimberly A; Fuji, Kevin T; Faber, Jennifer

2013-01-01

To implement a communication network for safety problem identification and solution sharing among rural community pharmacists and to report participating pharmacists' perceived value and impact of the network on patient safety after 1 year of implementation. Action research study. Rural community pharmacies in Nebraska from January 2010 to April 2011. Rural community pharmacists who voluntarily agreed to join the Pharmacists for Patient Safety Network in Nebraska. Pharmacists reported errors, near misses, and safety concerns through Web-based event reporting. A rapid feedback process was used to provide patient safety solutions to consider implementing across the network. Qualitative interviews were conducted 1 year after program implementation with participating pharmacists to assess use of the reporting system, value of the disseminated safety solutions, and perceived impact on patient safety in pharmacies. 30 of 38 pharmacists participating in the project completed the interviews. The communication network improved pharmacist awareness, promoted open discussion and knowledge sharing, contributed to practice vigilance, and led to incorporation of proactive safety prevention practices. Despite low participation in error and near-miss reporting, a dynamic communication network designed to rapidly disseminate evidence-based patient safety strategies to reduce risk was valued and effective at improving patient safety practices in rural community pharmacies.

Techno-Economic Analysis of FiWi Access Networks Based on 802.11ac WLAN and NG-PON2 Networks

NASA Astrophysics Data System (ADS)

Breskovic, Damir; Begusic, Dinko

2017-05-01

In this article, techno-economic analysis of a fiber-wireless access network is presented. With high bandwidth capacity of the gigabit passive optical network and with cost-effectiveness of very high throughput 802.11ac wireless local area networks that enable user mobility in the wireless segment, fiber-wireless access networks can be considered as an alternative to the fiber-to-the-home architecture for next generation access networks. Analysis based on the proposed scenario here, shows that a fiber-wireless access network is a more cost-effective solution in densely populated areas, but with some introduced improvements, even other geotypes can be considered as a commercially-viable solution.

An Algorithm for the Mixed Transportation Network Design Problem

PubMed Central

Liu, Xinyu; Chen, Qun

2016-01-01

This paper proposes an optimization algorithm, the dimension-down iterative algorithm (DDIA), for solving a mixed transportation network design problem (MNDP), which is generally expressed as a mathematical programming with equilibrium constraint (MPEC). The upper level of the MNDP aims to optimize the network performance via both the expansion of the existing links and the addition of new candidate links, whereas the lower level is a traditional Wardrop user equilibrium (UE) problem. The idea of the proposed solution algorithm (DDIA) is to reduce the dimensions of the problem. A group of variables (discrete/continuous) is fixed to optimize another group of variables (continuous/discrete) alternately; then, the problem is transformed into solving a series of CNDPs (continuous network design problems) and DNDPs (discrete network design problems) repeatedly until the problem converges to the optimal solution. The advantage of the proposed algorithm is that its solution process is very simple and easy to apply. Numerical examples show that for the MNDP without budget constraint, the optimal solution can be found within a few iterations with DDIA. For the MNDP with budget constraint, however, the result depends on the selection of initial values, which leads to different optimal solutions (i.e., different local optimal solutions). Some thoughts are given on how to derive meaningful initial values, such as by considering the budgets of new and reconstruction projects separately. PMID:27626803

Capacity-constrained traffic assignment in networks with residual queues

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lam, W.H.K.; Zhang, Y.

2000-04-01

This paper proposes a capacity-constrained traffic assignment model for strategic transport planning in which the steady-state user equilibrium principle is extended for road networks with residual queues. Therefore, the road-exit capacity and the queuing effects can be incorporated into the strategic transport model for traffic forecasting. The proposed model is applicable to the congested network particularly when the traffic demands exceeds the capacity of the network during the peak period. An efficient solution method is proposed for solving the steady-state traffic assignment problem with residual queues. Then a simple numerical example is employed to demonstrate the application of the proposedmore » model and solution method, while an example of a medium-sized arterial highway network in Sioux Falls, South Dakota, is used to test the applicability of the proposed solution to real problems.« less

Simulation of unsteady flow and solute transport in a tidal river network

USGS Publications Warehouse

Zhan, X.

2003-01-01

A mathematical model and numerical method for water flow and solute transport in a tidal river network is presented. The tidal river network is defined as a system of open channels of rivers with junctions and cross sections. As an example, the Pearl River in China is represented by a network of 104 channels, 62 nodes, and a total of 330 cross sections with 11 boundary section for one of the applications. The simulations are performed with a supercomputer for seven scenarios of water flow and/or solute transport in the Pearl River, China, with different hydrological and weather conditions. Comparisons with available data are shown. The intention of this study is to summarize previous works and to provide a useful tool for water environmental management in a tidal river network, particularly for the Pearl River, China.

Key technologies and concepts for beyond-3G networks

NASA Astrophysics Data System (ADS)

Pehkonen, Kari; Uskela, Sami; Kalliojarvi, Kari; Oksanen, Lauri; Rikkinen, Kari

2001-10-01

Standardization of 3rd Generation (3G) mobile communication systems has produced the first specification releases and the commercial deployment of the 3G systems has started. Whereas 1G and 2G focused on efficiently providing voice services, in 3G a lot of attention has been devoted to solutions that support both Circuit Switched (CS) and Packet Switched (PS) communication. That has called for very flexible air interface and network solutions. 3G will continue to evolve and there are already on-going standardization activities that will, for example, boost the peak data rates up to 5-10 Mbps and improve spectral efficiency by 2-4 times. In the future, 3G evolution will be going towards 10/100 Mbps peak data rates in wide/local are coverage, respectively. This will take place partly because of technical improvements of 3G radio interface solutions, but also due to network evolution which will allow the integration other radio access methods like radio LANs into the 3G system. In longer term the 3G network evolution will be going towards ALL-IP networks. As 3G evolution seems to be going towards 10 Mbps/100 Mbps peak data rates and ALL-IP networks any beyond 3G air interface or network solution should be clearly better in order to justify its technical and commercial feasibility. Given the long evolution time of 3G and integration of other radio access schemes with 3G radio we may not even see a new, complete beyond 3G system being developed. Maybe we will just witness the emergence of a new, more advanced radio access solution which will then be connected to the evolving 3G network. As 3G evolution will continue for several years to come the research targets for any beyond 3G solutions must be set very high. When it comes to air interface, we should aim at 100 Mbps peak data rates for wide area access with high mobility, and at 1 Gbps for local area access with low mobility. Regarding possible commercial launches of any beyond 3G systems or solutions they could then take place around year 2010 or even later.

So ware-Defined Network Solutions for Science Scenarios: Performance Testing Framework and Measurements

DOE Office of Scientific and Technical Information (OSTI.GOV)

Settlemyer, Bradley; Kettimuthu, R.; Boley, Josh

High-performance scientific work flows utilize supercomputers, scientific instruments, and large storage systems. Their executions require fast setup of a small number of dedicated network connections across the geographically distributed facility sites. We present Software-Defined Network (SDN) solutions consisting of site daemons that use dpctl, Floodlight, ONOS, or OpenDaylight controllers to set up these connections. The development of these SDN solutions could be quite disruptive to the infrastructure, while requiring a close coordination among multiple sites; in addition, the large number of possible controller and device combinations to investigate could make the infrastructure unavailable to regular users for extended periods ofmore » time. In response, we develop a Virtual Science Network Environment (VSNE) using virtual machines, Mininet, and custom scripts that support the development, testing, and evaluation of SDN solutions, without the constraints and expenses of multi-site physical infrastructures; furthermore, the chosen solutions can be directly transferred to production deployments. By complementing VSNE with a physical testbed, we conduct targeted performance tests of various SDN solutions to help choose the best candidates. In addition, we propose a switching response method to assess the setup times and throughput performances of different SDN solutions, and present experimental results that show their advantages and limitations.« less

Reasoning and Knowledge Acquisition Framework for 5G Network Analytics

PubMed Central

2017-01-01

Autonomic self-management is a key challenge for next-generation networks. This paper proposes an automated analysis framework to infer knowledge in 5G networks with the aim to understand the network status and to predict potential situations that might disrupt the network operability. The framework is based on the Endsley situational awareness model, and integrates automated capabilities for metrics discovery, pattern recognition, prediction techniques and rule-based reasoning to infer anomalous situations in the current operational context. Those situations should then be mitigated, either proactive or reactively, by a more complex decision-making process. The framework is driven by a use case methodology, where the network administrator is able to customize the knowledge inference rules and operational parameters. The proposal has also been instantiated to prove its adaptability to a real use case. To this end, a reference network traffic dataset was used to identify suspicious patterns and to predict the behavior of the monitored data volume. The preliminary results suggest a good level of accuracy on the inference of anomalous traffic volumes based on a simple configuration. PMID:29065473

Optimization of Close Range Photogrammetry Network Design Applying Fuzzy Computation

NASA Astrophysics Data System (ADS)

Aminia, A. S.

2017-09-01

Measuring object 3D coordinates with optimum accuracy is one of the most important issues in close range photogrammetry. In this context, network design plays an important role in determination of optimum position of imaging stations. This is, however, not a trivial task due to various geometric and radiometric constraints affecting the quality of the measurement network. As a result, most camera stations in the network are defined on a try and error basis based on the user's experience and generic network concept. In this paper, we propose a post-processing task to investigate the quality of camera positions right after image capturing to achieve the best result. To do this, a new fuzzy reasoning approach is adopted, in which the constraints affecting the network design are all modeled. As a result, the position of all camera locations is defined based on fuzzy rules and inappropriate stations are determined. The experiments carried out show that after determination and elimination of the inappropriate images using the proposed fuzzy reasoning system, the accuracy of measurements is improved and enhanced about 17% for the latter network.

Reasoning and Knowledge Acquisition Framework for 5G Network Analytics.

PubMed

Sotelo Monge, Marco Antonio; Maestre Vidal, Jorge; García Villalba, Luis Javier

2017-10-21

Autonomic self-management is a key challenge for next-generation networks. This paper proposes an automated analysis framework to infer knowledge in 5G networks with the aim to understand the network status and to predict potential situations that might disrupt the network operability. The framework is based on the Endsley situational awareness model, and integrates automated capabilities for metrics discovery, pattern recognition, prediction techniques and rule-based reasoning to infer anomalous situations in the current operational context. Those situations should then be mitigated, either proactive or reactively, by a more complex decision-making process. The framework is driven by a use case methodology, where the network administrator is able to customize the knowledge inference rules and operational parameters. The proposal has also been instantiated to prove its adaptability to a real use case. To this end, a reference network traffic dataset was used to identify suspicious patterns and to predict the behavior of the monitored data volume. The preliminary results suggest a good level of accuracy on the inference of anomalous traffic volumes based on a simple configuration.

Impact of orbit, clock and EOP errors in GNSS Precise Point Positioning

NASA Astrophysics Data System (ADS)

Hackman, C.

2012-12-01

Precise point positioning (PPP; [1]) has gained ever-increasing usage in GNSS carrier-phase positioning, navigation and timing (PNT) since its inception in the late 1990s. In this technique, high-precision satellite clocks, satellite ephemerides and earth-orientation parameters (EOPs) are applied as fixed input by the user in order to estimate receiver/location-specific quantities such as antenna coordinates, troposphere delay and receiver-clock corrections. This is in contrast to "network" solutions, in which (typically) less-precise satellite clocks, satellite ephemerides and EOPs are used as input, and in which these parameters are estimated simultaneously with the receiver/location-specific parameters. The primary reason for increased PPP application is that it offers most of the benefits of a network solution with a smaller computing cost. In addition, the software required to do PPP positioning can be simpler than that required for network solutions. Finally, PPP permits high-precision positioning of single or sparsely spaced receivers that may have few or no GNSS satellites in common view. A drawback of PPP is that the accuracy of the results depend directly on the accuracy of the supplied orbits, clocks and EOPs, since these parameters are not adjusted during the processing. In this study, we will examine the impact of orbit, EOP and satellite clock estimates on PPP solutions. Our primary focus will be the impact of these errors on station coordinates; however the study may be extended to error propagation into receiver-clock corrections and/or troposphere estimates if time permits. Study motivation: the United States Naval Observatory (USNO) began testing PPP processing using its own predicted orbits, clocks and EOPs in Summer 2012 [2]. The results of such processing could be useful for real- or near-real-time applications should they meet accuracy/precision requirements. Understanding how errors in satellite clocks, satellite orbits and EOPs propagate into PPP positioning and timing results allows researchers to focus their improvement efforts in areas most in need of attention. The initial study will be conducted using the simulation capabilities of Bernese GPS Software and extended to using real data if time permits. [1] J.F. Zumberge, M.B. Heflin, D.C. Jefferson, M.M. Watkins and F.H. Webb, Precise point positioning for the efficient and robust analysis of GPS data from large networks, J. Geophys. Res., 102(B3), 5005-5017, doi:10.1029/96JB03860, 1997. [2] C. Hackman, S.M. Byram, V.J. Slabinski and J.C. Tracey, Near-real-time and other high-precision GNSS-based orbit/clock/earth-orientation/troposphere parameters available from USNO, Proc. 2012 ION Joint Navigation Conference, 15 pp., in press, 2012.

fMRI reveals reciprocal inhibition between social and physical cognitive domains

PubMed Central

Jack, Anthony I.; Dawson, Abigail; Begany, Katelyn; Leckie, Regina L.; Barry, Kevin; Ciccia, Angela; Snyder, Abraham

2012-01-01

Two lines of evidence indicate that there exists a reciprocal inhibitory relationship between opposed brain networks. First, most attention-demanding cognitive tasks activate a stereotypical set of brain areas, known as the task-positive network and simultaneously deactivate a different set of brain regions, commonly referred to as the task negative or default mode network. Second, functional connectivity analyses show that these same opposed networks are anti-correlated in the resting state. We hypothesize that these reciprocally inhibitory effects reflect two incompatible cognitive modes, each of which is directed towards understanding the external world. Thus, engaging one mode activates one set of regions and suppresses activity in the other. We test this hypothesis by identifying two types of problem-solving task which, on the basis of prior work, have been consistently associated with the task positive and task negative regions: tasks requiring social cognition, i.e., reasoning about the mental states of other persons, and tasks requiring physical cognition, i.e., reasoning about the causal/mechanical properties of inanimate objects. Social and mechanical reasoning tasks were presented to neurologically normal participants during fMRI. Each task type was presented using both text and video clips. Regardless of presentation modality, we observed clear evidence of reciprocal suppression: social tasks deactivated regions associated with mechanical reasoning and mechanical tasks deactivated regions associated with social reasoning. These findings are not explained by self-referential processes, task engagement, mental simulation, mental time travel or external vs. internal attention, all factors previously hypothesized to explain default mode network activity. Analyses of resting state data revealed a close match between the regions our tasks identified as reciprocally inhibitory and regions of maximal anti-correlation in the resting state. These results indicate the reciprocal inhibition is not attributable to constraints inherent in the tasks, but is neural in origin. Hence, there is a physiological constraint on our ability to simultaneously engage two distinct cognitive modes. Further work is needed to more precisely characterize these opposing cognitive domains. PMID:23110882

Competent Reasoning with Rational Numbers.

ERIC Educational Resources Information Center

Smith, John P. III

1995-01-01

Analyzed students' reasoning with fractions. Found that skilled students applied strategies specifically tailored to restricted classes of fractions and produced reliable solutions with a minimum of computation effort. Results suggest that competent reasoning depends on a knowledge base that includes numerically specific and invented strategies,…

"I did not want to take that medicine": African-Americans' reasons for diabetes medication nonadherence and perceived solutions for enhancing adherence.

PubMed

Shiyanbola, Olayinka O; Brown, Carolyn M; Ward, Earlise C

2018-01-01

Diabetes is disproportionally burdensome among African-Americans (AAs) and medication adherence is important for optimal outcomes. Limited studies have qualitatively examined reasons for nonadherence among AAs with type 2 diabetes, though AAs are less adherent to prescribed medications compared to whites. This study explored the reasons for medication nonadherence and adherence among AAs with type 2 diabetes and examined AAs' perceived solutions for enhancing adherence. Forty AAs, age 45-60 years with type 2 diabetes for at least 1 year prior, taking at least one prescribed diabetes medication, participated in six semistructured 90-minute focus groups. Using a phenomenology qualitative approach, reasons for nonadherence and adherence, as well as participants' perceived solutions for increasing adherence were explored. Qualitative content analysis was conducted. AAs' reasons for intentional nonadherence were associated with 1) their perception of medicines including concerns about medication side effects, as well as fear and frustration associated with taking medicines; 2) their perception of illness (disbelief of diabetes diagnosis); and 3) access to medicines and information resources. Participants reported taking their medicines because they valued being alive to perform their social and family roles, and their belief in the doctor's recommendation and medication helpfulness. Participants provided solutions for enhancing adherence by focusing on the roles of health care providers, patients, and the church. AAs wanted provider counseling on the necessity of taking medicines and the consequences of not taking them, indicating the need for the AA community to support and teach self-advocacy in diabetes self-management, and the church to act as an advocate in ensuring medication use. Intentional reasons of AAs with type 2 diabetes for not taking their medicines were related to their perception of medicines and illness. Solutions for enhancing diabetes medication adherence among AAs should focus on the roles of providers, patients, and the church.

An economic analysis on optical Ethernet in the access network

NASA Astrophysics Data System (ADS)

Kim, Sung Hwi; Nam, Dohyun; Yoo, Gunil; Kim, WoonHa

2004-04-01

Nowadays, Broadband service subscribers have increased exponentially and have almost saturated in Korea. Several types of solutions for broadband service applied to the field. Among several types of broadband services, most of subscribers provided xDSL service like ADSL or VDSL. Usually, they who live in an apartment provided Internet service by Ntopia network as FTTC structure that is a dormant network in economical view at KT. Under competitive telecom environment for new services like video, we faced with needing to expand or rebuild portions of our access networks, are looking for ways to provide any service that competitors might offer presently or in the near future. In order to look for new business model like FTTH service, we consider deploying optical access network. In spite of numerous benefits of PON until now, we cannot believe that PON is the best solution in Korea. Because we already deployed optical access network of ring type feeder cable and have densely population of subscribers that mainly distributed inside 6km from central office. So we try to utilize an existing Ntopia network for FTTH service under optical access environment. Despite of such situations, we try to deploy PON solution in the field as FTTC or FTTH architecture. Therefore we analyze PON structure in comparison with AON structure in order to look for optimized structure in Korea. At first, we describe the existing optical access networks and network architecture briefly. Secondly we investigate the cost of building optical access networks by modeling cost functions on AON and PON structure which based on Ethernet protocol, and analyze two different network architectures according to different deployment scenarios: Urban, small town, rural. Finally we suggest the economic and best solution with PON structure to optimize to optical access environment of KT.

Implementing direct, spatially isolated problems on transputer networks

NASA Technical Reports Server (NTRS)

Ellis, Graham K.

1988-01-01

Parametric studies were performed on transputer networks of up to 40 processors to determine how to implement and maximize the performance of the solution of problems where no processor-to-processor data transfer is required for the problem solution (spatially isolated). Two types of problems are investigated a computationally intensive problem where the solution required the transmission of 160 bytes of data through the parallel network, and a communication intensive example that required the transmission of 3 Mbytes of data through the network. This data consists of solutions being sent back to the host processor and not intermediate results for another processor to work on. Studies were performed on both integer and floating-point transputers. The latter features an on-chip floating-point math unit and offers approximately an order of magnitude performance increase over the integer transputer on real valued computations. The results indicate that a minimum amount of work is required on each node per communication to achieve high network speedups (efficiencies). The floating-point processor requires approximately an order of magnitude more work per communication than the integer processor because of the floating-point unit's increased computing capacity.

Fronto-Parietal Network Reconfiguration Supports the Development of Reasoning Ability.

PubMed

Wendelken, Carter; Ferrer, Emilio; Whitaker, Kirstie J; Bunge, Silvia A

2016-05-01

The goal of this fMRI study was to examine how well developmental improvements in reasoning ability can be explained by changes in functional connectivity between specific nodes in prefrontal and parietal cortices. To this end, we examined connectivity within the lateral fronto-parietal network (LFPN) and its relation to reasoning ability in 132 children and adolescents aged 6-18 years, 56 of whom were scanned twice over the course of 1.5 years. Developmental changes in strength of connections within the LFPN were most prominent in late childhood and early adolescence. Reasoning ability was related to functional connectivity between left rostrolateral prefrontal cortex (RLPFC) and inferior parietal lobule (IPL), but only among 12-18-year olds. For 9-11-year olds, reasoning ability was most strongly related to connectivity between left and right RLPFC; this relationship was mediated by working memory. For 6-8-year olds, significant relationships between connectivity and performance were not observed; in this group, processing speed was the primary mediator of improvement in reasoning ability. We conclude that different connections best support reasoning at different points in development and that RLPFC-IPL connectivity becomes an important predictor of reasoning during adolescence. © The Author 2015. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

Audience effects on the neural correlates of relational reasoning in adolescence.

PubMed

Dumontheil, Iroise; Wolf, Laura K; Blakemore, Sarah-Jayne

2016-07-01

Adolescents are particularly sensitive to peer influence. This may partly be due to an increased salience of peers during adolescence. We investigated the effect of being observed by a peer on a cognitively challenging task, relational reasoning, which requires the evaluation and integration of multiple mental representations. Relational reasoning tasks engage a fronto-parietal network including the inferior parietal cortex, pre-supplementary motor area, dorsolateral and rostrolateral prefrontal cortices. Using functional magnetic resonance imaging (fMRI), peer audience effects on activation in this fronto-parietal network were compared in a group of 19 female mid-adolescents (aged 14-16 years) and 14 female adults (aged 23-28 years). Adolescent and adult relational reasoning accuracy was influenced by a peer audience as a function of task difficulty: the presence of a peer audience led to decreased accuracy in the complex, relational integration condition in both groups of participants. The fMRI results demonstrated that a peer audience differentially modulated activation in regions of the fronto-parietal network in adolescents and adults. Activation was increased in adolescents in the presence of a peer audience, while this was not the case in adults. Copyright © 2016 The Authors. Published by Elsevier Ltd.. All rights reserved.

Toward Rigorous Parameterization of Underconstrained Neural Network Models Through Interactive Visualization and Steering of Connectivity Generation

PubMed Central

Nowke, Christian; Diaz-Pier, Sandra; Weyers, Benjamin; Hentschel, Bernd; Morrison, Abigail; Kuhlen, Torsten W.; Peyser, Alexander

2018-01-01

Simulation models in many scientific fields can have non-unique solutions or unique solutions which can be difficult to find. Moreover, in evolving systems, unique final state solutions can be reached by multiple different trajectories. Neuroscience is no exception. Often, neural network models are subject to parameter fitting to obtain desirable output comparable to experimental data. Parameter fitting without sufficient constraints and a systematic exploration of the possible solution space can lead to conclusions valid only around local minima or around non-minima. To address this issue, we have developed an interactive tool for visualizing and steering parameters in neural network simulation models. In this work, we focus particularly on connectivity generation, since finding suitable connectivity configurations for neural network models constitutes a complex parameter search scenario. The development of the tool has been guided by several use cases—the tool allows researchers to steer the parameters of the connectivity generation during the simulation, thus quickly growing networks composed of multiple populations with a targeted mean activity. The flexibility of the software allows scientists to explore other connectivity and neuron variables apart from the ones presented as use cases. With this tool, we enable an interactive exploration of parameter spaces and a better understanding of neural network models and grapple with the crucial problem of non-unique network solutions and trajectories. In addition, we observe a reduction in turn around times for the assessment of these models, due to interactive visualization while the simulation is computed. PMID:29937723

Fusion solution for soldier wearable gunfire detection systems

NASA Astrophysics Data System (ADS)

Cakiades, George; Desai, Sachi; Deligeorges, Socrates; Buckland, Bruce E.; George, Jemin

2012-06-01

Currently existing acoustic based Gunfire Detection Systems (GDS) such as soldier wearable, vehicle mounted, and fixed site devices provide enemy detection and localization capabilities to the user. However, the solution to the problem of portability versus performance tradeoff remains elusive. The Data Fusion Module (DFM), described herein, is a sensor/platform agnostic software supplemental tool that addresses this tradeoff problem by leveraging existing soldier networks to enhance GDS performance across a Tactical Combat Unit (TCU). The DFM software enhances performance by leveraging all available acoustic GDS information across the TCU synergistically to calculate highly accurate solutions more consistently than any individual GDS in the TCU. The networked sensor architecture provides additional capabilities addressing the multiple shooter/fire-fight problems in addition to sniper detection/localization. The addition of the fusion solution to the overall Size, Weight and Power & Cost (SWaP&C) is zero to negligible. At the end of the first-year effort, the DFM integrated sensor network's performance was impressive showing improvements upwards of 50% in comparison to a single sensor solution. Further improvements are expected when the networked sensor architecture created in this effort is fully exploited.

Computer Network Security: Best Practices for Alberta School Jurisdictions.

ERIC Educational Resources Information Center

Alberta Dept. of Education, Edmonton.

This paper provides a snapshot of the computer network security industry and addresses specific issues related to network security in public education. The following topics are covered: (1) security policy, including reasons for establishing a policy, risk assessment, areas to consider, audit tools; (2) workstations, including physical security,…

Community-Based Social Networks: Generation of Power Law Degree Distribution and IP Solutions to the KPP

ERIC Educational Resources Information Center

Wu, Wentao

2012-01-01

The objective of this thesis is two-fold: (1) to investigate the degree distribution property of community-based social networks (CSNs) and (2) to provide solutions to a pertinent problem, the Key Player Problem. In the first part of this thesis, we consider a growing community-based network in which the ability of nodes competing for links to new…

Network Solutions.

ERIC Educational Resources Information Center

Vietzke, Robert; And Others

1996-01-01

This special section explains the latest developments in networking technologies, profiles school districts benefiting from successful implementations, and reviews new products for building networks. Highlights include ATM (asynchronous transfer mode), cable modems, networking switches, Internet screening software, file servers, network management…

Intensive reasoning training alters patterns of brain connectivity at rest

PubMed Central

Mackey, Allyson P.; Miller Singley, Alison T.; Bunge, Silvia A.

2013-01-01

Patterns of correlated activity among brain regions reflect functionally relevant networks that are widely assumed to be stable over time. We hypothesized that if these correlations reflect the prior history of co-activation of brain regions, then a marked shift in cognition could alter the strength of coupling between these regions. We sought to test whether intensive reasoning training in humans would result in tighter coupling among regions in the lateral fronto-parietal network, as measured with resting-state fMRI (rs-fMRI). Rather than designing an artificial training program, we studied individuals who were preparing for a standardized test that places heavy demands on relational reasoning, the Law School Admissions Test (LSAT). LSAT questions require test-takers to group or sequence items according to a set of complex rules. We recruited young adults who were enrolled in an LSAT course that offers 70 hours of reasoning instruction (n=25), and age- and IQ-matched controls intending to take the LSAT in the future (n=24). Rs-fMRI data were collected for all subjects during two scanning sessions separated by 90 days. An analysis of pairwise correlations between brain regions implicated in reasoning showed that fronto-parietal connections were strengthened, along with parietal-striatal connections. These findings provide strong evidence for neural plasticity at the level of large-scale networks supporting high-level cognition. PMID:23486950

Approximate reasoning-based learning and control for proximity operations and docking in space

NASA Technical Reports Server (NTRS)

Berenji, Hamid R.; Jani, Yashvant; Lea, Robert N.

1991-01-01

A recently proposed hybrid-neutral-network and fuzzy-logic-control architecture is applied to a fuzzy logic controller developed for attitude control of the Space Shuttle. A model using reinforcement learning and learning from past experience for fine-tuning its knowledge base is proposed. Two main components of this approximate reasoning-based intelligent control (ARIC) model - an action-state evaluation network and action selection network are described as well as the Space Shuttle attitude controller. An ARIC model for the controller is presented, and it is noted that the input layer in each network includes three nodes representing the angle error, angle error rate, and bias node. Preliminary results indicate that the controller can hold the pitch rate within its desired deadband and starts to use the jets at about 500 sec in the run.

Solution to the indexing problem of frequency domain simulation experiments

NASA Technical Reports Server (NTRS)

Mitra, Mousumi; Park, Stephen K.

1991-01-01

A frequency domain simulation experiment is one in which selected system parameters are oscillated sinusoidally to induce oscillations in one or more system statistics of interest. A spectral (Fourier) analysis of these induced oscillations is then performed. To perform this spectral analysis, all oscillation frequencies must be referenced to a common, independent variable - an oscillation index. In a discrete-event simulation, the global simulation clock is the most natural choice for the oscillation index. However, past efforts to reference all frequencies to the simulation clock generally yielded unsatisfactory results. The reason for these unsatisfactory results is explained in this paper and a new methodology which uses the simulation clock as the oscillation index is presented. Techniques for implementing this new methodology are demonstrated by performing a frequency domain simulation experiment for a network of queues.

Assessing Routing Strategies for Cognitive Radio Sensor Networks

PubMed Central

Zubair, Suleiman; Fisal, Norsheila; Baguda, Yakubu S.; Saleem, Kashif

2013-01-01

Interest in the cognitive radio sensor network (CRSN) paradigm has gradually grown among researchers. This concept seeks to fuse the benefits of dynamic spectrum access into the sensor network, making it a potential player in the next generation (NextGen) network, which is characterized by ubiquity. Notwithstanding its massive potential, little research activity has been dedicated to the network layer. By contrast, we find recent research trends focusing on the physical layer, the link layer and the transport layers. The fact that the cross-layer approach is imperative, due to the resource-constrained nature of CRSNs, can make the design of unique solutions non-trivial in this respect. This paper seeks to explore possible design opportunities with wireless sensor networks (WSNs), cognitive radio ad-hoc networks (CRAHNs) and cross-layer considerations for implementing viable CRSN routing solutions. Additionally, a detailed performance evaluation of WSN routing strategies in a cognitive radio environment is performed to expose research gaps. With this work, we intend to lay a foundation for developing CRSN routing solutions and to establish a basis for future work in this area. PMID:24077319

Network exploitation using WAMI tracks

NASA Astrophysics Data System (ADS)

Rimey, Ray; Record, Jim; Keefe, Dan; Kennedy, Levi; Cramer, Chris

2011-06-01

Creating and exploiting network models from wide area motion imagery (WAMI) is an important task for intelligence analysis. Tracks of entities observed moving in the WAMI sensor data are extracted, then large numbers of tracks are studied over long time intervals to determine specific locations that are visited (e.g., buildings in an urban environment), what locations are related to other locations, and the function of each location. This paper describes several parts of the network detection/exploitation problem, and summarizes a solution technique for each: (a) Detecting nodes; (b) Detecting links between known nodes; (c) Node attributes to characterize a node; (d) Link attributes to characterize each link; (e) Link structure inferred from node attributes and vice versa; and (f) Decomposing a detected network into smaller networks. Experimental results are presented for each solution technique, and those are used to discuss issues for each problem part and its solution technique.

A Dominance Analysis Approach to Determining Predictor Importance in Third, Seventh, and Tenth Grade Reading Comprehension Skills

PubMed Central

Tighe, Elizabeth; Schatschneider, Christopher

2015-01-01

The purpose of the present study was to investigate and rank order by importance the contributions of various cognitive predictors to reading comprehension in third, seventh, and tenth graders. An exploratory factor analysis revealed that for third grade, the best fit was a four-factor solution including Fluency, Verbal Reasoning, Nonverbal Reasoning, and Working Memory factors. For seventh and tenth grade, three-factor solutions with Fluency, Reasoning, and Working Memory factors were the best fit. The three and four-factor models were used in separate dominance analyses for each grade to rank order the factors by predictive importance to reading comprehension. Results indicated that Fluency and Verbal Reasoning were the most important predictors of third grade reading comprehension. For seventh grade, Fluency and Reasoning were the most important predictors. By tenth grade, Reasoning was the most important predictor of reading comprehension. Working Memory was the least predictive of reading comprehension across all grade levels. These results suggest that inferential reasoning skills become an important contributor to reading comprehension at increasing grade levels. PMID:26346315

Foreign Language Dropouts: Problems and Solutions. An Examination of the Reasons Why Students Do Not Continue Foreign Language Instruction and a List of Suggested Solutions to the Problem.

ERIC Educational Resources Information Center

Torres, Edgardo E.; And Others

This comprehensive investigation into the reasons behind the crucial problem of the student dropout in foreign language programs focuses on seven interrelated areas. These are: (1) student, (2) teacher, (3) administration, (4) counselor, (5) parent, (6) community, and (7) teacher training. A fault-tree analysis of the dropout problem provides a…

A Rawlsian approach to distribute responsibilities in networks.

PubMed

Doorn, Neelke

2010-06-01

Due to their non-hierarchical structure, socio-technical networks are prone to the occurrence of the problem of many hands. In the present paper an approach is introduced in which people's opinions on responsibility are empirically traced. The approach is based on the Rawlsian concept of Wide Reflective Equilibrium (WRE) in which people's considered judgments on a case are reflectively weighed against moral principles and background theories, ideally leading to a state of equilibrium. Application of the method to a hypothetical case with an artificially constructed network showed that it is possible to uncover the relevant data to assess a consensus amongst people in terms of their individual WRE. It appeared that the moral background theories people endorse are not predictive for their actual distribution of responsibilities but that they indicate ways of reasoning and justifying outcomes. Two ways of ascribing responsibilities were discerned, corresponding to two requirements of a desirable responsibility distribution: fairness and completeness. Applying the method triggered learning effects, both with regard to conceptual clarification and moral considerations, and in the sense that it led to some convergence of opinions. It is recommended to apply the method to a real engineering case in order to see whether this approach leads to an overlapping consensus on a responsibility distribution which is justifiable to all and in which no responsibilities are left unfulfilled, therewith trying to contribute to the solution of the problem of many hands.

The Brain Network for Deductive Reasoning: A Quantitative Meta-Analysis of 28 Neuroimaging Studies

ERIC Educational Resources Information Center

Prado, Jerome; Chadha, Angad; Booth, James R.

2011-01-01

Over the course of the past decade, contradictory claims have been made regarding the neural bases of deductive reasoning. Researchers have been puzzled by apparent inconsistencies in the literature. Some have even questioned the effectiveness of the methodology used to study the neural bases of deductive reasoning. However, the idea that…

Bifurcations in models of a society of reasonable contrarians and conformists

NASA Astrophysics Data System (ADS)

Bagnoli, Franco; Rechtman, Raúl

2015-10-01

We study models of a society composed of a mixture of conformist and reasonable contrarian agents that at any instant hold one of two opinions. Conformists tend to agree with the average opinion of their neighbors and reasonable contrarians tend to disagree, but revert to a conformist behavior in the presence of an overwhelming majority, in line with psychological experiments. The model is studied in the mean-field approximation and on small-world and scale-free networks. In the mean-field approximation, a large fraction of conformists triggers a polarization of the opinions, a pitchfork bifurcation, while a majority of reasonable contrarians leads to coherent oscillations, with an alternation of period-doubling and pitchfork bifurcations up to chaos. Similar scenarios are obtained by changing the fraction of long-range rewiring and the parameter of scale-free networks related to the average connectivity.

Bifurcations in models of a society of reasonable contrarians and conformists.

PubMed

Bagnoli, Franco; Rechtman, Raúl

2015-10-01

We study models of a society composed of a mixture of conformist and reasonable contrarian agents that at any instant hold one of two opinions. Conformists tend to agree with the average opinion of their neighbors and reasonable contrarians tend to disagree, but revert to a conformist behavior in the presence of an overwhelming majority, in line with psychological experiments. The model is studied in the mean-field approximation and on small-world and scale-free networks. In the mean-field approximation, a large fraction of conformists triggers a polarization of the opinions, a pitchfork bifurcation, while a majority of reasonable contrarians leads to coherent oscillations, with an alternation of period-doubling and pitchfork bifurcations up to chaos. Similar scenarios are obtained by changing the fraction of long-range rewiring and the parameter of scale-free networks related to the average connectivity.

The application of hybrid artificial intelligence systems for forecasting

NASA Astrophysics Data System (ADS)

Lees, Brian; Corchado, Juan

1999-03-01

The results to date are presented from an ongoing investigation, in which the aim is to combine the strengths of different artificial intelligence methods into a single problem solving system. The premise underlying this research is that a system which embodies several cooperating problem solving methods will be capable of achieving better performance than if only a single method were employed. The work has so far concentrated on the combination of case-based reasoning and artificial neural networks. The relative merits of artificial neural networks and case-based reasoning problem solving paradigms, and their combination are discussed. The integration of these two AI problem solving methods in a hybrid systems architecture, such that the neural network provides support for learning from past experience in the case-based reasoning cycle, is then presented. The approach has been applied to the task of forecasting the variation of physical parameters of the ocean. Results obtained so far from tests carried out in the dynamic oceanic environment are presented.

Choosing a CD-ROM Network Solution.

ERIC Educational Resources Information Center

Doering, David

1996-01-01

Discusses issues to consider in selecting a CD-ROM network solution, including throughput (speed of data delivery), security, access, servers, key features, training, jukebox support, documentation, and licenses. Reviews software products offered by Novell, Around Technology, Micro Design, Smart Storage, Microtest, Meridian, CD-Connection,…

Heterogeneity in Hydraulic Conductivity and Its Role on the Macroscale Transport of a Solute Plume from a Landfill: From Measurements to a Practical Application of Stochastic Flow and Transport Theory

NASA Astrophysics Data System (ADS)

Sudicky, E. A.; Illman, W. A.; Goltz, I. K.; Adams, J. J.; McLaren, R. G.

2008-12-01

The spatial variability of hydraulic conductivity in a shallow unconfined aquifer located at North Bay, Ontario composed of glacial-lacustrine and glacial-fluvial sands is examined in exceptional detail and characterized geostatistically. A total of 1878 permeameter measurements were performed at 0.05 m vertical intervals along cores taken from 20 boreholes along two intersecting transect lines. Simultaneous three-dimensional fitting of ln K variogram data to an exponential model yielded geostatistical parameters for the estimation of bulk hydraulic conductivity and solute dispersion parameters. The analysis revealed a ln K variance equal to about 2.0 and three-dimensional anisotropy of the correlation structure of the heterogeneity (λ 1, λ 2 and λ 3 equal to 17.19 m, 7.39 m and 1.0 m, respectively). Effective values of the hydraulic conductivity tensor and the value of the longitudinal macrodispersivity were calculated using the theoretical expressions of Gelhar and Axness (1983). The magnitude of the longitudinal macrodispersivity is reasonably consistent with the observed degree of longitudinal dispersion of the landfill plume along the principal path of migration. The prediction of the transverse dispersion suggests that the transverse-mixing process at the field scale is essentially controlled by local dispersion and diffusion. Variably-saturated 3D flow modeling using the statistically-derived effective hydraulic conductivity tensor allowed a reasonably close calibration to the measured water table and the observed heads at various depths in an array of piezometers. Concomitant transport modeling using the calculated longitudinal macrodispersivity, as well as local-scale values of the transverse dispersion parameters, reasonably predicted the extent and migration rates of the observed contaminant plume that was monitored using a network of multi-level samplers over a period of about 5 years. This study demonstrates that the use of statistically-derived parameters based on stochastic theories results in reliable large-scale 3D flow and transport models for complex hydrogeological systems. This is in agreement with the conclusions reached by Sudicky (1986) at the site of an elaborate tracer test conducted in the aquifer at the Canadian Forces Base Borden. This study represents one of the few attempts at validating stochastic theories of groundwater flow and solute transport in three-dimensions at a site where extensive field data have been collected.

Spatial-spectral flexible optical networking: enabling switching solutions for a simplified and efficient SDM network platform

NASA Astrophysics Data System (ADS)

Tomkos, I.; Zakynthinos, P.; Klonidis, D.; Marom, D.; Sygletos, S.; Ellis, A.; Salvadori, E.; Siracusa, D.; Angelou, M.; Papastergiou, G.; Psaila, N.; Ferran, J. F.; Ben-Ezra, S.; Jimenez, F.; Fernández-Palacios, J. P.

2013-12-01

The traffic carried by core optical networks grows at a steady but remarkable pace of 30-40% year-over-year. Optical transmissions and networking advancements continue to satisfy the traffic requirements by delivering the content over the network infrastructure in a cost and energy efficient manner. Such core optical networks serve the information traffic demands in a dynamic way, in response to requirements for shifting of traffics demands, both temporally (day/night) and spatially (business district/residential). However as we are approaching fundamental spectral efficiency limits of singlemode fibers, the scientific community is pursuing recently the development of an innovative, all-optical network architecture introducing the spatial degree of freedom when designing/operating future transport networks. Spacedivision- multiplexing through the use of bundled single mode fibers, and/or multi-core fibers and/or few-mode fibers can offer up to 100-fold capacity increase in future optical networks. The EU INSPACE project is working on the development of a complete spatial-spectral flexible optical networking solution, offering the network ultra-high capacity, flexibility and energy efficiency required to meet the challenges of delivering exponentially growing traffic demands in the internet over the next twenty years. In this paper we will present the motivation and main research activities of the INSPACE consortium towards the realization of the overall project solution.

Limit Theorems and Their Relation to Solute Transport in Simulated Fractured Media

NASA Astrophysics Data System (ADS)

Reeves, D. M.; Benson, D. A.; Meerschaert, M. M.

2003-12-01

Solute particles that travel through fracture networks are subject to wide velocity variations along a restricted set of directions. This may result in super-Fickian dispersion along a few primary scaling directions. The fractional advection-dispersion equation (FADE), a modification of the original advection-dispersion equation in which a fractional derivative replaces the integer-order dispersion term, has the ability to model rapid, non-Gaussian solute transport. The FADE assumes that solute particle motions converge to either α -stable or operator stable densities, which are modeled by spatial fractional derivatives. In multiple dimensions, the multi-fractional dispersion derivative dictates the order and weight of differentiation in all directions, which correspond to the statistics of large particle motions in all directions. This study numerically investigates the presence of super- Fickian solute transport through simulated two-dimensional fracture networks. An ensemble of networks is gen

Partial regularity of weak solutions to a PDE system with cubic nonlinearity

NASA Astrophysics Data System (ADS)

Liu, Jian-Guo; Xu, Xiangsheng

2018-04-01

In this paper we investigate regularity properties of weak solutions to a PDE system that arises in the study of biological transport networks. The system consists of a possibly singular elliptic equation for the scalar pressure of the underlying biological network coupled to a diffusion equation for the conductance vector of the network. There are several different types of nonlinearities in the system. Of particular mathematical interest is a term that is a polynomial function of solutions and their partial derivatives and this polynomial function has degree three. That is, the system contains a cubic nonlinearity. Only weak solutions to the system have been shown to exist. The regularity theory for the system remains fundamentally incomplete. In particular, it is not known whether or not weak solutions develop singularities. In this paper we obtain a partial regularity theorem, which gives an estimate for the parabolic Hausdorff dimension of the set of possible singular points.

A Six-Year Follow-Up Study of Social Network Changes among African-American, Caribbean, and U.S.-Born Caucasian Urban Older Adults

ERIC Educational Resources Information Center

Conway, Francine; Magai, Carol; Jones, Samuel; Fiori, Katherine; Gillespie, Michael

2013-01-01

This study explores dynamic changes in network size and composition by examining patterns of older adults' social network change over time, that is: types of movements; the reason for the loss of network members; and the relation of movement and composition in concert. This study is a 6-year follow up of changes in the social networks of U.S.-Born…

Multi-Frame Convolutional Neural Networks for Object Detection in Temporal Data

DTIC Science & Technology

2017-03-01

maximum 200 words) Given the problem of detecting objects in video , existing neural-network solutions rely on a post-processing step to combine...information across frames and strengthen conclusions. This technique has been successful for videos with simple, dominant objects but it cannot detect objects...Computer Science iii THIS PAGE INTENTIONALLY LEFT BLANK iv ABSTRACT Given the problem of detecting objects in video , existing neural-network solutions rely

General analytical solutions for DC/AC circuit-network analysis

NASA Astrophysics Data System (ADS)

Rubido, Nicolás; Grebogi, Celso; Baptista, Murilo S.

2017-06-01

In this work, we present novel general analytical solutions for the currents that are developed in the edges of network-like circuits when some nodes of the network act as sources/sinks of DC or AC current. We assume that Ohm's law is valid at every edge and that charge at every node is conserved (with the exception of the source/sink nodes). The resistive, capacitive, and/or inductive properties of the lines in the circuit define a complex network structure with given impedances for each edge. Our solution for the currents at each edge is derived in terms of the eigenvalues and eigenvectors of the Laplacian matrix of the network defined from the impedances. This derivation also allows us to compute the equivalent impedance between any two nodes of the circuit and relate it to currents in a closed circuit which has a single voltage generator instead of many input/output source/sink nodes. This simplifies the treatment that could be done via Thévenin's theorem. Contrary to solving Kirchhoff's equations, our derivation allows to easily calculate the redistribution of currents that occurs when the location of sources and sinks changes within the network. Finally, we show that our solutions are identical to the ones found from Circuit Theory nodal analysis.

Reason for high strength and good ductility in dual phase steels composed of soft ferrite and hard martensite

NASA Astrophysics Data System (ADS)

Terada, Daisuke; Ikeda, Gosuke; Park, Myeong-heom; Shibata, Akinobu; Tsuji, Nobuhiro

2017-07-01

Dual phase (DP) steels in which the microstructures are composed of a soft ferrite phase and a hard martensite phase are known to show good strain-hardening, high strength and large elongation, but reasons for their superior mechanical properties are still unclear. In the present study, two types of DP structures, having either networked martensite or isolated martensite were fabricated in a low-carbon steel by different heat treatment routes, and their tensile deformation behavior was analyzed using the digital image correlation (DIC) technique. It was revealed that the DP specimens having networked martensite microstructures showed a better strength-ductility balance than the DP specimens with isolated martensite structures. The microscopic DIC analysis of identical areas showed that the strain distribution within the DP microstructures was not uniform and the plastic strain was localized in soft ferrite grains. The strain localized regions tended to detour around hard martensite but eventually propagated across the martensite. It was found also from the DIC analysis that the degree of strain partitioning between ferrite and martensite in the networked DP structure was lower than that in the isolated DP structure. The deformation became more homogeneous when the hard phase (martensite) was connected to form a network structure, which could be one of the reasons for the better strength-ductility balance in the networked DP structure compared to that in the isolated DP structure.

Measure-valued solutions to nonlocal transport equations on networks

NASA Astrophysics Data System (ADS)

Camilli, Fabio; De Maio, Raul; Tosin, Andrea

2018-06-01

Aiming to describe traffic flow on road networks with long-range driver interactions, we study a nonlinear transport equation defined on an oriented network where the velocity field depends not only on the state variable but also on the distribution of the population. We prove existence, uniqueness and continuous dependence results of the solution intended in a suitable measure-theoretic sense. We also provide a representation formula in terms of the push-forward of the initial and boundary data along the network and discuss an explicit example of nonlocal velocity field fitting our framework.

Computation in Dynamically Bounded Asymmetric Systems

PubMed Central

Rutishauser, Ueli; Slotine, Jean-Jacques; Douglas, Rodney

2015-01-01

Previous explanations of computations performed by recurrent networks have focused on symmetrically connected saturating neurons and their convergence toward attractors. Here we analyze the behavior of asymmetrical connected networks of linear threshold neurons, whose positive response is unbounded. We show that, for a wide range of parameters, this asymmetry brings interesting and computationally useful dynamical properties. When driven by input, the network explores potential solutions through highly unstable ‘expansion’ dynamics. This expansion is steered and constrained by negative divergence of the dynamics, which ensures that the dimensionality of the solution space continues to reduce until an acceptable solution manifold is reached. Then the system contracts stably on this manifold towards its final solution trajectory. The unstable positive feedback and cross inhibition that underlie expansion and divergence are common motifs in molecular and neuronal networks. Therefore we propose that very simple organizational constraints that combine these motifs can lead to spontaneous computation and so to the spontaneous modification of entropy that is characteristic of living systems. PMID:25617645

Neural Network for Positioning Space Station Solar Arrays

NASA Technical Reports Server (NTRS)

Graham, Ronald E.; Lin, Paul P.

1994-01-01

As a shuttle approaches the Space Station Freedom for a rendezvous, the shuttle's reaction control jet firings pose a risk of excessive plume impingement loads on Freedom solar arrays. The current solution to this problem, in which the arrays are locked in a feathered position prior to the approach, may be neither accurate nor robust, and is also expensive. An alternative solution is proposed here: the active control of Freedom's beta gimbals during the approach, positioning the arrays dynamically in such a way that they remain feathered relative to the shuttle jet most likely to cause an impingement load. An artificial neural network is proposed as a means of determining the gimbal angles that would drive plume angle of attack to zero. Such a network would be both accurate and robust, and could be less expensive to implement than the current solution. A network was trained via backpropagation, and results, which compare favorably to the current solution as well as to some other alternatives, are presented. Other training options are currently being evaluated.

Networking CD-ROMs: A Tutorial Introduction.

ERIC Educational Resources Information Center

Perone, Karen

1996-01-01

Provides an introduction to CD-ROM networking. Highlights include LAN (local area network) architectures for CD-ROM networks, peer-to-peer networks, shared file and dedicated file servers, commercial software/vendor solutions, problems, multiple hardware platforms, and multimedia. Six figures illustrate network architectures and a sidebar contains…

47 CFR 51.313 - Just, reasonable and nondiscriminatory terms and conditions for the provision of unbundled...

Code of Federal Regulations, 2011 CFR

2011-10-01

... and conditions for the provision of unbundled network elements. 51.313 Section 51.313... terms and conditions for the provision of unbundled network elements. (a) The terms and conditions pursuant to which an incumbent LEC provides access to unbundled network elements shall be offered equally...

47 CFR 51.313 - Just, reasonable and nondiscriminatory terms and conditions for the provision of unbundled...

Code of Federal Regulations, 2010 CFR

2010-10-01

... and conditions for the provision of unbundled network elements. 51.313 Section 51.313... terms and conditions for the provision of unbundled network elements. (a) The terms and conditions pursuant to which an incumbent LEC provides access to unbundled network elements shall be offered equally...

75 FR 16123 - Dave & Buster’s, Inc.; Analysis of Proposed Consent Order to Aid Public Comment

Federal Register 2010, 2011, 2012, 2013, 2014

2010-03-31

... computer networks or to conduct security investigations, such as by employing an intrusion detection system and monitoring system logs; (b) failed to adequately restrict third-party access to its networks, such... reasonable and appropriate security for personal information on its computer networks. Among other things...

A model for distribution centers location-routing problem on a multimodal transportation network with a meta-heuristic solving approach

NASA Astrophysics Data System (ADS)

Fazayeli, Saeed; Eydi, Alireza; Kamalabadi, Isa Nakhai

2017-07-01

Nowadays, organizations have to compete with different competitors in regional, national and international levels, so they have to improve their competition capabilities to survive against competitors. Undertaking activities on a global scale requires a proper distribution system which could take advantages of different transportation modes. Accordingly, the present paper addresses a location-routing problem on multimodal transportation network. The introduced problem follows four objectives simultaneously which form main contribution of the paper; determining multimodal routes between supplier and distribution centers, locating mode changing facilities, locating distribution centers, and determining product delivery tours from the distribution centers to retailers. An integer linear programming is presented for the problem, and a genetic algorithm with a new chromosome structure proposed to solve the problem. Proposed chromosome structure consists of two different parts for multimodal transportation and location-routing parts of the model. Based on published data in the literature, two numerical cases with different sizes generated and solved. Also, different cost scenarios designed to better analyze model and algorithm performance. Results show that algorithm can effectively solve large-size problems within a reasonable time which GAMS software failed to reach an optimal solution even within much longer times.

A model for distribution centers location-routing problem on a multimodal transportation network with a meta-heuristic solving approach

NASA Astrophysics Data System (ADS)

Fazayeli, Saeed; Eydi, Alireza; Kamalabadi, Isa Nakhai

2018-07-01

Nowadays, organizations have to compete with different competitors in regional, national and international levels, so they have to improve their competition capabilities to survive against competitors. Undertaking activities on a global scale requires a proper distribution system which could take advantages of different transportation modes. Accordingly, the present paper addresses a location-routing problem on multimodal transportation network. The introduced problem follows four objectives simultaneously which form main contribution of the paper; determining multimodal routes between supplier and distribution centers, locating mode changing facilities, locating distribution centers, and determining product delivery tours from the distribution centers to retailers. An integer linear programming is presented for the problem, and a genetic algorithm with a new chromosome structure proposed to solve the problem. Proposed chromosome structure consists of two different parts for multimodal transportation and location-routing parts of the model. Based on published data in the literature, two numerical cases with different sizes generated and solved. Also, different cost scenarios designed to better analyze model and algorithm performance. Results show that algorithm can effectively solve large-size problems within a reasonable time which GAMS software failed to reach an optimal solution even within much longer times.

Mathematical Reasoning in Teachers' Presentations

ERIC Educational Resources Information Center

Bergqvist, Tomas; Lithner, Johan

2012-01-01

This paper presents a study of the opportunities presented to students that allow them to learn different types of mathematical reasoning during teachers' ordinary task solving presentations. The characteristics of algorithmic and creative reasoning that are seen in the presentations are analyzed. We find that most task solutions are based on…

Pre-Service Primary School Teachers' Logical Reasoning Skills

ERIC Educational Resources Information Center

Marchis, Iuliana

2013-01-01

Logical reasoning skills are important for a successful mathematical learning and in students' future career. These skills are essential for a primary school teacher, because they need to explain solving methods and solutions to their pupils. In this research we studied pre-service primary school teachers' logical reasoning skills. The results…

Exact solutions for rate and synchrony in recurrent networks of coincidence detectors.

PubMed

Mikula, Shawn; Niebur, Ernst

2008-11-01

We provide analytical solutions for mean firing rates and cross-correlations of coincidence detector neurons in recurrent networks with excitatory or inhibitory connectivity, with rate-modulated steady-state spiking inputs. We use discrete-time finite-state Markov chains to represent network state transition probabilities, which are subsequently used to derive exact analytical solutions for mean firing rates and cross-correlations. As illustrated in several examples, the method can be used for modeling cortical microcircuits and clarifying single-neuron and population coding mechanisms. We also demonstrate that increasing firing rates do not necessarily translate into increasing cross-correlations, though our results do support the contention that firing rates and cross-correlations are likely to be coupled. Our analytical solutions underscore the complexity of the relationship between firing rates and cross-correlations.

Efficiency gain from elastic optical networks

NASA Astrophysics Data System (ADS)

Morea, Annalisa; Rival, Olivier

2011-12-01

We compare the cost-efficiency of optical networks based on mixed datarates (10, 40, 100Gb/s) and datarateelastic technologies. A European backbone network is examined under various traffic assumptions (volume of transported data per demand and total number of demands) to better understand the impact of traffic characteristics on cost-efficiency. Network dimensioning is performed for static and restorable networks (resilient to one-link failure). In this paper we will investigate the trade-offs between price of interfaces, reach and reconfigurability, showing that elastic solutions can be more cost-efficient than mixed-rate solutions because of the better compatibility between different datarates, increased reach of channels and simplified wavelength allocation.

Study on the influence of stochastic properties of correction terms on the reliability of instantaneous network RTK

NASA Astrophysics Data System (ADS)

Próchniewicz, Dominik

2014-03-01

The reliability of precision GNSS positioning primarily depends on correct carrier-phase ambiguity resolution. An optimal estimation and correct validation of ambiguities necessitates a proper definition of mathematical positioning model. Of particular importance in the model definition is the taking into account of the atmospheric errors (ionospheric and tropospheric refraction) as well as orbital errors. The use of the network of reference stations in kinematic positioning, known as Network-based Real-Time Kinematic (Network RTK) solution, facilitates the modeling of such errors and their incorporation, in the form of correction terms, into the functional description of positioning model. Lowered accuracy of corrections, especially during atmospheric disturbances, results in the occurrence of unaccounted biases, the so-called residual errors. The taking into account of such errors in Network RTK positioning model is possible by incorporating the accuracy characteristics of the correction terms into the stochastic model of observations. In this paper we investigate the impact of the expansion of the stochastic model to include correction term variances on the reliability of the model solution. In particular the results of instantaneous solution that only utilizes a single epoch of GPS observations, is analyzed. Such a solution mode due to the low number of degrees of freedom is very sensitive to an inappropriate mathematical model definition. Thus the high level of the solution reliability is very difficult to achieve. Numerical tests performed for a test network located in mountain area during ionospheric disturbances allows to verify the described method for the poor measurement conditions. The results of the ambiguity resolution as well as the rover positioning accuracy shows that the proposed method of stochastic modeling can increase the reliability of instantaneous Network RTK performance.

Transportation Network Analysis and Decomposition Methods

DOT National Transportation Integrated Search

1978-03-01

The report outlines research in transportation network analysis using decomposition techniques as a basis for problem solutions. Two transportation network problems were considered in detail: a freight network flow problem and a scheduling problem fo...

Fluid Intelligence Allows Flexible Recruitment of the Parieto-Frontal Network in Analogical Reasoning

PubMed Central

Preusse, Franziska; Elke, van der Meer; Deshpande, Gopikrishna; Krueger, Frank; Wartenburger, Isabell

2011-01-01

Fluid intelligence is the ability to think flexibly and to understand abstract relations. People with high fluid intelligence (hi-fluIQ) perform better in analogical reasoning tasks than people with average fluid intelligence (ave-fluIQ). Although previous neuroimaging studies reported involvement of parietal and frontal brain regions in geometric analogical reasoning (which is a prototypical task for fluid intelligence), however, neuroimaging findings on geometric analogical reasoning in hi-fluIQ are sparse. Furthermore, evidence on the relation between brain activation and intelligence while solving cognitive tasks is contradictory. The present study was designed to elucidate the cerebral correlates of geometric analogical reasoning in a sample of hi-fluIQ and ave-fluIQ high school students. We employed a geometric analogical reasoning task with graded levels of task difficulty and confirmed the involvement of the parieto-frontal network in solving this task. In addition to characterizing the brain regions involved in geometric analogical reasoning in hi-fluIQ and ave-fluIQ, we found that blood oxygenation level dependency (BOLD) signal changes were greater for hi-fluIQ than for ave-fluIQ in parietal brain regions. However, ave-fluIQ showed greater BOLD signal changes in the anterior cingulate cortex and medial frontal gyrus than hi-fluIQ. Thus, we showed that a similar network of brain regions is involved in geometric analogical reasoning in both groups. Interestingly, the relation between brain activation and intelligence is not mono-directional, but rather, it is specific for each brain region. The negative brain activation–intelligence relationship in frontal brain regions in hi-fluIQ goes along with a better behavioral performance and reflects a lower demand for executive monitoring compared to ave-fluIQ individuals. In conclusion, our data indicate that flexibly modulating the extent of regional cerebral activity is characteristic for fluid intelligence. PMID:21415916

a Schema for Extraction of Indoor Pedestrian Navigation Grid Network from Floor Plans

NASA Astrophysics Data System (ADS)

Niu, Lei; Song, Yiquan

2016-06-01

The requirement of the indoor navigation related tasks such emergency evacuation calls for efficient solutions for handling data sources. Therefore, the navigation grid extraction from existing floor plans draws attentions. To this, we have to thoroughly analyse the source data, such as Autocad dxf files. Then, we could establish a sounding navigation solution, which firstly complements the basic navigation rectangle boundaries, secondly subdivides these rectangles and finally generates accessible networks with these refined rectangles. Test files are introduced to validate the whole workflow and evaluate the solution performance. In conclusion, we have achieved the preliminary step of forming up accessible network from the navigation grids.

Legitimate data in remote monitoring.

PubMed

Schilling, J D

2009-01-01

An approach for ensuring legitimate data transfers of an individual within a remote healthcare solution. Biometric traits and networking are discussed for clarification of the approach. In this approach, a biometric solution is identified as a fingerprint scanner for use in a personal area network of the patient's home. Secure data exchange is acknowledged as a potential weakness in the transferring of patient data within this network. Some options are discussed to ensure security of data for the review by the caregiver. Example approaches regarding legitimacy are identified using a pulse oximeter [1], a blood pressure meter, and a weight scale as the remote patient devices in the remote healthcare solution.

Convergence and approximate calculation of average degree under different network sizes for decreasing random birth-and-death networks

NASA Astrophysics Data System (ADS)

Long, Yin; Zhang, Xiao-Jun; Wang, Kui

2018-05-01

In this paper, convergence and approximate calculation of average degree under different network sizes for decreasing random birth-and-death networks (RBDNs) are studied. First, we find and demonstrate that the average degree is convergent in the form of power law. Meanwhile, we discover that the ratios of the back items to front items of convergent reminder are independent of network link number for large network size, and we theoretically prove that the limit of the ratio is a constant. Moreover, since it is difficult to calculate the analytical solution of the average degree for large network sizes, we adopt numerical method to obtain approximate expression of the average degree to approximate its analytical solution. Finally, simulations are presented to verify our theoretical results.

Design Principles of Regulatory Networks: Searching for the Molecular Algorithms of the Cell

PubMed Central

Lim, Wendell A.; Lee, Connie M.; Tang, Chao

2013-01-01

A challenge in biology is to understand how complex molecular networks in the cell execute sophisticated regulatory functions. Here we explore the idea that there are common and general principles that link network structures to biological functions, principles that constrain the design solutions that evolution can converge upon for accomplishing a given cellular task. We describe approaches for classifying networks based on abstract architectures and functions, rather than on the specific molecular components of the networks. For any common regulatory task, can we define the space of all possible molecular solutions? Such inverse approaches might ultimately allow the assembly of a design table of core molecular algorithms that could serve as a guide for building synthetic networks and modulating disease networks. PMID:23352241

Bayesian networks in neuroscience: a survey.

PubMed

Bielza, Concha; Larrañaga, Pedro

2014-01-01

Bayesian networks are a type of probabilistic graphical models lie at the intersection between statistics and machine learning. They have been shown to be powerful tools to encode dependence relationships among the variables of a domain under uncertainty. Thanks to their generality, Bayesian networks can accommodate continuous and discrete variables, as well as temporal processes. In this paper we review Bayesian networks and how they can be learned automatically from data by means of structure learning algorithms. Also, we examine how a user can take advantage of these networks for reasoning by exact or approximate inference algorithms that propagate the given evidence through the graphical structure. Despite their applicability in many fields, they have been little used in neuroscience, where they have focused on specific problems, like functional connectivity analysis from neuroimaging data. Here we survey key research in neuroscience where Bayesian networks have been used with different aims: discover associations between variables, perform probabilistic reasoning over the model, and classify new observations with and without supervision. The networks are learned from data of any kind-morphological, electrophysiological, -omics and neuroimaging-, thereby broadening the scope-molecular, cellular, structural, functional, cognitive and medical- of the brain aspects to be studied.

Bayesian networks in neuroscience: a survey

PubMed Central

Bielza, Concha; Larrañaga, Pedro

2014-01-01

Bayesian networks are a type of probabilistic graphical models lie at the intersection between statistics and machine learning. They have been shown to be powerful tools to encode dependence relationships among the variables of a domain under uncertainty. Thanks to their generality, Bayesian networks can accommodate continuous and discrete variables, as well as temporal processes. In this paper we review Bayesian networks and how they can be learned automatically from data by means of structure learning algorithms. Also, we examine how a user can take advantage of these networks for reasoning by exact or approximate inference algorithms that propagate the given evidence through the graphical structure. Despite their applicability in many fields, they have been little used in neuroscience, where they have focused on specific problems, like functional connectivity analysis from neuroimaging data. Here we survey key research in neuroscience where Bayesian networks have been used with different aims: discover associations between variables, perform probabilistic reasoning over the model, and classify new observations with and without supervision. The networks are learned from data of any kind–morphological, electrophysiological, -omics and neuroimaging–, thereby broadening the scope–molecular, cellular, structural, functional, cognitive and medical– of the brain aspects to be studied. PMID:25360109

Solute transport in streams of varying morphology inferred from a high resolution network of potentiometric wireless chloride sensors

NASA Astrophysics Data System (ADS)

Klaus, Julian; Smettem, Keith; Pfister, Laurent; Harris, Nick

2017-04-01

There is ongoing interest in understanding and quantifying the travel times and dispersion of solutes moving through stream environments, including the hyporheic zone and/or in-channel dead zones where retention affects biogeochemical cycling processes that are critical to stream ecosystem functioning. Modelling these transport and retention processes requires acquisition of tracer data from injection experiments where the concentrations are recorded downstream. Such experiments are often time consuming and costly, which may be the reason many modelling studies of chemical transport have tended to rely on relatively few well documented field case studies. This leads to the need of fast and cheap distributed sensor arrays that respond instantly and record chemical transport at points of interest on timescales of seconds at various locations in the stream environment. To tackle this challenge we present data from several tracer experiments carried out in the Attert river catchment in Luxembourg employing low-cost (in the order of a euro per sensor) potentiometric chloride sensors in a distributed array. We injected NaCl under various baseflow conditions in streams of different morphologies and observed solute transport at various distances and locations. This data is used to benchmark the sensors to data obtained from more expensive electrical conductivity meters. Furthermore, the data allowed spatial resolution of hydrodynamic mixing processes and identification of chemical 'dead zones' in the study reaches.

Deformation analysis of the unified lunar control networks

NASA Astrophysics Data System (ADS)

Iz, H. Bâki; Chen, Yong Qi; King, Bruce Anthony; Ding, Xiaoli; Wu, Chen

2009-12-01

This study compares the latest Unified Lunar Control Network, ULCN 2005, solution with the earlier ULCN 1994 solution at global and local scales. At the global scale, the relative rotation, translation, and deformation (normal strains and shears) parameters between the two networks are estimated as a whole using their colocated station Cartesian coordinate differences. At the local scale, the network station coordinate differences are examined in local topocentric coordinate systems whose origins are located at the geometric center of quadrangles and tetrahedrons. This study identified that the omission of the topography in the old ULCN solutions shifted the geometric center of the lunar figure up to 5 km in the lunar equatorial plane and induced a few hundred-meter level global rotations of the ULCN 1994 reference frame with respect to ULCN 2005. The displacements between the old and new control networks are less than ± 2 km on the average at the local scale, which behave like translations, caused by the omission of lunar topography in the earlier solution. The contribution of local rigid body rotations and dilatational and compressional components to the local displacements are approximately ± 100 m for a quadrangle/tetrahedron of an average side length of 10 km.

From efficacy research to large-scale impact on undernutrition: the role of organizational cultures.

PubMed

Pelletier, David; Pelto, Gretel

2013-11-01

Undernutrition in low-income countries is receiving unprecedented attention at global and national levels due to the convergence of many forces, including strong evidence concerning its magnitude, consequences, and potential solutions and effective advocacy by many organizations. The translation of this attention into large-scale reductions in undernutrition at the country level requires the alignment and support of many organizations in the development and implementation of a coherent policy agenda for nutrition, including the strengthening of operational and strategic capacities and a supportive research agenda. However, many countries experience difficulties achieving such alignment. This article uses the concept of organizational culture to better understand some of the reasons for these difficulties. This concept is applied to the constellation of organizations that make up the "National Nutrition Network" in a given country and some of the individual organizations within that network, including academic institutions that conduct research on undernutrition. We illustrate this concept through a case study involving a middle-income country. We conclude that efforts to align organizations in support of coherent nutrition agendas should do the following: 1) make intentional and sustained efforts to foster common understanding, shared learning, and socialization of new members and other elements of a shared culture among partners; 2) seek a way to frame problems and solutions in a fashion that enables individual organizations to secure some of their particular interests by joining the effort; and 3) not only advocate on the importance of nutrition but also insist that high-level officials hold organizations accountable for aligning in support of common-interest solutions (through some elements of a common culture) that can be effective and appropriate in the national context. We further conclude that a culture change is needed within academic departments if the discipline of nutrition is to play a central role in translating the findings from efficacy trials into large-scale reductions in undernutrition.

Proceedings of the Government Neural Network Applications Workshop Held at Wright-Patterson AFB, Ohio on August 24-26, 1992. Volume 1

DTIC Science & Technology

1992-08-01

history trace of input u(t). (b) A common network struc- 1 ture makes use of the feedforward tapped delay line. For this structure the memory depth D...theories and analyses that will be used world- wide for a long time to come. The reason for this contribution has generally been the government’s need to...that emulate the neural reasoning behavior of biological neural systems (e.g. the human brain). As such, they are loosely based on biological neural

Particle swarm optimization-based automatic parameter selection for deep neural networks and its applications in large-scale and high-dimensional data

PubMed Central

2017-01-01

In this paper, we propose a new automatic hyperparameter selection approach for determining the optimal network configuration (network structure and hyperparameters) for deep neural networks using particle swarm optimization (PSO) in combination with a steepest gradient descent algorithm. In the proposed approach, network configurations were coded as a set of real-number m-dimensional vectors as the individuals of the PSO algorithm in the search procedure. During the search procedure, the PSO algorithm is employed to search for optimal network configurations via the particles moving in a finite search space, and the steepest gradient descent algorithm is used to train the DNN classifier with a few training epochs (to find a local optimal solution) during the population evaluation of PSO. After the optimization scheme, the steepest gradient descent algorithm is performed with more epochs and the final solutions (pbest and gbest) of the PSO algorithm to train a final ensemble model and individual DNN classifiers, respectively. The local search ability of the steepest gradient descent algorithm and the global search capabilities of the PSO algorithm are exploited to determine an optimal solution that is close to the global optimum. We constructed several experiments on hand-written characters and biological activity prediction datasets to show that the DNN classifiers trained by the network configurations expressed by the final solutions of the PSO algorithm, employed to construct an ensemble model and individual classifier, outperform the random approach in terms of the generalization performance. Therefore, the proposed approach can be regarded an alternative tool for automatic network structure and parameter selection for deep neural networks. PMID:29236718

Highly sensitive response of solution-processed bismuth sulfide nanobelts for room-temperature nitrogen dioxide detection.

PubMed

Kan, Hao; Li, Min; Song, Zhilong; Liu, Sisi; Zhang, Baohui; Liu, Jingyao; Li, Ming-Yu; Zhang, Guangzu; Jiang, ShengLin; Liu, Huan

2017-11-15

Low dimensional nanomaterials have emerged as candidates for gas sensors owing to their unique size-dependent properties. In this paper, Bi 2 S 3 nanobelts were synthesized via a facile solvothermal process and spin-coated onto alumina substrates at room temperature. The conductometric devices can even sensitively response to the relatively low concentrations of NO 2 at room temperature, and their sensing performance can be effectively enhanced by the ligand exchange treatment with inorganic salts. The Pb(NO 3 ) 2 -treated device exhibited superior sensing performance of 58.8 under 5ppm NO 2 at room-temperature, with the response and recovery time of 28 and 106s. The competitive adsorption of NO 2 against O 2 on Bi 2 S 3 nanobelts, with the enhancement both in gas adsorption and charge transfer caused by the porous network of the very thin Bi 2 S 3 nanobelts, can be a reasonable explanation for the improved performance at room temperature. Their sensitive room-temperature response behaviors combined with the excellent solution processability, made Bi 2 S 3 nanobelts very attractive for the construction of low-cost gas sensors with lower power consumption. Copyright © 2017 Elsevier Inc. All rights reserved.

Proceedings of the Second Joint Technology Workshop on Neural Networks and Fuzzy Logic, volume 2

NASA Technical Reports Server (NTRS)

Lea, Robert N. (Editor); Villarreal, James A. (Editor)

1991-01-01

Documented here are papers presented at the Neural Networks and Fuzzy Logic Workshop sponsored by NASA and the University of Texas, Houston. Topics addressed included adaptive systems, learning algorithms, network architectures, vision, robotics, neurobiological connections, speech recognition and synthesis, fuzzy set theory and application, control and dynamics processing, space applications, fuzzy logic and neural network computers, approximate reasoning, and multiobject decision making.

Parallel Mutual Information Based Construction of Genome-Scale Networks on the Intel® Xeon Phi™ Coprocessor.

PubMed

Misra, Sanchit; Pamnany, Kiran; Aluru, Srinivas

2015-01-01

Construction of whole-genome networks from large-scale gene expression data is an important problem in systems biology. While several techniques have been developed, most cannot handle network reconstruction at the whole-genome scale, and the few that can, require large clusters. In this paper, we present a solution on the Intel Xeon Phi coprocessor, taking advantage of its multi-level parallelism including many x86-based cores, multiple threads per core, and vector processing units. We also present a solution on the Intel® Xeon® processor. Our solution is based on TINGe, a fast parallel network reconstruction technique that uses mutual information and permutation testing for assessing statistical significance. We demonstrate the first ever inference of a plant whole genome regulatory network on a single chip by constructing a 15,575 gene network of the plant Arabidopsis thaliana from 3,137 microarray experiments in only 22 minutes. In addition, our optimization for parallelizing mutual information computation on the Intel Xeon Phi coprocessor holds out lessons that are applicable to other domains.

Modulation of the cortical false belief network during development.

PubMed

Sommer, Monika; Meinhardt, Jörg; Eichenmüller, Kerstin; Sodian, Beate; Döhnel, Katrin; Hajak, Göran

2010-10-01

The ability to represent false beliefs is commonly considered as to be the critical test for having a Theory of Mind (ToM). For correct predictions or explanations of other peoples' behavior it is necessary to understand that mental states are sometimes independent of reality and misrepresent the real state of the world. In contrast, when people hold true beliefs, predictions and explanations about behavior can simply be derived from reality. Previous neuroimaging studies with adults suggest that the dorsal medial prefrontal cortex (dmPFC) and the right temporo-parietal junction (rTPJ) are engaged in false belief reasoning. However, studies investigating the neural correlates of belief reasoning in children are rare. Using cartoon stories that depicted an unexpected transfer, we compared false belief reasoning with true belief reasoning in children of a narrow age range between 10 and 12years and in adults. In both groups, the dorsal medial frontal cortex was activated during false versus true belief reasoning. In contrast to adults, children did not selectively recruit the rTPJ during false belief reasoning. We found a group by belief interaction in the right rostral PFC and the posterior cingulate cortex. In these areas, children compared to adults showed increased activity associated with false belief reasoning in contrast to true belief reasoning. These results implicate modulation of the cortical network that underlies false belief reasoning during development and far beyond the time children successfully master false belief tasks. Copyright (c) 2010 Elsevier B.V. All rights reserved.

New solutions for climate network visualization

NASA Astrophysics Data System (ADS)

Nocke, Thomas; Buschmann, Stefan; Donges, Jonathan F.; Marwan, Norbert

2016-04-01

An increasing amount of climate and climate impact research methods deals with geo-referenced networks, including energy, trade, supply-chain, disease dissemination and climatic tele-connection networks. At the same time, the size and complexity of these networks increases, resulting in networks of more than hundred thousand or even millions of edges, which are often temporally evolving, have additional data at nodes and edges, and can consist of multiple layers even in real 3D. This gives challenges to both the static representation and the interactive exploration of these networks, first of all avoiding edge clutter ("edge spagetti") and allowing interactivity even for unfiltered networks. Within this presentation, we illustrate potential solutions to these challenges. Therefore, we give a glimpse on a questionnaire performed with climate and complex system scientists with respect to their network visualization requirements, and on a review of available state-of-the-art visualization techniques and tools for this purpose (see as well Nocke et al., 2015). In the main part, we present alternative visualization solutions for several use cases (global, regional, and multi-layered climate networks) including alternative geographic projections, edge bundling, and 3-D network support (based on CGV and GTX tools), and implementation details to reach interactive frame rates. References: Nocke, T., S. Buschmann, J. F. Donges, N. Marwan, H.-J. Schulz, and C. Tominski: Review: Visual analytics of climate networks, Nonlinear Processes in Geophysics, 22, 545-570, doi:10.5194/npg-22-545-2015, 2015

Development of a pore network simulation model to study nonaqueous phase liquid dissolution

USGS Publications Warehouse

Dillard, Leslie A.; Blunt, Martin J.

2000-01-01

A pore network simulation model was developed to investigate the fundamental physics of nonequilibrium nonaqueous phase liquid (NAPL) dissolution. The network model is a lattice of cubic chambers and rectangular tubes that represent pore bodies and pore throats, respectively. Experimental data obtained by Powers [1992] were used to develop and validate the model. To ensure the network model was representative of a real porous medium, the pore size distribution of the network was calibrated by matching simulated and experimental drainage and imbibition capillary pressure‐saturation curves. The predicted network residual styrene blob‐size distribution was nearly identical to the observed distribution. The network model reproduced the observed hydraulic conductivity and produced relative permeability curves that were representative of a poorly consolidated sand. Aqueous‐phase transport was represented by applying the equation for solute flux to the network tubes and solving for solute concentrations in the network chambers. Complete mixing was found to be an appropriate approximation for calculation of chamber concentrations. Mass transfer from NAPL blobs was represented using a corner diffusion model. Predicted results of solute concentration versus Peclet number and of modified Sherwood number versus Peclet number for the network model compare favorably with experimental data for the case in which NAPL blob dissolution was negligible. Predicted results of normalized effluent concentration versus pore volume for the network were similar to the experimental data for the case in which NAPL blob dissolution occurred with time.

Accountability Tanks Calibration Data Analysis

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wendelberger, James G.; Salazar, William Richard; Finstad, Casey Charles

2017-04-25

MET-1 utilizes tanks to store plutonium in solution. The Nuclear Material Control & Accountability group at LANL requires that MET-1 be able to determine the amount of SNM remaining in solution in the tanks for accountability purposes. For this reason it is desired to determine how well various operators may read the volume of liquid left in the tank with the tank measurement device (glass column or slab). The accuracy of the measurement is then compared to the current SAFE-NMCA acceptance criteria for lean and rich plutonium solutions to determine whether or not the criteria are reasonable and may bemore » met.« less

Room-temperature solution-processed and metal oxide-free nano-composite for the flexible transparent bottom electrode of perovskite solar cells

NASA Astrophysics Data System (ADS)

Lu, Haifei; Sun, Jingsong; Zhang, Hong; Lu, Shunmian; Choy, Wallace C. H.

2016-03-01

The exploration of low-temperature and solution-processed charge transporting and collecting layers can promote the development of low-cost and large-scale perovskite solar cells (PVSCs) through an all solution process. Here, we propose a room-temperature solution-processed and metal oxide-free nano-composite composed of a silver nano-network and graphene oxide (GO) flawless film for the transparent bottom electrode of a PVSC. Our experimental results show that the amount of GO flakes play a critical role in forming the flawless anti-corrosive barrier in the silver nano-network through a self-assembly approach under ambient atmosphere, which can effectively prevent the penetration of liquid or gaseous halides and their corrosion against the silver nano-network underneath. Importantly, we simultaneously achieve good work function alignment and surface wetting properties for a practical bottom electrode by controlling the degree of reduction of GO flakes. Finally, flexible PVSC adopting the room-temperature and solution-processed nano-composite as the flexible transparent bottom electrode has been demonstrated on a polyethylene terephthalate (PET) substrate. As a consequence, the demonstration of our room-temperature solution-processed and metal oxide-free flexible transparent bottom electrode will contribute to the emerging large-area flexible PVSC technologies.The exploration of low-temperature and solution-processed charge transporting and collecting layers can promote the development of low-cost and large-scale perovskite solar cells (PVSCs) through an all solution process. Here, we propose a room-temperature solution-processed and metal oxide-free nano-composite composed of a silver nano-network and graphene oxide (GO) flawless film for the transparent bottom electrode of a PVSC. Our experimental results show that the amount of GO flakes play a critical role in forming the flawless anti-corrosive barrier in the silver nano-network through a self-assembly approach under ambient atmosphere, which can effectively prevent the penetration of liquid or gaseous halides and their corrosion against the silver nano-network underneath. Importantly, we simultaneously achieve good work function alignment and surface wetting properties for a practical bottom electrode by controlling the degree of reduction of GO flakes. Finally, flexible PVSC adopting the room-temperature and solution-processed nano-composite as the flexible transparent bottom electrode has been demonstrated on a polyethylene terephthalate (PET) substrate. As a consequence, the demonstration of our room-temperature solution-processed and metal oxide-free flexible transparent bottom electrode will contribute to the emerging large-area flexible PVSC technologies. Electronic supplementary information (ESI) available. See DOI: 10.1039/c6nr00011h

Reasons for discharges against medical advice: a qualitative study

PubMed Central

Onukwugha, Eberechukwu; Saunders, Elijah; Mullins, C. Daniel; Pradel, Françoise G.; Zuckerman, Marni; Weir, Matthew R.

2013-01-01

Background There is limited information in the literature about reasons for discharges against medical advice (DAMA) as supplied by patients and providers. Information about the reasons for DAMA is necessary for identifying workable strategies to reduce the likelihood and health consequences of DAMA. The objective of this study is to identify the reasons for DAMA based on patient and multi-category provider focus group interviews (FGIs). Methods Patients who discharged against medical advice between 2006 and 2008 from a large, academic medical center along with hospital providers reporting contact with patients who left against medical advice were recruited. Three patient-only groups, one physician-only group, and one nurse/social worker group were held. Focus group interviews were transcribed and a thematic analysis was performed to identify themes within and across groups. Participants discussed the reasons for patient DAMA and identified potential solutions. Results Eighteen patients, 5 physicians, 6 nurses and 4 social workers participated in the FGIs. Seven themes emerged across the separate patient, doctor, nurse/social worker group FGIs of reasons why patients leave against medical advice: 1) drug addiction, 2) pain management, 3) external obligations, 4) wait time, 5) doctor’s bedside manner, 6) teaching hospital setting, and 7) communication. Solutions to tackle DAMA identified by participants revolve mainly around enhanced communication and provider education. Conclusions In a large, academic medical center we find some differences and many similarities across patients and providers in identifying the causes of and solutions to DAMA, many of which relate to communication. PMID:20538627

Reasons for discharges against medical advice: a qualitative study.

PubMed

Onukwugha, Eberechukwu; Saunders, Elijah; Mullins, C Daniel; Pradel, Françoise G; Zuckerman, Marni; Weir, Matthew R

2010-10-01

There is limited information in the literature about reasons for discharges against medical advice (DAMA) as supplied by patients and providers. Information about the reasons for DAMA is necessary for identifying workable strategies to reduce the likelihood and health consequences of DAMA. The objective of this study is to identify the reasons for DAMA based on patient and multicategory provider focus-group interviews (FGIs). Patients who discharged against medical advice between 2006 and 2008 from a large, academic medical centre along with hospital providers reporting contact with patients who left against medical advice were recruited. Three patient-only groups, one physician-only group and one nurse/social worker group were held. Focus-group interviews were transcribed, and a thematic analysis was performed to identify themes within and across groups. Participants discussed the reasons for patient DAMA and identified potential solutions. Eighteen patients, five physicians, six nurses and four social workers participated in the FGIs. Seven themes emerged across the separate patient, doctor, nurse/social worker FGIs of reasons why patients leave against medical advice: (1) drug addiction, (2) pain management, (3) external obligations, (4) wait time, (5) doctor's bedside manner, (6) teaching hospital setting and (7) communication. Solutions to tackle DAMA identified by participants revolved mainly around enhanced communication and provider education. In a large, academic medical centre, the authors find some differences and many similarities across patients and providers in identifying the causes of and solutions to DAMA, many of which relate to communication.

Information Assurance Tasks Supporting the Processing of Electronic Records Archives

DTIC Science & Technology

2007-03-01

3 Table 2. OpenVPN evaluation results...........................................................................................10 iv 1...operation of necessary security features and compare the network performance under OpenVPN (openvpn.net) operation with the network performance under no...VPN operation (non-VPN) in a gigabit network environment. The reason for selecting OpenVPN product was based on the previous findings of Khanvilkar

Protru: Leveraging Provenance to Enhance Network Trust in a Wireless Sensor Network

ERIC Educational Resources Information Center

Dogan, Gulustan

2013-01-01

Trust can be an important component of wireless sensor networks for believability of the produced data and historical value is a crucial asset in deciding trust of the data. A node's trust can change over time after its initial deployment due to various reasons such as energy loss, environmental conditions or exhausting sources. Provenance can…

78 FR 6823 - Determination That DIFFERIN (Adapalene) Solution, 0.1%, Was Not Withdrawn From Sale for Reasons...

Federal Register 2010, 2011, 2012, 2013, 2014

2013-01-31

... discontinued from marketing for reasons other than safety or effectiveness. ANDAs that refer to DIFFERIN... Effectiveness AGENCY: Food and Drug Administration, HHS. ACTION: Notice. SUMMARY: The Food and Drug... sale for reasons of safety or effectiveness. This determination will allow FDA to approve abbreviated...

Neural underpinnings of divergent production of rules in numerical analogical reasoning.

PubMed

Wu, Xiaofei; Jung, Rex E; Zhang, Hao

2016-05-01

Creativity plays an important role in numerical problem solving. Although the neural underpinnings of creativity have been studied over decades, very little is known about neural mechanisms of the creative process that relates to numerical problem solving. In the present study, we employed a numerical analogical reasoning task with functional Magnetic Resonance Imaging (fMRI) to investigate the neural correlates of divergent production of rules in numerical analogical reasoning. Participants performed two tasks: a multiple solution analogical reasoning task and a single solution analogical reasoning task. Results revealed that divergent production of rules involves significant activations at Brodmann area (BA) 10 in the right middle frontal cortex, BA 40 in the left inferior parietal lobule, and BA 8 in the superior frontal cortex. The results suggest that right BA 10 and left BA 40 are involved in the generation of novel rules, and BA 8 is associated with the inhibition of initial rules in numerical analogical reasoning. The findings shed light on the neural mechanisms of creativity in numerical processing. Copyright © 2016 Elsevier B.V. All rights reserved.

Experimental testing and modeling analysis of solute mixing at water distribution pipe junctions.

PubMed

Shao, Yu; Jeffrey Yang, Y; Jiang, Lijie; Yu, Tingchao; Shen, Cheng

2014-06-01

Flow dynamics at a pipe junction controls particle trajectories, solute mixing and concentrations in downstream pipes. The effect can lead to different outcomes of water quality modeling and, hence, drinking water management in a distribution network. Here we have investigated solute mixing behavior in pipe junctions of five hydraulic types, for which flow distribution factors and analytical equations for network modeling are proposed. First, based on experiments, the degree of mixing at a cross is found to be a function of flow momentum ratio that defines a junction flow distribution pattern and the degree of departure from complete mixing. Corresponding analytical solutions are also validated using computational-fluid-dynamics (CFD) simulations. Second, the analytical mixing model is further extended to double-Tee junctions. Correspondingly the flow distribution factor is modified to account for hydraulic departure from a cross configuration. For a double-Tee(A) junction, CFD simulations show that the solute mixing depends on flow momentum ratio and connection pipe length, whereas the mixing at double-Tee(B) is well represented by two independent single-Tee junctions with a potential water stagnation zone in between. Notably, double-Tee junctions differ significantly from a cross in solute mixing and transport. However, it is noted that these pipe connections are widely, but incorrectly, simplified as cross junctions of assumed complete solute mixing in network skeletonization and water quality modeling. For the studied pipe junction types, analytical solutions are proposed to characterize the incomplete mixing and hence may allow better water quality simulation in a distribution network. Published by Elsevier Ltd.

What's in a Label? Is Diagnosis the Start or the End of Clinical Reasoning?

PubMed

Ilgen, Jonathan S; Eva, Kevin W; Regehr, Glenn

2016-04-01

Diagnostic reasoning has received substantial attention in the literature, yet what we mean by "diagnosis" may vary. Diagnosis can align with assignment of a "label," where a constellation of signs, symptoms, and test results is unified into a solution at a single point in time. This "diagnostic labeling" conceptualization is embodied in our case-based learning curricula, published case reports, and research studies, all of which treat diagnostic accuracy as the primary outcome. However, this conceptualization may oversimplify the richly iterative and evolutionary nature of clinical reasoning in many settings. Diagnosis can also represent a process of guiding one's thoughts by "making meaning" from data that are intrinsically dynamic, experienced idiosyncratically, negotiated among team members, and rich with opportunities for exploration. Thus, there are two complementary constructions of diagnosis: 1) the correct solution resulting from a diagnostic reasoning process, and 2) a dynamic aid to an ongoing clinical reasoning process. This article discusses the importance of recognizing these two conceptualizations of "diagnosis," outlines the unintended consequences of emphasizing diagnostic labeling as the primary goal of clinical reasoning, and suggests how framing diagnosis as an ongoing process of meaning-making might change how we think about teaching and assessing clinical reasoning.

Information network architectures

NASA Technical Reports Server (NTRS)

Murray, N. D.

1985-01-01

Graphs, charts, diagrams and outlines of information relative to information network architectures for advanced aerospace missions, such as the Space Station, are presented. Local area information networks are considered a likely technology solution. The principle needs for the network are listed.

Coordinated Platoon Routing in a Metropolitan Network

DOE Office of Scientific and Technical Information (OSTI.GOV)

Larson, Jeffrey; Munson, Todd; Sokolov, Vadim

2016-10-10

Platooning vehicles—connected and automated vehicles traveling with small intervehicle distances—use less fuel because of reduced aerodynamic drag. Given a network de- fined by vertex and edge sets and a set of vehicles with origin/destination nodes/times, we model and solve the combinatorial optimization problem of coordinated routing of vehicles in a manner that routes them to their destination on time while using the least amount of fuel. Common approaches decompose the platoon coordination and vehicle routing into separate problems. Our model addresses both problems simultaneously to obtain the best solution. We use modern modeling techniques and constraints implied from analyzing themore » platoon routing problem to address larger numbers of vehicles and larger networks than previously considered. While the numerical method used is unable to certify optimality for candidate solutions to all networks and parameters considered, we obtain excellent solutions in approximately one minute for much larger networks and vehicle sets than previously considered in the literature.« less

Speeding decisions. Social security's information exchange program.

PubMed

Winter, Kitt; Hastings, Bob

2011-05-01

The Social Security Administration has plenty of reasons to streamline its records request process-more than 15 million reasons each year, in fact. That's why it has been pioneering information exchange projects with the private sector, including use of the Nationwide Health Information Network.

Reducing neural network training time with parallel processing

NASA Technical Reports Server (NTRS)

Rogers, James L., Jr.; Lamarsh, William J., II

1995-01-01

Obtaining optimal solutions for engineering design problems is often expensive because the process typically requires numerous iterations involving analysis and optimization programs. Previous research has shown that a near optimum solution can be obtained in less time by simulating a slow, expensive analysis with a fast, inexpensive neural network. A new approach has been developed to further reduce this time. This approach decomposes a large neural network into many smaller neural networks that can be trained in parallel. Guidelines are developed to avoid some of the pitfalls when training smaller neural networks in parallel. These guidelines allow the engineer: to determine the number of nodes on the hidden layer of the smaller neural networks; to choose the initial training weights; and to select a network configuration that will capture the interactions among the smaller neural networks. This paper presents results describing how these guidelines are developed.

Exact Solutions for Rate and Synchrony in Recurrent Networks of Coincidence Detectors

PubMed Central

Mikula, Shawn; Niebur, Ernst

2009-01-01

We provide analytical solutions for mean firing rates and cross-correlations of coincidence detector neurons in recurrent networks with excitatory or inhibitory connectivity with rate-modulated steady-state spiking inputs. We use discrete-time finite-state Markov chains to represent network state transition probabilities, which are subsequently used to derive exact analytical solutions for mean firing rates and cross-correlations. As illustrated in several examples, the method can be used for modeling cortical microcircuits and clarifying single-neuron and population coding mechanisms. We also demonstrate that increasing firing rates do not necessarily translate into increasing cross-correlations, though our results do support the contention that firing rates and cross-correlations are likely to be coupled. Our analytical solutions underscore the complexity of the relationship between firing rates and cross-correlations. PMID:18439133

fMRI reveals reciprocal inhibition between social and physical cognitive domains.

PubMed

Jack, Anthony I; Dawson, Abigail J; Begany, Katelyn L; Leckie, Regina L; Barry, Kevin P; Ciccia, Angela H; Snyder, Abraham Z

2013-02-01

Two lines of evidence indicate that there exists a reciprocal inhibitory relationship between opposed brain networks. First, most attention-demanding cognitive tasks activate a stereotypical set of brain areas, known as the task-positive network and simultaneously deactivate a different set of brain regions, commonly referred to as the task negative or default mode network. Second, functional connectivity analyses show that these same opposed networks are anti-correlated in the resting state. We hypothesize that these reciprocally inhibitory effects reflect two incompatible cognitive modes, each of which may be directed towards understanding the external world. Thus, engaging one mode activates one set of regions and suppresses activity in the other. We test this hypothesis by identifying two types of problem-solving task which, on the basis of prior work, have been consistently associated with the task positive and task negative regions: tasks requiring social cognition, i.e., reasoning about the mental states of other persons, and tasks requiring physical cognition, i.e., reasoning about the causal/mechanical properties of inanimate objects. Social and mechanical reasoning tasks were presented to neurologically normal participants during fMRI. Each task type was presented using both text and video clips. Regardless of presentation modality, we observed clear evidence of reciprocal suppression: social tasks deactivated regions associated with mechanical reasoning and mechanical tasks deactivated regions associated with social reasoning. These findings are not explained by self-referential processes, task engagement, mental simulation, mental time travel or external vs. internal attention, all factors previously hypothesized to explain default mode network activity. Analyses of resting state data revealed a close match between the regions our tasks identified as reciprocally inhibitory and regions of maximal anti-correlation in the resting state. These results indicate the reciprocal inhibition is not attributable to constraints inherent in the tasks, but is neural in origin. Hence, there is a physiological constraint on our ability to simultaneously engage two distinct cognitive modes. Further work is needed to more precisely characterize these opposing cognitive domains. Copyright © 2012 Elsevier Inc. All rights reserved.

Epidemic spreading in weighted networks: an edge-based mean-field solution.

PubMed

Yang, Zimo; Zhou, Tao

2012-05-01

Weight distribution greatly impacts the epidemic spreading taking place on top of networks. This paper presents a study of a susceptible-infected-susceptible model on regular random networks with different kinds of weight distributions. Simulation results show that the more homogeneous weight distribution leads to higher epidemic prevalence, which, unfortunately, could not be captured by the traditional mean-field approximation. This paper gives an edge-based mean-field solution for general weight distribution, which can quantitatively reproduce the simulation results. This method could be applied to characterize the nonequilibrium steady states of dynamical processes on weighted networks.

Research on invulnerability of equipment support information network

NASA Astrophysics Data System (ADS)

Sun, Xiao; Liu, Bin; Zhong, Qigen; Cao, Zhiyi

2013-03-01

In this paper, the entity composition of equipment support information network is studied, and the network abstract model is built. The influence factors of the invulnerability of equipment support information network are analyzed, and the invulnerability capabilities under random attack are analyzed. According to the centrality theory, the materiality evaluation centralities of the nodes are given, and the invulnerability capabilities under selective attack are analyzed. Finally, the reasons that restrict the invulnerability of equipment support information network are summarized, and the modified principles and methods are given.

Multiple roles for executive control in belief-desire reasoning: distinct neural networks are recruited for self perspective inhibition and complexity of reasoning.

PubMed

Hartwright, Charlotte E; Apperly, Ian A; Hansen, Peter C

2012-07-16

Belief-desire reasoning is a core component of 'Theory of Mind' (ToM), which can be used to explain and predict the behaviour of agents. Neuroimaging studies reliably identify a network of brain regions comprising a 'standard' network for ToM, including temporoparietal junction and medial prefrontal cortex. Whilst considerable experimental evidence suggests that executive control (EC) may support a functioning ToM, co-ordination of neural systems for ToM and EC is poorly understood. We report here use of a novel task in which psychologically relevant ToM parameters (true versus false belief; approach versus avoidance desire) were manipulated orthogonally. The valence of these parameters not only modulated brain activity in the 'standard' ToM network but also in EC regions. Varying the valence of both beliefs and desires recruits anterior cingulate cortex, suggesting a shared inhibitory component associated with negatively valenced mental state concepts. Varying the valence of beliefs additionally draws on ventrolateral prefrontal cortex, reflecting the need to inhibit self perspective. These data provide the first evidence that separate functional and neural systems for EC may be recruited in the service of different aspects of ToM. Copyright © 2012 Elsevier Inc. All rights reserved.

A Method for Decentralised Optimisation in Networks

NASA Astrophysics Data System (ADS)

Saramäki, Jari

2005-06-01

We outline a method for distributed Monte Carlo optimisation of computational problems in networks of agents, such as peer-to-peer networks of computers. The optimisation and messaging procedures are inspired by gossip protocols and epidemic data dissemination, and are decentralised, i.e. no central overseer is required. In the outlined method, each agent follows simple local rules and seeks for better solutions to the optimisation problem by Monte Carlo trials, as well as by querying other agents in its local neighbourhood. With proper network topology, good solutions spread rapidly through the network for further improvement. Furthermore, the system retains its functionality even in realistic settings where agents are randomly switched on and off.

Basic Principles of Electrical Network Reliability Optimization in Liberalised Electricity Market

NASA Astrophysics Data System (ADS)

Oleinikova, I.; Krishans, Z.; Mutule, A.

2008-01-01

The authors propose to select long-term solutions to the reliability problems of electrical networks in the stage of development planning. The guide lines or basic principles of such optimization are: 1) its dynamical nature; 2) development sustainability; 3) integrated solution of the problems of network development and electricity supply reliability; 4) consideration of information uncertainty; 5) concurrent consideration of the network and generation development problems; 6) application of specialized information technologies; 7) definition of requirements for independent electricity producers. In the article, the major aspects of liberalized electricity market, its functions and tasks are reviewed, with emphasis placed on the optimization of electrical network development as a significant component of sustainable management of power systems.

Learning in stochastic neural networks for constraint satisfaction problems

NASA Technical Reports Server (NTRS)

Johnston, Mark D.; Adorf, Hans-Martin

1989-01-01

Researchers describe a newly-developed artificial neural network algorithm for solving constraint satisfaction problems (CSPs) which includes a learning component that can significantly improve the performance of the network from run to run. The network, referred to as the Guarded Discrete Stochastic (GDS) network, is based on the discrete Hopfield network but differs from it primarily in that auxiliary networks (guards) are asymmetrically coupled to the main network to enforce certain types of constraints. Although the presence of asymmetric connections implies that the network may not converge, it was found that, for certain classes of problems, the network often quickly converges to find satisfactory solutions when they exist. The network can run efficiently on serial machines and can find solutions to very large problems (e.g., N-queens for N as large as 1024). One advantage of the network architecture is that network connection strengths need not be instantiated when the network is established: they are needed only when a participating neural element transitions from off to on. They have exploited this feature to devise a learning algorithm, based on consistency techniques for discrete CSPs, that updates the network biases and connection strengths and thus improves the network performance.

NMR study on the network structure of a mixed gel of kappa and iota carrageenans.

PubMed

Hu, Bingjie; Du, Lei; Matsukawa, Shingo

2016-10-05

The temperature dependencies of the (1)H T2 and diffusion coefficient (D) of a mixed solution of kappa-carrageenan and iota-carrageenan were measured by NMR. Rheological and NMR measurements suggested an exponential formation of rigid aggregates of kappa-carrageenan and a gradual formation of fine aggregates of iota-carrageenan during two step increases of G'. The results also suggested that longer carrageenan chains are preferentially involved in aggregation, thus resulting in a decrease in the average Mw of solute carrageenans. The results of diffusion measurements for poly(ethylene oxide) (PEO) suggested that kappa-carrageenan formed thick aggregates that decreased hindrance to PEO diffusion by decreasing the solute kappa-carrageenan concentration in the voids of the aggregated chains, and that iota-carrageenan formed fine aggregates that decreased the solute iota-carrageenan concentration less. DPEO in a mixed solution of kappa-carrageenan and iota-carrageenan suggested two possibilities for the microscopic network structure: an interpenetrating network structure, or micro-phase separation. Copyright © 2016. Published by Elsevier Ltd.

Packet-aware transport for video distribution [Invited

NASA Astrophysics Data System (ADS)

Aguirre-Torres, Luis; Rosenfeld, Gady; Bruckman, Leon; O'Connor, Mannix

2006-05-01

We describe a solution based on resilient packet rings (RPR) for the distribution of broadcast video and video-on-demand (VoD) content over a packet-aware transport network. The proposed solution is based on our experience in the design and deployment of nationwide Triple Play networks and relies on technologies such as RPR, multiprotocol label switching (MPLS), and virtual private LAN service (VPLS) to provide the most efficient solution in terms of utilization, scalability, and availability.

A Bayesian network approach to the database search problem in criminal proceedings

PubMed Central

2012-01-01

Background The ‘database search problem’, that is, the strengthening of a case - in terms of probative value - against an individual who is found as a result of a database search, has been approached during the last two decades with substantial mathematical analyses, accompanied by lively debate and centrally opposing conclusions. This represents a challenging obstacle in teaching but also hinders a balanced and coherent discussion of the topic within the wider scientific and legal community. This paper revisits and tracks the associated mathematical analyses in terms of Bayesian networks. Their derivation and discussion for capturing probabilistic arguments that explain the database search problem are outlined in detail. The resulting Bayesian networks offer a distinct view on the main debated issues, along with further clarity. Methods As a general framework for representing and analyzing formal arguments in probabilistic reasoning about uncertain target propositions (that is, whether or not a given individual is the source of a crime stain), this paper relies on graphical probability models, in particular, Bayesian networks. This graphical probability modeling approach is used to capture, within a single model, a series of key variables, such as the number of individuals in a database, the size of the population of potential crime stain sources, and the rarity of the corresponding analytical characteristics in a relevant population. Results This paper demonstrates the feasibility of deriving Bayesian network structures for analyzing, representing, and tracking the database search problem. The output of the proposed models can be shown to agree with existing but exclusively formulaic approaches. Conclusions The proposed Bayesian networks allow one to capture and analyze the currently most well-supported but reputedly counter-intuitive and difficult solution to the database search problem in a way that goes beyond the traditional, purely formulaic expressions. The method’s graphical environment, along with its computational and probabilistic architectures, represents a rich package that offers analysts and discussants with additional modes of interaction, concise representation, and coherent communication. PMID:22849390

A simulation-based study of HighSpeed TCP and its deployment

DOE Office of Scientific and Technical Information (OSTI.GOV)

Souza, Evandro de

2003-05-01

The current congestion control mechanism used in TCP has difficulty reaching full utilization on high speed links, particularly on wide-area connections. For example, the packet drop rate needed to fill a Gigabit pipe using the present TCP protocol is below the currently achievable fiber optic error rates. HighSpeed TCP was recently proposed as a modification of TCP's congestion control mechanism to allow it to achieve reasonable performance in high speed wide-area links. In this research, simulation results showing the performance of HighSpeed TCP and the impact of its use on the present implementation of TCP are presented. Network conditions includingmore » different degrees of congestion, different levels of loss rate, different degrees of bursty traffic and two distinct router queue management policies were simulated. The performance and fairness of HighSpeed TCP were compared to the existing TCP and solutions for bulk-data transfer using parallel streams.« less

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bhattarai, Bishnu; Kouzelis, Konstantinos; Mendaza, Iker

The gradual active load penetration in low voltage distribution grids is expected to challenge their network capacity in the near future. Distribution system operators should for this reason resort to either costly grid reinforcements or to demand side management mechanisms. Since demand side management implementation is usually cheaper, it is also the favorable solution. To this end, this article presents a framework for handling grid limit violations, both voltage and current, to ensure a secure and qualitative operation of the distribution grid. This framework consists of two steps, namely a proactive centralized and subsequently a reactive decentralized control scheme. Themore » former is employed to balance the one hour ahead load while the latter aims at regulating the consumption in real-time. In both cases, the importance of fair use of electricity demand flexibility is emphasized. Thus, it is demonstrated that this methodology aids in keeping the grid status within preset limits while utilizing flexibility from all flexibility participants.« less

An event-based architecture for solving constraint satisfaction problems

PubMed Central

Mostafa, Hesham; Müller, Lorenz K.; Indiveri, Giacomo

2015-01-01

Constraint satisfaction problems are ubiquitous in many domains. They are typically solved using conventional digital computing architectures that do not reflect the distributed nature of many of these problems, and are thus ill-suited for solving them. Here we present a parallel analogue/digital hardware architecture specifically designed to solve such problems. We cast constraint satisfaction problems as networks of stereotyped nodes that communicate using digital pulses, or events. Each node contains an oscillator implemented using analogue circuits. The non-repeating phase relations among the oscillators drive the exploration of the solution space. We show that this hardware architecture can yield state-of-the-art performance on random SAT problems under reasonable assumptions on the implementation. We present measurements from a prototype electronic chip to demonstrate that a physical implementation of the proposed architecture is robust to practical non-idealities and to validate the theory proposed. PMID:26642827

Vertical structure of medium-scale traveling ionospheric disturbances

NASA Astrophysics Data System (ADS)

Ssessanga, Nicholas; Kim, Yong Ha; Kim, Eunsol

2015-11-01

We develop an algorithm of computerized ionospheric tomography (CIT) to infer information on the vertical and horizontal structuring of electron density during nighttime medium-scale traveling ionospheric disturbances (MSTIDs). To facilitate digital CIT we have adopted total electron contents (TEC) from a dense Global Positioning System (GPS) receiver network, GEONET, which contains more than 1000 receivers. A multiplicative algebraic reconstruction technique was utilized with a calibrated IRI-2012 model as an initial solution. The reconstructed F2 peak layer varied in altitude with average peak-to-peak amplitude of ~52 km. In addition, the F2 peak layer anticorrelated with TEC variations. This feature supports a theory in which nighttime MSTID is composed of oscillating electric fields due to conductivity variations. Moreover, reconstructed TEC variations over two stations were reasonably close to variations directly derived from the measured TEC data set. Our tomographic analysis may thus help understand three-dimensional structure of MSTIDs in a quantitative way.

Do You Lock Your Network Doors? Some Network Management Precautions.

ERIC Educational Resources Information Center

Neray, Phil

1997-01-01

Discusses security problems and solutions for networked organizations with Internet connections. Topics include access to private networks from electronic mail information; computer viruses; computer software; corporate espionage; firewalls, that is computers that stand between a local network and the Internet; passwords; and physical security.…

The role of effective connectivity between the task-positive and task-negative network for evidence gathering [Evidence gathering and connectivity].

PubMed

Andreou, Christina; Steinmann, Saskia; Kolbeck, Katharina; Rauh, Jonas; Leicht, Gregor; Moritz, Steffen; Mulert, Christoph

2018-06-01

Reports linking a 'jumping-to-conclusions' bias to delusions have led to growing interest in the neurobiological correlates of probabilistic reasoning. Several brain areas have been implicated in probabilistic reasoning; however, findings are difficult to integrate into a coherent account. The present study aimed to provide additional evidence by investigating, for the first time, effective connectivity among brain areas involved in different stages of evidence gathering. We investigated evidence gathering in 25 healthy individuals using fMRI and a new paradigm (Box Task) designed such as to minimize the effects of cognitive effort and reward processing. Decisions to collect more evidence ('draws') were contrasted to decisions to reach a final choice ('conclusions') with respect to BOLD activity. Psychophysiological interaction analysis was used to investigate effective connectivity. Conclusion events were associated with extensive brain activations in widely distributed brain areas associated with the task-positive network. In contrast, draw events were characterized by higher activation in areas assumed to be part of the task-negative network. Effective connectivity between the two networks decreased during draws and increased during conclusion events. Our findings indicate that probabilistic reasoning may depend on the balance between the task-positive and task-negative network, and that shifts in connectivity between the two may be crucial for evidence gathering. Thus, abnormal connectivity between the two systems may significantly contribute to the jumping-to-conclusions bias. Copyright © 2018 Elsevier Inc. All rights reserved.

Thermodynamic and Structural Properties of Methanol-Water Solutions Using Non-Additive Interaction Models

PubMed Central

Zhong, Yang; Warren, G. Lee; Patel, Sandeep

2014-01-01

We study bulk structural and thermodynamic properties of methanol-water solutions via molecular dynamics simulations using novel interaction potentials based on the charge equilibration (fluctuating charge) formalism to explicitly account for molecular polarization at the atomic level. The study uses the TIP4P-FQ potential for water-water interactions, and the CHARMM-based (Chemistry at HARvard Molecular Mechanics) fluctuating charge potential for methanol-methanol and methanol-water interactions. In terms of bulk solution properties, we discuss liquid densities, enthalpies of mixing, dielectric constants, self-diffusion constants, as well as structural properties related to local hydrogen bonding structure as manifested in radial distribution functions and cluster analysis. We further explore the electronic response of water and methanol in the differing local environments established by the interaction of each species predominantly with molecules of the other species. The current force field for the alcohol-water interaction performs reasonably well for most properties, with the greatest deviation from experiment observed for the excess mixing enthalpies, which are predicted to be too favorable. This is qualitatively consistent with the overestimation of the methanol-water gas-phase interaction energy for the lowest-energy conformer (methanol as proton donor). Hydration free energies for methanol in TIP4P-FQ water are predicted to be −5.6±0.2 kcal/mole, in respectable agreement with the experimental value of −5.1 kcal/mole. With respect to solution micro-structure, the present cluster analysis suggests that the micro-scale environment for concentrations where select thermodynamic quantities reach extremal values is described by a bi-percolating network structure. PMID:18074339

The Network Architecture of Cortical Processing in Visuo-spatial Reasoning

PubMed Central

Shokri-Kojori, Ehsan; Motes, Michael A.; Rypma, Bart; Krawczyk, Daniel C.

2012-01-01

Reasoning processes have been closely associated with prefrontal cortex (PFC), but specifically emerge from interactions among networks of brain regions. Yet it remains a challenge to integrate these brain-wide interactions in identifying the flow of processing emerging from sensory brain regions to abstract processing regions, particularly within PFC. Functional magnetic resonance imaging data were collected while participants performed a visuo-spatial reasoning task. We found increasing involvement of occipital and parietal regions together with caudal-rostral recruitment of PFC as stimulus dimensions increased. Brain-wide connectivity analysis revealed that interactions between primary visual and parietal regions predominantly influenced activity in frontal lobes. Caudal-to-rostral influences were found within left-PFC. Right-PFC showed evidence of rostral-to-caudal connectivity in addition to relatively independent influences from occipito-parietal cortices. In the context of hierarchical views of PFC organization, our results suggest that a caudal-to-rostral flow of processing may emerge within PFC in reasoning tasks with minimal top-down deductive requirements. PMID:22624092

The network architecture of cortical processing in visuo-spatial reasoning.

PubMed

Shokri-Kojori, Ehsan; Motes, Michael A; Rypma, Bart; Krawczyk, Daniel C

2012-01-01

Reasoning processes have been closely associated with prefrontal cortex (PFC), but specifically emerge from interactions among networks of brain regions. Yet it remains a challenge to integrate these brain-wide interactions in identifying the flow of processing emerging from sensory brain regions to abstract processing regions, particularly within PFC. Functional magnetic resonance imaging data were collected while participants performed a visuo-spatial reasoning task. We found increasing involvement of occipital and parietal regions together with caudal-rostral recruitment of PFC as stimulus dimensions increased. Brain-wide connectivity analysis revealed that interactions between primary visual and parietal regions predominantly influenced activity in frontal lobes. Caudal-to-rostral influences were found within left-PFC. Right-PFC showed evidence of rostral-to-caudal connectivity in addition to relatively independent influences from occipito-parietal cortices. In the context of hierarchical views of PFC organization, our results suggest that a caudal-to-rostral flow of processing may emerge within PFC in reasoning tasks with minimal top-down deductive requirements.

Common and dissociable neural correlates associated with component processes of inductive reasoning.

PubMed

Jia, Xiuqin; Liang, Peipeng; Lu, Jie; Yang, Yanhui; Zhong, Ning; Li, Kuncheng

2011-06-15

The ability to draw numerical inductive reasoning requires two key cognitive processes, identification and extrapolation. This study aimed to identify the neural correlates of both component processes of numerical inductive reasoning using event-related fMRI. Three kinds of tasks: rule induction (RI), rule induction and application (RIA), and perceptual judgment (Jud) were solved by twenty right-handed adults. Our results found that the left superior parietal lobule (SPL) extending into the precuneus and left dorsolateral prefrontal cortex (DLPFC) were commonly recruited in the two components. It was also observed that the fronto-parietal network was more specific to identification, whereas the striatal-thalamic network was more specific to extrapolation. The findings suggest that numerical inductive reasoning is mediated by the coordination of multiple brain areas including the prefrontal, parietal, and subcortical regions, of which some are more specific to demands on only one of these two component processes, whereas others are sensitive to both. Copyright © 2011 Elsevier Inc. All rights reserved.

Simulation tests of the optimization method of Hopfield and Tank using neural networks

NASA Technical Reports Server (NTRS)

Paielli, Russell A.

1988-01-01

The method proposed by Hopfield and Tank for using the Hopfield neural network with continuous valued neurons to solve the traveling salesman problem is tested by simulation. Several researchers have apparently been unable to successfully repeat the numerical simulation documented by Hopfield and Tank. However, as suggested to the author by Adams, it appears that the reason for those difficulties is that a key parameter value is reported erroneously (by four orders of magnitude) in the original paper. When a reasonable value is used for that parameter, the network performs generally as claimed. Additionally, a new method of using feedback to control the input bias currents to the amplifiers is proposed and successfully tested. This eliminates the need to set the input currents by trial and error.

An industrial robot singular trajectories planning based on graphs and neural networks

NASA Astrophysics Data System (ADS)

Łęgowski, Adrian; Niezabitowski, Michał

2016-06-01

Singular trajectories are rarely used because of issues during realization. A method of planning trajectories for given set of points in task space with use of graphs and neural networks is presented. In every desired point the inverse kinematics problem is solved in order to derive all possible solutions. A graph of solutions is made. The shortest path is determined to define required nodes in joint space. Neural networks are used to define the path between these nodes.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ivanov, Ilia N.; Simpson, John T.

A method of preparing a network comprises disposing a solution comprising particulate materials in a solvent onto a superhydrophobic surface comprising a plurality of superhydrophobic features and interfacial areas between the superhydrophobic features. The plurality of superhydrophobic features has a water contact angle of at least about 150.degree.. The method of preparing the network also comprises removing the solvent from the solution of the particulate materials, and forming a network of the particulate materials in the interfacial areas, the particulate materials receding to the interfacial areas as the solvent is removed.

Efficient room-temperature near-infrared detection with solution-processed networked single wall carbon nanotube field effect transistors.

PubMed

Hwang, Ihn; Jung, Hee June; Cho, Sung Hwan; Jo, Seong Soon; Choi, Yeon Sik; Sung, Ji Ho; Choi, Jae Ho; Jo, Moon Ho; Park, Cheolmin

2014-02-26

Efficient room temperature NIR detection with sufficient current gain is made with a solution-processed networked SWNT FET. The high performance NIR-FET with significantly enhanced photocurrent by more than two orders of magnitude compared to dark current in the depleted state is attributed to multiple Schottky barriers in the network, each of which absorb NIR and effectively separate photocarriers to corresponding electrodes. © 2013 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Numerical solution of the nonlinear Schrodinger equation by feedforward neural networks

NASA Astrophysics Data System (ADS)

Shirvany, Yazdan; Hayati, Mohsen; Moradian, Rostam

2008-12-01

We present a method to solve boundary value problems using artificial neural networks (ANN). A trial solution of the differential equation is written as a feed-forward neural network containing adjustable parameters (the weights and biases). From the differential equation and its boundary conditions we prepare the energy function which is used in the back-propagation method with momentum term to update the network parameters. We improved energy function of ANN which is derived from Schrodinger equation and the boundary conditions. With this improvement of energy function we can use unsupervised training method in the ANN for solving the equation. Unsupervised training aims to minimize a non-negative energy function. We used the ANN method to solve Schrodinger equation for few quantum systems. Eigenfunctions and energy eigenvalues are calculated. Our numerical results are in agreement with their corresponding analytical solution and show the efficiency of ANN method for solving eigenvalue problems.

Comparison of the genetic algorithm and incremental optimisation routines for a Bayesian inverse modelling based network design

NASA Astrophysics Data System (ADS)

Nickless, A.; Rayner, P. J.; Erni, B.; Scholes, R. J.

2018-05-01

The design of an optimal network of atmospheric monitoring stations for the observation of carbon dioxide (CO2) concentrations can be obtained by applying an optimisation algorithm to a cost function based on minimising posterior uncertainty in the CO2 fluxes obtained from a Bayesian inverse modelling solution. Two candidate optimisation methods assessed were the evolutionary algorithm: the genetic algorithm (GA), and the deterministic algorithm: the incremental optimisation (IO) routine. This paper assessed the ability of the IO routine in comparison to the more computationally demanding GA routine to optimise the placement of a five-member network of CO2 monitoring sites located in South Africa. The comparison considered the reduction in uncertainty of the overall flux estimate, the spatial similarity of solutions, and computational requirements. Although the IO routine failed to find the solution with the global maximum uncertainty reduction, the resulting solution had only fractionally lower uncertainty reduction compared with the GA, and at only a quarter of the computational resources used by the lowest specified GA algorithm. The GA solution set showed more inconsistency if the number of iterations or population size was small, and more so for a complex prior flux covariance matrix. If the GA completed with a sub-optimal solution, these solutions were similar in fitness to the best available solution. Two additional scenarios were considered, with the objective of creating circumstances where the GA may outperform the IO. The first scenario considered an established network, where the optimisation was required to add an additional five stations to an existing five-member network. In the second scenario the optimisation was based only on the uncertainty reduction within a subregion of the domain. The GA was able to find a better solution than the IO under both scenarios, but with only a marginal improvement in the uncertainty reduction. These results suggest that the best use of resources for the network design problem would be spent in improvement of the prior estimates of the flux uncertainties rather than investing these resources in running a complex evolutionary optimisation algorithm. The authors recommend that, if time and computational resources allow, that multiple optimisation techniques should be used as a part of a comprehensive suite of sensitivity tests when performing such an optimisation exercise. This will provide a selection of best solutions which could be ranked based on their utility and practicality.

Creative and Algorithmic Mathematical Reasoning: Effects of Transfer-Appropriate Processing and Effortful Struggle

ERIC Educational Resources Information Center

Jonsson, Bert; Kulaksiz, Yagmur C.; Lithner, Johan

2016-01-01

Two separate studies, Jonsson et al. ("J. Math Behav." 2014;36: 20-32) and Karlsson Wirebring et al. ("Trends Neurosci Educ." 2015;4(1-2):6-14), showed that learning mathematics using creative mathematical reasoning and constructing their own solution methods can be more efficient than if students use algorithmic reasoning and…

Principles for Designing Mathematical Tasks That Enhance Imitative and Creative Reasoning

ERIC Educational Resources Information Center

Lithner, Johan

2017-01-01

The design research programme learning by imitative and creative reasoning (LICR) studies whether, how and why tasks and teaching that enhance creative reasoning lead to a more productive struggle and more efficient learning than the common but inefficient task designs based on imitating given solution procedures. The purpose of this paper is to…

Reinventing Solutions to Systems of Linear Differential Equations: A Case of Emergent Models Involving Analytic Expressions

ERIC Educational Resources Information Center

Rasmussen, Chris; Blumenfeld, Howard

2007-01-01

An enduring challenge in mathematics education is to create learning environments in which students generate, refine, and extend their intuitive and informal ways of reasoning to more sophisticated and formal ways of reasoning. Pressing concerns for research, therefore, are to detail students' progressively sophisticated ways of reasoning and…

76 FR 9789 - Determination That Theophylline Oral Solution, 80 Milligrams/15 Milliliters, Was Not Withdrawn...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-02-22

... Reasons of Safety or Effectiveness AGENCY: Food and Drug Administration, HHS. ACTION: Notice. SUMMARY: The...)/15 milliliters (mL), was not withdrawn from sale for reasons of safety or effectiveness. This... the drug's NDA or ANDA for reasons of safety or effectiveness or if FDA determines that the listed...

Examination of Children Decision Making Using Clues during the Logical Reasoning Process

ERIC Educational Resources Information Center

Çelik, Meryem

2017-01-01

Logical reasoning is the process of thinking about a problem and finding the most effective solution. Children's decision-making skills are part of their cognitive development and are also indicative. The purpose of this study was to examine children's decision-making skills using clues in logical reasoning based on various variables. The study…

The Roles of Religious Culture and Moral Knowledge Teachers in Organizing Their Students Relationships with Social Networks

ERIC Educational Resources Information Center

Turan, Emine Zehra; Isçitürk, Gökçe Becit

2017-01-01

In parallel to the improvements experienced in information and communication systems in recent years, any use of Internet, especially the social networks by children and adolescents has been noticed to be increasing gradually. Use of social networks that starts at early ages has exposed children to some dangers. For that reason, the responsibility…

Design and characterization of hydrogel-based microfluidic devices with biomimetic solute transport networks

PubMed Central

Koo, Hyung-Jun

2017-01-01

Hydrogel could serve as a matrix material of new classes of solar cells and photoreactors with embedded microfluidic networks. These devices mimic the structure and function of plant leaves, which are a natural soft matter based microfluidic system. These unusual microfluidic-hydrogel devices with fluid-penetrable medium operate on the basis of convective-diffusive mechanism, where the liquid is transported between the non-connected channels via molecular permeation through the hydrogel. We define three key designs of such hydrogel devices, having linear, T-shaped, and branched channels and report results of numerical simulation of the process of their infusion with solute carried by the incoming fluid. The computational procedure takes into account both pressure-driven convection and concentration gradient-driven diffusion in the permeable gel matrix. We define the criteria for evaluation of the fluid infusion rate, uniformity, solute loss by outflow and overall performance. The T-shaped channel network was identified as the most efficient one and was improved further by investigating the effect of the channel-end secondary branches. Our parallel experimental data on the pattern of solute infusions are in excellent agreement with the simulation. These network designs can be applied to a broad range of novel microfluidic materials and soft matter devices with distributed microchannel networks. PMID:28396708

Hemodialysis Dose and Adequacy

MedlinePlus

... a patient's Kt/V is extremely low, the measurement should be repeated, unless a reason for the low Kt/V is obvious. Obvious reasons include treatment interruption, problems with blood or solution flow, and a problem in sampling either the pre- ...

Artificial neural network does better spatiotemporal compressive sampling

NASA Astrophysics Data System (ADS)

Lee, Soo-Young; Hsu, Charles; Szu, Harold

2012-06-01

Spatiotemporal sparseness is generated naturally by human visual system based on artificial neural network modeling of associative memory. Sparseness means nothing more and nothing less than the compressive sensing achieves merely the information concentration. To concentrate the information, one uses the spatial correlation or spatial FFT or DWT or the best of all adaptive wavelet transform (cf. NUS, Shen Shawei). However, higher dimensional spatiotemporal information concentration, the mathematics can not do as flexible as a living human sensory system. The reason is obviously for survival reasons. The rest of the story is given in the paper.

Hybrid protection algorithms based on game theory in multi-domain optical networks

NASA Astrophysics Data System (ADS)

Guo, Lei; Wu, Jingjing; Hou, Weigang; Liu, Yejun; Zhang, Lincong; Li, Hongming

2011-12-01

With the network size increasing, the optical backbone is divided into multiple domains and each domain has its own network operator and management policy. At the same time, the failures in optical network may lead to a huge data loss since each wavelength carries a lot of traffic. Therefore, the survivability in multi-domain optical network is very important. However, existing survivable algorithms can achieve only the unilateral optimization for profit of either users or network operators. Then, they cannot well find the double-win optimal solution with considering economic factors for both users and network operators. Thus, in this paper we develop the multi-domain network model with involving multiple Quality of Service (QoS) parameters. After presenting the link evaluation approach based on fuzzy mathematics, we propose the game model to find the optimal solution to maximize the user's utility, the network operator's utility, and the joint utility of user and network operator. Since the problem of finding double-win optimal solution is NP-complete, we propose two new hybrid protection algorithms, Intra-domain Sub-path Protection (ISP) algorithm and Inter-domain End-to-end Protection (IEP) algorithm. In ISP and IEP, the hybrid protection means that the intelligent algorithm based on Bacterial Colony Optimization (BCO) and the heuristic algorithm are used to solve the survivability in intra-domain routing and inter-domain routing, respectively. Simulation results show that ISP and IEP have the similar comprehensive utility. In addition, ISP has better resource utilization efficiency, lower blocking probability, and higher network operator's utility, while IEP has better user's utility.

Efficient routing for safety applications in vehicular networks.

DOT National Transportation Integrated Search

2009-03-01

Vehicular ad hoc networks have received a lot of attention in recent years. This attention is due to two reasons. : First and foremost, there are a number of real-life applications that become possible in the presence of : such an ad-hoc infrastructu...

A Network Optimization Solution using SAS/OR Tools for the Department of the Army Branching Problem

DTIC Science & Technology

2010-02-18

OPTMODEL; NETFLOW ;Nodes;Arcs;ROTC; assignments;Basic Branches;Cadet Satisfaction; CLASSIFICATION: Unclassified This paper will demonstrate...implement a solution using the NETFLOW procedure and repeat that network solution using the OPTMODEL procedure. The OPTMODEL implementation will be...96.545599 M 1 AV AV IN EN FA AR 4 96.221521 M 1 IN IN MI EN MP AR 1 Figure 1, Supply: cadet data (5 of 2545) ordered by OMS PROC NETFLOW takes a

Neural networks for vertical microcode compaction

NASA Astrophysics Data System (ADS)

Chu, Pong P.

1992-09-01

Neural networks provide an alternative way to solve complex optimization problems. Instead of performing a program of instructions sequentially as in a traditional computer, neural network model explores many competing hypotheses simultaneously using its massively parallel net. The paper shows how to use the neural network approach to perform vertical micro-code compaction for a micro-programmed control unit. The compaction procedure includes two basic steps. The first step determines the compatibility classes and the second step selects a minimal subset to cover the control signals. Since the selection process is an NP- complete problem, to find an optimal solution is impractical. In this study, we employ a customized neural network to obtain the minimal subset. We first formalize this problem, and then define an `energy function' and map it to a two-layer fully connected neural network. The modified network has two types of neurons and can always obtain a valid solution.

Physics of soft hyaluronic acid-collagen type II double network gels

NASA Astrophysics Data System (ADS)

Morozova, Svetlana; Muthukumar, Murugappan

2015-03-01

Many biological hydrogels are made up of multiple interpenetrating, charged components. We study the swelling, elastic diffusion, mechanical, and optical behaviors of 100 mol% ionizable hyaluronic acid (HA) and collagen type II fiber networks. Dilute, 0.05-0.5 wt% hyaluronic acid networks are extremely sensitive to solution salt concentration, but are stable at pH above 2. When swelled in 0.1M NaCl, single-network hyaluronic acid gels follow scaling laws relevant to high salt semidilute solutions; the elastic shear modulus G' and diffusion constant D scale with the volume fraction ϕ as G' ~ϕ 9 / 4 and D ~ϕ 3 / 4 , respectively. With the addition of a collagen fiber network, we find that the hyaluronic acid network swells to suspend the rigid collagen fibers, providing extra strength to the hydrogel. Results on swelling equilibria, elasticity, and collective diffusion on these double network hydrogels will be presented.

Lysozyme adsorption in pH-responsive hydrogel thin-films: the non-trivial role of acid-base equilibrium.

PubMed

Narambuena, Claudio F; Longo, Gabriel S; Szleifer, Igal

2015-09-07

We develop and apply a molecular theory to study the adsorption of lysozyme on weak polyacid hydrogel films. The theory explicitly accounts for the conformation of the network, the structure of the proteins, the size and shape of all the molecular species, their interactions as well as the chemical equilibrium of each titratable unit of both the protein and the polymer network. The driving forces for adsorption are the electrostatic attractions between the negatively charged network and the positively charged protein. The adsorption is a non-monotonic function of the solution pH, with a maximum in the region between pH 8 and 9 depending on the salt concentration of the solution. The non-monotonic adsorption is the result of increasing negative charge of the network with pH, while the positive charge of the protein decreases. At low pH the network is roughly electroneutral, while at sufficiently high pH the protein is negatively charged. Upon adsorption, the acid-base equilibrium of the different amino acids of the protein shifts in a nontrivial fashion that depends critically on the particular kind of residue and solution composition. Thus, the proteins regulate their charge and enhance adsorption under a wide range of conditions. In particular, adsorption is predicted above the protein isoelectric point where both the solution lysozyme and the polymer network are negatively charged. This behavior occurs because the pH in the interior of the gel is significantly lower than that in the bulk solution and it is also regulated by the adsorption of the protein in order to optimize protein-gel interactions. Under high pH conditions we predict that the protein changes its charge from negative in the solution to positive within the gel. The change occurs within a few nanometers at the interface of the hydrogel film. Our predictions show the non-trivial interplay between acid-base equilibrium, physical interactions and molecular organization under nanoconfined conditions, which leads to non-trivial adsorption behavior that is qualitatively different from what would be predicted from the state of the proteins in the bulk solution.

A Rawlsian Approach to Distribute Responsibilities in Networks

PubMed Central

2009-01-01

Due to their non-hierarchical structure, socio-technical networks are prone to the occurrence of the problem of many hands. In the present paper an approach is introduced in which people’s opinions on responsibility are empirically traced. The approach is based on the Rawlsian concept of Wide Reflective Equilibrium (WRE) in which people’s considered judgments on a case are reflectively weighed against moral principles and background theories, ideally leading to a state of equilibrium. Application of the method to a hypothetical case with an artificially constructed network showed that it is possible to uncover the relevant data to assess a consensus amongst people in terms of their individual WRE. It appeared that the moral background theories people endorse are not predictive for their actual distribution of responsibilities but that they indicate ways of reasoning and justifying outcomes. Two ways of ascribing responsibilities were discerned, corresponding to two requirements of a desirable responsibility distribution: fairness and completeness. Applying the method triggered learning effects, both with regard to conceptual clarification and moral considerations, and in the sense that it led to some convergence of opinions. It is recommended to apply the method to a real engineering case in order to see whether this approach leads to an overlapping consensus on a responsibility distribution which is justifiable to all and in which no responsibilities are left unfulfilled, therewith trying to contribute to the solution of the problem of many hands. PMID:19626463

Research of G3-PLC net self-organization processes in the NS-3 modeling framework

NASA Astrophysics Data System (ADS)

Pospelova, Irina; Chebotayev, Pavel; Klimenko, Aleksey; Myakochin, Yuri; Polyakov, Igor; Shelupanov, Alexander; Zykov, Dmitriy

2017-11-01

When modern infocommunication networks are designed, the combination of several data transfer channels is widely used. It is necessary for the purposes of improvement in quality and robustness of communication. Communication systems based on more than one data transfer channel are named heterogeneous communication systems. For the design of a heterogeneous network, the most optimal solution is the use of mesh technology. Mesh technology ensures message delivery to the destination under conditions of unpredictable interference environment situation in each of two channels. Therewith, one of the high-priority problems is the choice of a routing protocol when the mesh networks are designed. An important design stage for any computer network is modeling. Modeling allows us to design a few different variants of design solutions and also to compute all necessary functional specifications for each of these solutions. As a result, it allows us to reduce costs for the physical realization of a network. In this article the research of dynamic routing in the NS3 simulation modeling framework is presented. The article contains an evaluation of simulation modeling applicability in solving the problem of heterogeneous networks design. Results of modeling may be afterwards used for physical realization of this kind of networks.

Achieving network level privacy in Wireless Sensor Networks.

PubMed

Shaikh, Riaz Ahmed; Jameel, Hassan; d'Auriol, Brian J; Lee, Heejo; Lee, Sungyoung; Song, Young-Jae

2010-01-01

Full network level privacy has often been categorized into four sub-categories: Identity, Route, Location and Data privacy. Achieving full network level privacy is a critical and challenging problem due to the constraints imposed by the sensor nodes (e.g., energy, memory and computation power), sensor networks (e.g., mobility and topology) and QoS issues (e.g., packet reach-ability and timeliness). In this paper, we proposed two new identity, route and location privacy algorithms and data privacy mechanism that addresses this problem. The proposed solutions provide additional trustworthiness and reliability at modest cost of memory and energy. Also, we proved that our proposed solutions provide protection against various privacy disclosure attacks, such as eavesdropping and hop-by-hop trace back attacks.

Energy-aware virtual network embedding in flexi-grid optical networks

NASA Astrophysics Data System (ADS)

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

2018-01-01

Virtual network embedding (VNE) problem is to map multiple heterogeneous virtual networks (VN) on a shared substrate network, which mitigate the ossification of the substrate network. Meanwhile, energy efficiency has been widely considered in the network design. In this paper, we aim to solve the energy-aware VNE problem in flexi-grid optical networks. We provide an integer linear programming (ILP) formulation to minimize the power increment of each arriving VN request. We also propose a polynomial-time heuristic algorithm where virtual links are embedded sequentially to keep a reasonable acceptance ratio and maintain a low energy consumption. Numerical results show the functionality of the heuristic algorithm in a 24-node network.

Recent research in network problems with applications

NASA Technical Reports Server (NTRS)

Thompson, G. L.

1980-01-01

The capabilities of network codes and their extensions are surveyed in regard to specially structured integer programming problems which are solved by using the solutions of a series of ordinary network problems.

Localized states in an unbounded neural field equation with smooth firing rate function: a multi-parameter analysis.

PubMed

Faye, Grégory; Rankin, James; Chossat, Pascal

2013-05-01

The existence of spatially localized solutions in neural networks is an important topic in neuroscience as these solutions are considered to characterize working (short-term) memory. We work with an unbounded neural network represented by the neural field equation with smooth firing rate function and a wizard hat spatial connectivity. Noting that stationary solutions of our neural field equation are equivalent to homoclinic orbits in a related fourth order ordinary differential equation, we apply normal form theory for a reversible Hopf bifurcation to prove the existence of localized solutions; further, we present results concerning their stability. Numerical continuation is used to compute branches of localized solution that exhibit snaking-type behaviour. We describe in terms of three parameters the exact regions for which localized solutions persist.

Research on NGN network control technology

NASA Astrophysics Data System (ADS)

Li, WenYao; Zhou, Fang; Wu, JianXue; Li, ZhiGuang

2004-04-01

Nowadays NGN (Next Generation Network) is the hotspot for discussion and research in IT section. The NGN core technology is the network control technology. The key goal of NGN is to realize the network convergence and evolution. Referring to overlay network model core on Softswitch technology, circuit switch network and IP network convergence realized. Referring to the optical transmission network core on ASTN/ASON, service layer (i.e. IP layer) and optical transmission convergence realized. Together with the distributing feature of NGN network control technology, on NGN platform, overview of combining Softswitch and ASTN/ASON control technology, the solution whether IP should be the NGN core carrier platform attracts general attention, and this is also a QoS problem on NGN end to end. This solution produces the significant practical meaning on equipment development, network deployment, network design and optimization, especially on realizing present network smooth evolving to the NGN. This is why this paper puts forward the research topic on the NGN network control technology. This paper introduces basics on NGN network control technology, then proposes NGN network control reference model, at the same time describes a realizable network structure of NGN. Based on above, from the view of function realization, NGN network control technology is discussed and its work mechanism is analyzed.

A Hardware-Supported Algorithm for Self-Managed and Choreographed Task Execution in Sensor Networks.

PubMed

Bordel, Borja; Miguel, Carlos; Alcarria, Ramón; Robles, Tomás

2018-03-07

Nowadays, sensor networks are composed of a great number of tiny resource-constraint nodes, whose management is increasingly more complex. In fact, although collaborative or choreographic task execution schemes are which fit in the most perfect way with the nature of sensor networks, they are rarely implemented because of the high resource consumption of these algorithms (especially if networks include many resource-constrained devices). On the contrary, hierarchical networks are usually designed, in whose cusp it is included a heavy orchestrator with a remarkable processing power, being able to implement any necessary management solution. However, although this orchestration approach solves most practical management problems of sensor networks, a great amount of the operation time is wasted while nodes request the orchestrator to address a conflict and they obtain the required instructions to operate. Therefore, in this paper it is proposed a new mechanism for self-managed and choreographed task execution in sensor networks. The proposed solution considers only a lightweight gateway instead of traditional heavy orchestrators and a hardware-supported algorithm, which consume a negligible amount of resources in sensor nodes. The gateway avoids the congestion of the entire sensor network and the hardware-supported algorithm enables a choreographed task execution scheme, so no particular node is overloaded. The performance of the proposed solution is evaluated through numerical and electronic ModelSim-based simulations.

Reliable design of a closed loop supply chain network under uncertainty: An interval fuzzy possibilistic chance-constrained model

NASA Astrophysics Data System (ADS)

Vahdani, Behnam; Tavakkoli-Moghaddam, Reza; Jolai, Fariborz; Baboli, Arman

2013-06-01

This article seeks to offer a systematic approach to establishing a reliable network of facilities in closed loop supply chains (CLSCs) under uncertainties. Facilities that are located in this article concurrently satisfy both traditional objective functions and reliability considerations in CLSC network designs. To attack this problem, a novel mathematical model is developed that integrates the network design decisions in both forward and reverse supply chain networks. The model also utilizes an effective reliability approach to find a robust network design. In order to make the results of this article more realistic, a CLSC for a case study in the iron and steel industry has been explored. The considered CLSC is multi-echelon, multi-facility, multi-product and multi-supplier. Furthermore, multiple facilities exist in the reverse logistics network leading to high complexities. Since the collection centres play an important role in this network, the reliability concept of these facilities is taken into consideration. To solve the proposed model, a novel interactive hybrid solution methodology is developed by combining a number of efficient solution approaches from the recent literature. The proposed solution methodology is a bi-objective interval fuzzy possibilistic chance-constraint mixed integer linear programming (BOIFPCCMILP). Finally, computational experiments are provided to demonstrate the applicability and suitability of the proposed model in a supply chain environment and to help decision makers facilitate their analyses.

Consensus-Based Cooperative Control Based on Pollution Sensing and Traffic Information for Urban Traffic Networks

PubMed Central

Artuñedo, Antonio; del Toro, Raúl M.; Haber, Rodolfo E.

2017-01-01

Nowadays many studies are being conducted to develop solutions for improving the performance of urban traffic networks. One of the main challenges is the necessary cooperation among different entities such as vehicles or infrastructure systems and how to exploit the information available through networks of sensors deployed as infrastructures for smart cities. In this work an algorithm for cooperative control of urban subsystems is proposed to provide a solution for mobility problems in cities. The interconnected traffic lights controller (TLC) network adapts traffic lights cycles, based on traffic and air pollution sensory information, in order to improve the performance of urban traffic networks. The presence of air pollution in cities is not only caused by road traffic but there are other pollution sources that contribute to increase or decrease the pollution level. Due to the distributed and heterogeneous nature of the different components involved, a system of systems engineering approach is applied to design a consensus-based control algorithm. The designed control strategy contains a consensus-based component that uses the information shared in the network for reaching a consensus in the state of TLC network components. Discrete event systems specification is applied for modelling and simulation. The proposed solution is assessed by simulation studies with very promising results to deal with simultaneous responses to both pollution levels and traffic flows in urban traffic networks. PMID:28445398

A Hardware-Supported Algorithm for Self-Managed and Choreographed Task Execution in Sensor Networks

PubMed Central

2018-01-01

Nowadays, sensor networks are composed of a great number of tiny resource-constraint nodes, whose management is increasingly more complex. In fact, although collaborative or choreographic task execution schemes are which fit in the most perfect way with the nature of sensor networks, they are rarely implemented because of the high resource consumption of these algorithms (especially if networks include many resource-constrained devices). On the contrary, hierarchical networks are usually designed, in whose cusp it is included a heavy orchestrator with a remarkable processing power, being able to implement any necessary management solution. However, although this orchestration approach solves most practical management problems of sensor networks, a great amount of the operation time is wasted while nodes request the orchestrator to address a conflict and they obtain the required instructions to operate. Therefore, in this paper it is proposed a new mechanism for self-managed and choreographed task execution in sensor networks. The proposed solution considers only a lightweight gateway instead of traditional heavy orchestrators and a hardware-supported algorithm, which consume a negligible amount of resources in sensor nodes. The gateway avoids the congestion of the entire sensor network and the hardware-supported algorithm enables a choreographed task execution scheme, so no particular node is overloaded. The performance of the proposed solution is evaluated through numerical and electronic ModelSim-based simulations. PMID:29518986

Common solutions for power, communication and robustness in operations of large measurement networks within Research Infrastructures

NASA Astrophysics Data System (ADS)

Huber, Robert; Beranzoli, Laura; Fiebig, Markus; Gilbert, Olivier; Laj, Paolo; Mazzola, Mauro; Paris, Jean-Daniel; Pedersen, Helle; Stocker, Markus; Vitale, Vito; Waldmann, Christoph

2017-04-01

European Environmental Research Infrastructures (RI) frequently comprise in situ observatories from large-scale networks of platforms or sites to local networks of various sensors. Network operation is usually a cumbersome aspect of these RIs facing specific technological problems related to operations in remote areas, maintenance of the network, transmission of observation values, etc.. Robust inter-connection within and across these networks is still at infancy level and the burden increases with remoteness of the station, harshness of environmental conditions, and unavailability of classic communication systems, which is a common feature here. Despite existing RIs having developed ad-hoc solutions to overcome specific problems and innovative technologies becoming available, no common approach yet exists. Within the European project ENVRIplus, a dedicated work package aims to stimulate common network operation technologies and approaches in terms of power supply and storage, robustness, and data transmission. Major objectives of this task are to review existing technologies and RI requirements, propose innovative solutions and evaluate the standardization potential prior to wider deployment across networks. Focus areas within these efforts are: improving energy production and storage units, testing robustness of RI equipment towards extreme conditions as well as methodologies for robust data transmission. We will introduce current project activities which are coordinated at various levels including the engineering as well as the data management perspective, and explain how environmental RIs can benefit from the developments.

Consensus-Based Cooperative Control Based on Pollution Sensing and Traffic Information for Urban Traffic Networks.

PubMed

Artuñedo, Antonio; Del Toro, Raúl M; Haber, Rodolfo E

2017-04-26

Nowadays many studies are being conducted to develop solutions for improving the performance of urban traffic networks. One of the main challenges is the necessary cooperation among different entities such as vehicles or infrastructure systems and how to exploit the information available through networks of sensors deployed as infrastructures for smart cities. In this work an algorithm for cooperative control of urban subsystems is proposed to provide a solution for mobility problems in cities. The interconnected traffic lights controller ( TLC ) network adapts traffic lights cycles, based on traffic and air pollution sensory information, in order to improve the performance of urban traffic networks. The presence of air pollution in cities is not only caused by road traffic but there are other pollution sources that contribute to increase or decrease the pollution level. Due to the distributed and heterogeneous nature of the different components involved, a system of systems engineering approach is applied to design a consensus-based control algorithm. The designed control strategy contains a consensus-based component that uses the information shared in the network for reaching a consensus in the state of TLC network components. Discrete event systems specification is applied for modelling and simulation. The proposed solution is assessed by simulation studies with very promising results to deal with simultaneous responses to both pollution levels and traffic flows in urban traffic networks.

Relay Selection for Cooperative Relaying in Wireless Energy Harvesting Networks

NASA Astrophysics Data System (ADS)

Zhu, Kaiyan; Wang, Fei; Li, Songsong; Jiang, Fengjiao; Cao, Lijie

2018-01-01

Energy harvesting from the surroundings is a promising solution to provide energy supply and extend the life of wireless sensor networks. Recently, energy harvesting has been shown as an attractive solution to prolong the operation of cooperative networks. In this paper, we propose a relay selection scheme to optimize the amplify-and-forward (AF) cooperative transmission in wireless energy harvesting cooperative networks. The harvesting energy and channel conditions are considered to select the optimal relay as cooperative relay to minimize the outage probability of the system. Simulation results show that our proposed relay selection scheme achieves better outage performance than other strategies.

How to cluster in parallel with neural networks

NASA Technical Reports Server (NTRS)

Kamgar-Parsi, Behzad; Gualtieri, J. A.; Devaney, Judy E.; Kamgar-Parsi, Behrooz

1988-01-01

Partitioning a set of N patterns in a d-dimensional metric space into K clusters - in a way that those in a given cluster are more similar to each other than the rest - is a problem of interest in astrophysics, image analysis and other fields. As there are approximately K(N)/K (factorial) possible ways of partitioning the patterns among K clusters, finding the best solution is beyond exhaustive search when N is large. Researchers show that this problem can be formulated as an optimization problem for which very good, but not necessarily optimal solutions can be found by using a neural network. To do this the network must start from many randomly selected initial states. The network is simulated on the MPP (a 128 x 128 SIMD array machine), where researchers use the massive parallelism not only in solving the differential equations that govern the evolution of the network, but also by starting the network from many initial states at once, thus obtaining many solutions in one run. Researchers obtain speedups of two to three orders of magnitude over serial implementations and the promise through Analog VLSI implementations of speedups comensurate with human perceptual abilities.

Identification of Correlated GRACE Monthly Harmonic Coefficients Using Pattern Recognition and Neural Networks

NASA Astrophysics Data System (ADS)

Piretzidis, D.; Sra, G.; Sideris, M. G.

2016-12-01

This study explores new methods for identifying correlation errors in harmonic coefficients derived from monthly solutions of the Gravity Recovery and Climate Experiment (GRACE) satellite mission using pattern recognition and neural network algorithms. These correlation errors are evidenced in the differences between monthly solutions and can be suppressed using a de-correlation filter. In all studies so far, the implementation of the de-correlation filter starts from a specific minimum order (i.e., 11 for RL04 and 38 for RL05) until the maximum order of the monthly solution examined. This implementation method has two disadvantages, namely, the omission of filtering correlated coefficients of order less than the minimum order and the filtering of uncorrelated coefficients of order higher than the minimum order. In the first case, the filtered solution is not completely free of correlated errors, whereas the second case results in a monthly solution that suffers from loss of geophysical signal. In the present study, a new method of implementing the de-correlation filter is suggested, by identifying and filtering only the coefficients that show indications of high correlation. Several numerical and geometric properties of the harmonic coefficient series of all orders are examined. Extreme cases of both correlated and uncorrelated coefficients are selected, and their corresponding properties are used to train a two-layer feed-forward neural network. The objective of the neural network is to identify and quantify the correlation by providing the probability of an order of coefficients to be correlated. Results show good performance of the neural network, both in the validation stage of the training procedure and in the subsequent use of the trained network to classify independent coefficients. The neural network is also capable of identifying correlated coefficients even when a small number of training samples and neurons are used (e.g.,100 and 10, respectively).

Spatial-Temporal Reasoning Applications of Computational Intelligence in the Game of Go and Computer Networks

DTIC Science & Technology

2012-01-01

dimensionality, Tesauro used a backpropagation- based , three-layer neural network and implemented the outcome from a self-play game as the reinforcement signal...a school of fish, flock of birds, and colony of ants. Our literature review reveals that no one has used PSO to train the neural network ...trained with a variant of PSO called cellular PSO (CPSO). CSRN is a supervised learning neural network (SLNN). The proposed algorithm for the

Terminal attractors in neural networks

NASA Technical Reports Server (NTRS)

Zak, Michail

1989-01-01

A new type of attractor (terminal attractors) for content-addressable memory, associative memory, and pattern recognition in artificial neural networks operating in continuous time is introduced. The idea of a terminal attractor is based upon a violation of the Lipschitz condition at a fixed point. As a result, the fixed point becomes a singular solution which envelopes the family of regular solutions, while each regular solution approaches such an attractor in finite time. It will be shown that terminal attractors can be incorporated into neural networks such that any desired set of these attractors with prescribed basins is provided by an appropriate selection of the synaptic weights. The applications of terminal attractors for content-addressable and associative memories, pattern recognition, self-organization, and for dynamical training are illustrated.

Using genetic algorithms to determine near-optimal pricing, investment and operating strategies in the electric power industry

NASA Astrophysics Data System (ADS)

Wu, Dongjun

Network industries have technologies characterized by a spatial hierarchy, the "network," with capital-intensive interconnections and time-dependent, capacity-limited flows of products and services through the network to customers. This dissertation studies service pricing, investment and business operating strategies for the electric power network. First-best solutions for a variety of pricing and investment problems have been studied. The evaluation of genetic algorithms (GA, which are methods based on the idea of natural evolution) as a primary means of solving complicated network problems, both w.r.t. pricing: as well as w.r.t. investment and other operating decisions, has been conducted. New constraint-handling techniques in GAs have been studied and tested. The actual application of such constraint-handling techniques in solving practical non-linear optimization problems has been tested on several complex network design problems with encouraging initial results. Genetic algorithms provide solutions that are feasible and close to optimal when the optimal solution is know; in some instances, the near-optimal solutions for small problems by the proposed GA approach can only be tested by pushing the limits of currently available non-linear optimization software. The performance is far better than several commercially available GA programs, which are generally inadequate in solving any of the problems studied in this dissertation, primarily because of their poor handling of constraints. Genetic algorithms, if carefully designed, seem very promising in solving difficult problems which are intractable by traditional analytic methods.

Closed Loop Experiment Manager (CLEM)-An Open and Inexpensive Solution for Multichannel Electrophysiological Recordings and Closed Loop Experiments.

PubMed

Hazan, Hananel; Ziv, Noam E

2017-01-01

There is growing need for multichannel electrophysiological systems that record from and interact with neuronal systems in near real-time. Such systems are needed, for example, for closed loop, multichannel electrophysiological/optogenetic experimentation in vivo and in a variety of other neuronal preparations, or for developing and testing neuro-prosthetic devices, to name a few. Furthermore, there is a need for such systems to be inexpensive, reliable, user friendly, easy to set-up, open and expandable, and possess long life cycles in face of rapidly changing computing environments. Finally, they should provide powerful, yet reasonably easy to implement facilities for developing closed-loop protocols for interacting with neuronal systems. Here, we survey commercial and open source systems that address these needs to varying degrees. We then present our own solution, which we refer to as Closed Loop Experiments Manager (CLEM). CLEM is an open source, soft real-time, Microsoft Windows desktop application that is based on a single generic personal computer (PC) and an inexpensive, general-purpose data acquisition board. CLEM provides a fully functional, user-friendly graphical interface, possesses facilities for recording, presenting and logging electrophysiological data from up to 64 analog channels, and facilities for controlling external devices, such as stimulators, through digital and analog interfaces. Importantly, it includes facilities for running closed-loop protocols written in any programming language that can generate dynamic link libraries (DLLs). We describe the application, its architecture and facilities. We then demonstrate, using networks of cortical neurons growing on multielectrode arrays (MEA) that despite its reliance on generic hardware, its performance is appropriate for flexible, closed-loop experimentation at the neuronal network level.

Closed Loop Experiment Manager (CLEM)—An Open and Inexpensive Solution for Multichannel Electrophysiological Recordings and Closed Loop Experiments

PubMed Central

Hazan, Hananel; Ziv, Noam E.

2017-01-01

There is growing need for multichannel electrophysiological systems that record from and interact with neuronal systems in near real-time. Such systems are needed, for example, for closed loop, multichannel electrophysiological/optogenetic experimentation in vivo and in a variety of other neuronal preparations, or for developing and testing neuro-prosthetic devices, to name a few. Furthermore, there is a need for such systems to be inexpensive, reliable, user friendly, easy to set-up, open and expandable, and possess long life cycles in face of rapidly changing computing environments. Finally, they should provide powerful, yet reasonably easy to implement facilities for developing closed-loop protocols for interacting with neuronal systems. Here, we survey commercial and open source systems that address these needs to varying degrees. We then present our own solution, which we refer to as Closed Loop Experiments Manager (CLEM). CLEM is an open source, soft real-time, Microsoft Windows desktop application that is based on a single generic personal computer (PC) and an inexpensive, general-purpose data acquisition board. CLEM provides a fully functional, user-friendly graphical interface, possesses facilities for recording, presenting and logging electrophysiological data from up to 64 analog channels, and facilities for controlling external devices, such as stimulators, through digital and analog interfaces. Importantly, it includes facilities for running closed-loop protocols written in any programming language that can generate dynamic link libraries (DLLs). We describe the application, its architecture and facilities. We then demonstrate, using networks of cortical neurons growing on multielectrode arrays (MEA) that despite its reliance on generic hardware, its performance is appropriate for flexible, closed-loop experimentation at the neuronal network level. PMID:29093659

Knapsack - TOPSIS Technique for Vertical Handover in Heterogeneous Wireless Network

PubMed Central

2015-01-01

In a heterogeneous wireless network, handover techniques are designed to facilitate anywhere/anytime service continuity for mobile users. Consistent best-possible access to a network with widely varying network characteristics requires seamless mobility management techniques. Hence, the vertical handover process imposes important technical challenges. Handover decisions are triggered for continuous connectivity of mobile terminals. However, bad network selection and overload conditions in the chosen network can cause fallout in the form of handover failure. In order to maintain the required Quality of Service during the handover process, decision algorithms should incorporate intelligent techniques. In this paper, a new and efficient vertical handover mechanism is implemented using a dynamic programming method from the operation research discipline. This dynamic programming approach, which is integrated with the Technique to Order Preference by Similarity to Ideal Solution (TOPSIS) method, provides the mobile user with the best handover decisions. Moreover, in this proposed handover algorithm a deterministic approach which divides the network into zones is incorporated into the network server in order to derive an optimal solution. The study revealed that this method is found to achieve better performance and QoS support to users and greatly reduce the handover failures when compared to the traditional TOPSIS method. The decision arrived at the zone gateway using this operational research analytical method (known as the dynamic programming knapsack approach together with Technique to Order Preference by Similarity to Ideal Solution) yields remarkably better results in terms of the network performance measures such as throughput and delay. PMID:26237221

optGpSampler: an improved tool for uniformly sampling the solution-space of genome-scale metabolic networks.

PubMed

Megchelenbrink, Wout; Huynen, Martijn; Marchiori, Elena

2014-01-01

Constraint-based models of metabolic networks are typically underdetermined, because they contain more reactions than metabolites. Therefore the solutions to this system do not consist of unique flux rates for each reaction, but rather a space of possible flux rates. By uniformly sampling this space, an estimated probability distribution for each reaction's flux in the network can be obtained. However, sampling a high dimensional network is time-consuming. Furthermore, the constraints imposed on the network give rise to an irregularly shaped solution space. Therefore more tailored, efficient sampling methods are needed. We propose an efficient sampling algorithm (called optGpSampler), which implements the Artificial Centering Hit-and-Run algorithm in a different manner than the sampling algorithm implemented in the COBRA Toolbox for metabolic network analysis, here called gpSampler. Results of extensive experiments on different genome-scale metabolic networks show that optGpSampler is up to 40 times faster than gpSampler. Application of existing convergence diagnostics on small network reconstructions indicate that optGpSampler converges roughly ten times faster than gpSampler towards similar sampling distributions. For networks of higher dimension (i.e. containing more than 500 reactions), we observed significantly better convergence of optGpSampler and a large deviation between the samples generated by the two algorithms. optGpSampler for Matlab and Python is available for non-commercial use at: http://cs.ru.nl/~wmegchel/optGpSampler/.

Knapsack--TOPSIS Technique for Vertical Handover in Heterogeneous Wireless Network.

PubMed

Malathy, E M; Muthuswamy, Vijayalakshmi

2015-01-01

In a heterogeneous wireless network, handover techniques are designed to facilitate anywhere/anytime service continuity for mobile users. Consistent best-possible access to a network with widely varying network characteristics requires seamless mobility management techniques. Hence, the vertical handover process imposes important technical challenges. Handover decisions are triggered for continuous connectivity of mobile terminals. However, bad network selection and overload conditions in the chosen network can cause fallout in the form of handover failure. In order to maintain the required Quality of Service during the handover process, decision algorithms should incorporate intelligent techniques. In this paper, a new and efficient vertical handover mechanism is implemented using a dynamic programming method from the operation research discipline. This dynamic programming approach, which is integrated with the Technique to Order Preference by Similarity to Ideal Solution (TOPSIS) method, provides the mobile user with the best handover decisions. Moreover, in this proposed handover algorithm a deterministic approach which divides the network into zones is incorporated into the network server in order to derive an optimal solution. The study revealed that this method is found to achieve better performance and QoS support to users and greatly reduce the handover failures when compared to the traditional TOPSIS method. The decision arrived at the zone gateway using this operational research analytical method (known as the dynamic programming knapsack approach together with Technique to Order Preference by Similarity to Ideal Solution) yields remarkably better results in terms of the network performance measures such as throughput and delay.

Research on Information Sharing Mechanism of Network Organization Based on Evolutionary Game

NASA Astrophysics Data System (ADS)

Wang, Lin; Liu, Gaozhi

2018-02-01

This article first elaborates the concept and effect of network organization, and the ability to share information is analyzed, secondly introduces the evolutionary game theory, network organization for information sharing all kinds of limitations, establishes the evolutionary game model, analyzes the dynamic evolution of network organization of information sharing, through reasoning and evolution. The network information sharing by the initial state and two sides of the game payoff matrix of excess profits and information is the information sharing of cost and risk sharing are the influence of network organization node information sharing decision.

Heterogeneity in hydraulic conductivity and its role on the macroscale transport of a solute plume: From measurements to a practical application of stochastic flow and transport theory

NASA Astrophysics Data System (ADS)

Sudicky, E. A.; Illman, W. A.; Goltz, I. K.; Adams, J. J.; McLaren, R. G.

2010-01-01

The spatial variability of hydraulic conductivity in a shallow unconfined aquifer located at North Bay, Ontario, composed of glacial-lacustrine and glacial-fluvial sands, is examined in exceptional detail and characterized geostatistically. A total of 1878 permeameter measurements were performed at 0.05 m vertical intervals along cores taken from 20 boreholes along two intersecting transect lines. Simultaneous three-dimensional (3-D) fitting of Ln(K) variogram data to an exponential model yielded geostatistical parameters for the estimation of bulk hydraulic conductivity and solute dispersion parameters. The analysis revealed a Ln(K) variance equal to about 2.0 and 3-D anisotropy of the correlation structure of the heterogeneity (λ1, λ2, and λ3 equal to 17.19, 7.39, and 1.0 m, respectively). Effective values of the hydraulic conductivity tensor and the value of the longitudinal macrodispersivity were calculated using the theoretical expressions of Gelhar and Axness (1983). The magnitude of the longitudinal macrodispersivity is reasonably consistent with the observed degree of longitudinal dispersion of the landfill plume along the principal path of migration. Variably saturated 3-D flow modeling using the statistically derived effective hydraulic conductivity tensor allowed a reasonably close prediction of the measured water table and the observed heads at various depths in an array of piezometers. Concomitant transport modeling using the calculated longitudinal macrodispersivity reasonably predicted the extent and migration rates of the observed contaminant plume that was monitored using a network of multilevel samplers over a period of about 5 years. It was further demonstrated that the length of the plume is relatively insensitive to the value of the longitudinal macrodispersivity under the conditions of a steady flow in 3-D and constant source strength. This study demonstrates that the use of statistically derived parameters based on stochastic theories results in reliable large-scale 3-D flow and transport models for complex hydrogeological systems. This is in agreement with the conclusions reached by Sudicky (1986) at the site of an elaborate tracer test conducted in the aquifer at the Canadian Forces Base Borden.

Algorithms for optimization of branching gravity-driven water networks

NASA Astrophysics Data System (ADS)

Dardani, Ian; Jones, Gerard F.

2018-05-01

The design of a water network involves the selection of pipe diameters that satisfy pressure and flow requirements while considering cost. A variety of design approaches can be used to optimize for hydraulic performance or reduce costs. To help designers select an appropriate approach in the context of gravity-driven water networks (GDWNs), this work assesses three cost-minimization algorithms on six moderate-scale GDWN test cases. Two algorithms, a backtracking algorithm and a genetic algorithm, use a set of discrete pipe diameters, while a new calculus-based algorithm produces a continuous-diameter solution which is mapped onto a discrete-diameter set. The backtracking algorithm finds the global optimum for all but the largest of cases tested, for which its long runtime makes it an infeasible option. The calculus-based algorithm's discrete-diameter solution produced slightly higher-cost results but was more scalable to larger network cases. Furthermore, the new calculus-based algorithm's continuous-diameter and mapped solutions provided lower and upper bounds, respectively, on the discrete-diameter global optimum cost, where the mapped solutions were typically within one diameter size of the global optimum. The genetic algorithm produced solutions even closer to the global optimum with consistently short run times, although slightly higher solution costs were seen for the larger network cases tested. The results of this study highlight the advantages and weaknesses of each GDWN design method including closeness to the global optimum, the ability to prune the solution space of infeasible and suboptimal candidates without missing the global optimum, and algorithm run time. We also extend an existing closed-form model of Jones (2011) to include minor losses and a more comprehensive two-part cost model, which realistically applies to pipe sizes that span a broad range typical of GDWNs of interest in this work, and for smooth and commercial steel roughness values.

Simulation and experimental study of 802.11 based networking for vehicular management and safety.

DOT National Transportation Integrated Search

2009-03-01

This work focuses on the use of wireless networking techniques for their potential impact in providing : information for traffic management, control and public safety goals. The premise of this work is based on the : reasonable expectation that vehic...

Beaming Your School into the 21st Century.

ERIC Educational Resources Information Center

Pfeifer, R. Scott; Robb, Rick

2001-01-01

Mindsurf Networks--a partnership involving a suburban Baltimore high school, Sylvan Ventures, and Aether Systems--provides a cutting-edge, reasonably priced, networked mobile computing platform for learning. Handheld computers help students solve problems and beam information to teachers and each other. Partnership initiation strategies for…

Characterizing Behavioral and Brain Changes Associated with Practicing Reasoning Skills

PubMed Central

Mackey, Allyson P.; Miller Singley, Alison T.; Wendelken, Carter; Bunge, Silvia A.

2015-01-01

We have reported previously that intensive preparation for a standardized test that taxes reasoning leads to changes in structural and functional connectivity within the frontoparietal network. Here, we investigated whether reasoning instruction transfers to improvement on unpracticed tests of reasoning, and whether these improvements are associated with changes in neural recruitment during reasoning task performance. We found behavioral evidence for transfer to a transitive inference task, but no evidence for transfer to a rule generation task. Across both tasks, we observed reduced lateral prefrontal activation in the trained group relative to the control group, consistent with other studies of practice-related changes in brain activation. In the transitive inference task, we observed enhanced suppression of task-negative, or default-mode, regions, consistent with work suggesting that better cognitive skills are associated with more efficient switching between networks. In the rule generation task, we found a pattern consistent with a training-related shift in the balance between phonological and visuospatial processing. Broadly, we discuss general methodological considerations related to the analysis and interpretation of training-related changes in brain activation. In summary, we present preliminary evidence for changes in brain activation associated with practice of high-level cognitive skills. PMID:26368278

Effective professional networking.

PubMed

Goolsby, Mary Jo; Knestrick, Joyce M

2017-08-01

The reasons for nurse practitioners to develop a professional network are boundless and are likely to change over time. Networking opens doors and creates relationships that support new opportunities, personal development, collaborative research, policy activism, evidence-based practice, and more. Successful professional networking involves shared, mutually beneficial interactions between individuals and/or individuals and groups, regardless of whether it occurs face to face or electronically. This article combines nuggets from the literature with guidance based on the authors' combined experience in networking activities at the local, national, and international levels. ©2017 American Association of Nurse Practitioners.

Networking for philanthropy: increasing volunteer behavior via social networking sites.

PubMed

Kim, Yoojung; Lee, Wei-Na

2014-03-01

Social networking sites (SNSs) provide a unique social venue to engage the young generation in philanthropy through their networking capabilities. An integrated model that incorporates social capital into the Theory of Reasoned Action is developed to explain volunteer behavior through social networks. As expected, volunteer behavior was predicted by volunteer intention, which was influenced by attitudes and subjective norms. In addition, social capital, an outcome of the extensive use of SNSs, was as an important driver of users' attitude and subjective norms toward volunteering via SNSs.

Solute transport with multisegment, equilibrium-controlled, classical reactions: Problem solvability and feed forward method's applicability for complex segments of at most binary participants

USGS Publications Warehouse

Rubin, Jacob

1992-01-01

The feed forward (FF) method derives efficient operational equations for simulating transport of reacting solutes. It has been shown to be applicable in the presence of networks with any number of homogeneous and/or heterogeneous, classical reaction segments that consist of three, at most binary participants. Using a sequential (network type after network type) exploration approach and, independently, theoretical explanations, it is demonstrated for networks with classical reaction segments containing more than three, at most binary participants that if any one of such networks leads to a solvable transport problem then the FF method is applicable. Ways of helping to avoid networks that produce problem insolvability are developed and demonstrated. A previously suggested algebraic, matrix rank procedure has been adapted and augmented to serve as the main, easy-to-apply solvability test for already postulated networks. Four network conditions that often generate insolvability have been identified and studied. Their early detection during network formulation may help to avoid postulation of insolvable networks.

Possibilities: A framework for modeling students' deductive reasoning in physics

NASA Astrophysics Data System (ADS)

Gaffney, Jonathan David Housley

Students often make errors when trying to solve qualitative or conceptual physics problems, and while many successful instructional interventions have been generated to prevent such errors, the process of deduction that students use when solving physics problems has not been thoroughly studied. In an effort to better understand that reasoning process, I have developed a new framework, which is based on the mental models framework in psychology championed by P. N. Johnson-Laird. My new framework models how students search possibility space when thinking about conceptual physics problems and suggests that errors arise from failing to flesh out all possibilities. It further suggests that instructional interventions should focus on making apparent those possibilities, as well as all physical consequences those possibilities would incur. The possibilities framework emerged from the analysis of data from a unique research project specifically invented for the purpose of understanding how students use deductive reasoning. In the selection task, participants were given a physics problem along with three written possible solutions with the goal of identifying which one of the three possible solutions was correct. Each participant was also asked to identify the errors in the incorrect solutions. For the study presented in this dissertation, participants not only performed the selection task individually on four problems, but they were also placed into groups of two or three and asked to discuss with each other the reasoning they used in making their choices and attempt to reach a consensus about which solution was correct. Finally, those groups were asked to work together to perform the selection task on three new problems. The possibilities framework appropriately models the reasoning that students use, and it makes useful predictions about potentially helpful instructional interventions. The study reported in this dissertation emphasizes the useful insight the possibilities framework provides. For example, this framework allows us to detect subtle differences in students' reasoning errors, even when those errors result in the same final answer. It also illuminates how simply mentioning overlooked quantities can instigate new lines of student reasoning. It allows us to better understand how well-known psychological biases, such as the belief bias, affect the reasoning process by preventing reasoners from fleshing out all of the possibilities. The possibilities framework also allows us to track student discussions about physics, revealing the need for all parties in communication to use the same set of possibilities in the conversations to facilitate successful understanding. The framework also suggests some of the influences that affect how reasoners choose between possible solutions to a given problem. This new framework for understanding how students reason when solving conceptual physics problems opens the door to a significant field of research. The framework itself needs to be further tested and developed, but it provides substantial suggestions for instructional interventions. If we hope to improve student reasoning in physics, the possibilities framework suggests that we are perhaps best served by teaching students how to fully flesh out the possibilities in every situation. This implies that we need to ensure students have a deep understanding of all of the implied possibilities afforded by the fundamental principles that are the cornerstones of the models we teach in physics classes.

The Traffic Adaptive Data Dissemination (TrAD) Protocol for both Urban and Highway Scenarios.

PubMed

Tian, Bin; Hou, Kun Mean; Zhou, Haiying

2016-06-21

The worldwide economic cost of road crashes and injuries is estimated to be US$518 billion per year and the annual congestion cost in France is estimated to be €5.9 billion. Vehicular Ad hoc Networks (VANETs) are one solution to improve transport features such as traffic safety, traffic jam and infotainment on wheels, where a great number of event-driven messages need to be disseminated in a timely way in a region of interest. In comparison with traditional wireless networks, VANETs have to consider the highly dynamic network topology and lossy links due to node mobility. Inter-Vehicle Communication (IVC) protocols are the keystone of VANETs. According to our survey, most of the proposed IVC protocols focus on either highway or urban scenarios, but not on both. Furthermore, too few protocols, considering both scenarios, can achieve high performance. In this paper, an infrastructure-less Traffic Adaptive data Dissemination (TrAD) protocol which takes into account road traffic and network traffic status for both highway and urban scenarios will be presented. TrAD has double broadcast suppression techniques and is designed to adapt efficiently to the irregular road topology. The performance of the TrAD protocol was evaluated quantitatively by means of realistic simulations taking into account different real road maps, traffic routes and vehicular densities. The obtained simulation results show that TrAD is more efficient in terms of packet delivery ratio, number of transmissions and delay in comparison with the performance of three well-known reference protocols. Moreover, TrAD can also tolerate a reasonable degree of GPS drift and still achieve efficient data dissemination.

The Traffic Adaptive Data Dissemination (TrAD) Protocol for both Urban and Highway Scenarios

PubMed Central

Tian, Bin; Hou, Kun Mean; Zhou, Haiying

2016-01-01

The worldwide economic cost of road crashes and injuries is estimated to be US$518 billion per year and the annual congestion cost in France is estimated to be €5.9 billion. Vehicular Ad hoc Networks (VANETs) are one solution to improve transport features such as traffic safety, traffic jam and infotainment on wheels, where a great number of event-driven messages need to be disseminated in a timely way in a region of interest. In comparison with traditional wireless networks, VANETs have to consider the highly dynamic network topology and lossy links due to node mobility. Inter-Vehicle Communication (IVC) protocols are the keystone of VANETs. According to our survey, most of the proposed IVC protocols focus on either highway or urban scenarios, but not on both. Furthermore, too few protocols, considering both scenarios, can achieve high performance. In this paper, an infrastructure-less Traffic Adaptive data Dissemination (TrAD) protocol which takes into account road traffic and network traffic status for both highway and urban scenarios will be presented. TrAD has double broadcast suppression techniques and is designed to adapt efficiently to the irregular road topology. The performance of the TrAD protocol was evaluated quantitatively by means of realistic simulations taking into account different real road maps, traffic routes and vehicular densities. The obtained simulation results show that TrAD is more efficient in terms of packet delivery ratio, number of transmissions and delay in comparison with the performance of three well-known reference protocols. Moreover, TrAD can also tolerate a reasonable degree of GPS drift and still achieve efficient data dissemination. PMID:27338393

ICE-Based Custom Full-Mesh Network for the CHIME High Bandwidth Radio Astronomy Correlator

NASA Astrophysics Data System (ADS)

Bandura, K.; Cliche, J. F.; Dobbs, M. A.; Gilbert, A. J.; Ittah, D.; Mena Parra, J.; Smecher, G.

2016-03-01

New generation radio interferometers encode signals from thousands of antenna feeds across large bandwidth. Channelizing and correlating this data requires networking capabilities that can handle unprecedented data rates with reasonable cost. The Canadian Hydrogen Intensity Mapping Experiment (CHIME) correlator processes 8-bits from N=2,048 digitizer inputs across 400MHz of bandwidth. Measured in N2× bandwidth, it is the largest radio correlator that is currently commissioning. Its digital back-end must exchange and reorganize the 6.6terabit/s produced by its 128 digitizing and channelizing nodes, and feed it to the 256 graphics processing unit (GPU) node spatial correlator in a way that each node obtains data from all digitizer inputs but across a small fraction of the bandwidth (i.e. ‘corner-turn’). In order to maximize performance and reliability of the corner-turn system while minimizing cost, a custom networking solution has been implemented. The system makes use of Field Programmable Gate Array (FPGA) transceivers to implement direct, passive copper, full-mesh, high speed serial connections between sixteen circuit boards in a crate, to exchange data between crates, and to offload the data to a cluster of 256 GPU nodes using standard 10Gbit/s Ethernet links. The GPU nodes complete the corner-turn by combining data from all crates and then computing visibilities. Eye diagrams and frame error counters confirm error-free operation of the corner-turn network in both the currently operating CHIME Pathfinder telescope (a prototype for the full CHIME telescope) and a representative fraction of the full CHIME hardware providing an end-to-end system validation. An analysis of an equivalent corner-turn system built with Ethernet switches instead of custom passive data links is provided.

Finite-horizon control-constrained nonlinear optimal control using single network adaptive critics.

PubMed

Heydari, Ali; Balakrishnan, Sivasubramanya N

2013-01-01

To synthesize fixed-final-time control-constrained optimal controllers for discrete-time nonlinear control-affine systems, a single neural network (NN)-based controller called the Finite-horizon Single Network Adaptive Critic is developed in this paper. Inputs to the NN are the current system states and the time-to-go, and the network outputs are the costates that are used to compute optimal feedback control. Control constraints are handled through a nonquadratic cost function. Convergence proofs of: 1) the reinforcement learning-based training method to the optimal solution; 2) the training error; and 3) the network weights are provided. The resulting controller is shown to solve the associated time-varying Hamilton-Jacobi-Bellman equation and provide the fixed-final-time optimal solution. Performance of the new synthesis technique is demonstrated through different examples including an attitude control problem wherein a rigid spacecraft performs a finite-time attitude maneuver subject to control bounds. The new formulation has great potential for implementation since it consists of only one NN with single set of weights and it provides comprehensive feedback solutions online, though it is trained offline.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wu, Qishi; Zhu, Mengxia; Rao, Nageswara S

We propose an intelligent decision support system based on sensor and computer networks that incorporates various component techniques for sensor deployment, data routing, distributed computing, and information fusion. The integrated system is deployed in a distributed environment composed of both wireless sensor networks for data collection and wired computer networks for data processing in support of homeland security defense. We present the system framework and formulate the analytical problems and develop approximate or exact solutions for the subtasks: (i) sensor deployment strategy based on a two-dimensional genetic algorithm to achieve maximum coverage with cost constraints; (ii) data routing scheme tomore » achieve maximum signal strength with minimum path loss, high energy efficiency, and effective fault tolerance; (iii) network mapping method to assign computing modules to network nodes for high-performance distributed data processing; and (iv) binary decision fusion rule that derive threshold bounds to improve system hit rate and false alarm rate. These component solutions are implemented and evaluated through either experiments or simulations in various application scenarios. The extensive results demonstrate that these component solutions imbue the integrated system with the desirable and useful quality of intelligence in decision making.« less

Influencing Busy People in a Social Network

PubMed Central

Sarkar, Kaushik; Sundaram, Hari

2016-01-01

We identify influential early adopters in a social network, where individuals are resource constrained, to maximize the spread of multiple, costly behaviors. A solution to this problem is especially important for viral marketing. The problem of maximizing influence in a social network is challenging since it is computationally intractable. We make three contributions. First, we propose a new model of collective behavior that incorporates individual intent, knowledge of neighbors actions and resource constraints. Second, we show that the multiple behavior influence maximization is NP-hard. Furthermore, we show that the problem is submodular, implying the existence of a greedy solution that approximates the optimal solution to within a constant. However, since the greedy algorithm is expensive for large networks, we propose efficient heuristics to identify the influential individuals, including heuristics to assign behaviors to the different early adopters. We test our approach on synthetic and real-world topologies with excellent results. We evaluate the effectiveness under three metrics: unique number of participants, total number of active behaviors and network resource utilization. Our heuristics produce 15-51% increase in expected resource utilization over the naïve approach. PMID:27711127

Rumor diffusion model with spatio-temporal diffusion and uncertainty of behavior decision in complex social networks

NASA Astrophysics Data System (ADS)

Zhu, Liang; Wang, Youguo

2018-07-01

In this paper, a rumor diffusion model with uncertainty of human behavior under spatio-temporal diffusion framework is established. Take physical significance of spatial diffusion into account, a diffusion threshold is set under which the rumor is not a trend topic and only spreads along determined physical connections. Heterogeneity of degree distribution and distance distribution has also been considered in theoretical model at the same time. The global existence and uniqueness of classical solution are proved with a Lyapunov function and an approximate classical solution in form of infinite series is constructed with a system of eigenfunction. Simulations and numerical solutions both on Watts-Strogatz (WS) network and Barabási-Albert (BA) network display the variation of density of infected connections from spatial and temporal dimensions. Relevant results show that the density of infected connections is dominated by network topology and uncertainty of human behavior at threshold time. With increase of social capability, rumor diffuses to the steady state in a higher speed. And the variation trends of diffusion size with uncertainty are diverse on different artificial networks.

Influencing Busy People in a Social Network.

PubMed

Sarkar, Kaushik; Sundaram, Hari

2016-01-01

We identify influential early adopters in a social network, where individuals are resource constrained, to maximize the spread of multiple, costly behaviors. A solution to this problem is especially important for viral marketing. The problem of maximizing influence in a social network is challenging since it is computationally intractable. We make three contributions. First, we propose a new model of collective behavior that incorporates individual intent, knowledge of neighbors actions and resource constraints. Second, we show that the multiple behavior influence maximization is NP-hard. Furthermore, we show that the problem is submodular, implying the existence of a greedy solution that approximates the optimal solution to within a constant. However, since the greedy algorithm is expensive for large networks, we propose efficient heuristics to identify the influential individuals, including heuristics to assign behaviors to the different early adopters. We test our approach on synthetic and real-world topologies with excellent results. We evaluate the effectiveness under three metrics: unique number of participants, total number of active behaviors and network resource utilization. Our heuristics produce 15-51% increase in expected resource utilization over the naïve approach.

Correlating Inferred Data Plane IPV6 Reboot Events With Control Plane BGP Activity

DTIC Science & Technology

2016-03-01

22 Figure 3.6 Example Border Gateway Protocol (BGP) update message . . . . 23 Figure 3.7 Customer-provider relationship with border...government USN U.S. Navy VPN Virtual Private Network xiv Acknowledgments First, I would like to thank my family for their love , support, and...network outages when they restart . Network outages occur for many reasons: hardware failure, severe weather, misconfiguration, patching, upgrades

Online Social Networking Goes to College: Two Case Studies of Higher Education Institutions That Implemented College-Created Social Networking Sites for Recruiting Undergraduate Students

ERIC Educational Resources Information Center

Ferguson, Christopher Paul

2010-01-01

With increased competition among higher education institutions for best- fit students, the profession of college admissions is compelled to implement innovative recruiting strategies (e.g. online social networking sites), that may impact college access and persistence in the United States. This qualitative study examined the reasons why two…

Ranking and clustering of nodes in networks with smart teleportation

NASA Astrophysics Data System (ADS)

Lambiotte, R.; Rosvall, M.

2012-05-01

Random teleportation is a necessary evil for ranking and clustering directed networks based on random walks. Teleportation enables ergodic solutions, but the solutions must necessarily depend on the exact implementation and parametrization of the teleportation. For example, in the commonly used PageRank algorithm, the teleportation rate must trade off a heavily biased solution with a uniform solution. Here we show that teleportation to links rather than nodes enables a much smoother trade-off and effectively more robust results. We also show that, by not recording the teleportation steps of the random walker, we can further reduce the effect of teleportation with dramatic effects on clustering.

A Green's function method for simulation of time-dependent solute transport and reaction in realistic microvascular geometries

PubMed Central

Secomb, Timothy W.

2016-01-01

A novel theoretical method is presented for simulating the spatially resolved convective and diffusive transport of reacting solutes between microvascular networks and the surrounding tissues. The method allows for efficient computational solution of problems involving convection and non-linear binding of solutes in blood flowing through microvascular networks with realistic 3D geometries, coupled with transvascular exchange and diffusion and reaction in the surrounding tissue space. The method is based on a Green's function approach, in which the solute concentration distribution in the tissue is expressed as a sum of fields generated by time-varying distributions of discrete sources and sinks. As an example of the application of the method, the washout of an inert diffusible tracer substance from a tissue region perfused by a network of microvessels is simulated, showing its dependence on the solute's transvascular permeability and tissue diffusivity. Exponential decay of the washout concentration is predicted, with rate constants that are about 10–30% lower than the rate constants for a tissue cylinder model with the same vessel length, vessel surface area and blood flow rate per tissue volume. PMID:26443811

Feasibility of a clearing house for improved cooperation between telemedicine networks delivering humanitarian services: acceptability to network coordinators.

PubMed

Wootton, Richard; Bonnardot, Laurent; Geissbuhler, Antoine; Jethwani, Kamal; Kovarik, Carrie; McGoey, Suzanne; Person, Donald A; Vladzymyrskyy, Anton; Zolfo, Maria

2012-10-09

Telemedicine networks, which deliver humanitarian services, sometimes need to share expertise to find particular experts in other networks. It has been suggested that a mechanism for sharing expertise between networks (a 'clearing house') might be useful. To propose a mechanism for implementing the clearing house concept for sharing expertise, and to confirm its feasibility in terms of acceptability to the relevant networks. We conducted a needs analysis among eight telemedicine networks delivering humanitarian services. A small proportion of consultations (5-10%) suggested that networks may experience difficulties in finding the right specialists from within their own resources. With the assistance of key stakeholders, many of whom were network coordinators, various methods of implementing a clearing house were considered. One simple solution is to establish a central database holding information about consultants who have agreed to provide help to other networks; this database could be made available to network coordinators who need a specialist when none was available in their own network. The proposed solution was examined in a desktop simulation exercise, which confirmed its feasibility and probable value. This analysis informs full-scale implementation of a clearing house, and an associated examination of its costs and benefits.

Data management for the internet of things: design primitives and solution.

PubMed

Abu-Elkheir, Mervat; Hayajneh, Mohammad; Ali, Najah Abu

2013-11-14

The Internet of Things (IoT) is a networking paradigm where interconnected, smart objects continuously generate data and transmit it over the Internet. Much of the IoT initiatives are geared towards manufacturing low-cost and energy-efficient hardware for these objects, as well as the communication technologies that provide objects interconnectivity. However, the solutions to manage and utilize the massive volume of data produced by these objects are yet to mature. Traditional database management solutions fall short in satisfying the sophisticated application needs of an IoT network that has a truly global-scale. Current solutions for IoT data management address partial aspects of the IoT environment with special focus on sensor networks. In this paper, we survey the data management solutions that are proposed for IoT or subsystems of the IoT. We highlight the distinctive design primitives that we believe should be addressed in an IoT data management solution, and discuss how they are approached by the proposed solutions. We finally propose a data management framework for IoT that takes into consideration the discussed design elements and acts as a seed to a comprehensive IoT data management solution. The framework we propose adapts a federated, data- and sources-centric approach to link the diverse Things with their abundance of data to the potential applications and services that are envisioned for IoT.

Data Management for the Internet of Things: Design Primitives and Solution

PubMed Central

Abu-Elkheir, Mervat; Hayajneh, Mohammad; Ali, Najah Abu

2013-01-01

The Internet of Things (IoT) is a networking paradigm where interconnected, smart objects continuously generate data and transmit it over the Internet. Much of the IoT initiatives are geared towards manufacturing low-cost and energy-efficient hardware for these objects, as well as the communication technologies that provide objects interconnectivity. However, the solutions to manage and utilize the massive volume of data produced by these objects are yet to mature. Traditional database management solutions fall short in satisfying the sophisticated application needs of an IoT network that has a truly global-scale. Current solutions for IoT data management address partial aspects of the IoT environment with special focus on sensor networks. In this paper, we survey the data management solutions that are proposed for IoT or subsystems of the IoT. We highlight the distinctive design primitives that we believe should be addressed in an IoT data management solution, and discuss how they are approached by the proposed solutions. We finally propose a data management framework for IoT that takes into consideration the discussed design elements and acts as a seed to a comprehensive IoT data management solution. The framework we propose adapts a federated, data- and sources-centric approach to link the diverse Things with their abundance of data to the potential applications and services that are envisioned for IoT. PMID:24240599

"He Told Me to Check My Health": A Qualitative Exploration of Social Network Influence on Men's HIV Testing Behavior and HIV Self-Testing Willingness in Tanzania.

PubMed

Conserve, Donaldson F; Alemu, Dawit; Yamanis, Thespina; Maman, Suzanne; Kajula, Lusajo

2018-05-01

Men continue to test for HIV at a low rate in sub-Saharan Africa. Recent quantitative evidence from sub-Saharan Africa indicates that encouragement to test for HIV from men's network members is associated with higher previous HIV testing and HIV self-testing (HIVST) willingness. Leveraging this positive network influence to promote HIVST among men is a promising strategy that could increase HIV testing. This study investigated the reasons and strategies men used to encourage their peers to test for HIV and the outcomes in order to inform the development of a social network-based HIVST intervention for men called STEP (Self-Testing Education and Promotion). Twenty-three men from networks locally referred to as "camps" were interviewed to explore reasons for encouraging HIV testing, strategies to encourage HIV testing, and outcomes of HIV testing encouragement. Reasons men reported for encouraging their peers to test for HIV included awareness of their peers' risky sexual behavior, knowing an HIV-positive peer, and having HIV testing experience. Strategies for encouraging testing included engaging in formal and informal conversations and accompanying friends to the clinic. Encouragement outcomes included HIV testing for some men while others remained untested due to lack of privacy in the clinic and fear of HIV stigma. Willingness to self-test for HIV and an interest to educate peers about HIVST were other outcomes of HIV testing encouragement. These findings underscore the potential of leveraging men's existing HIV testing encouragement strategies to promote HIVST among their peers.

Troubling Consequences of Online Political Rumoring

ERIC Educational Resources Information Center

Garrett, R. Kelly

2011-01-01

Fear that the Internet promotes harmful political rumoring is merited but not for reasons originally anticipated. Although the network accelerates and widens rumor circulation, on the whole, it does not increase recipient credulity. E-mail, however, which fosters informal political communication within existing social networks, poses a unique…

Proceedings of the Second Joint Technology Workshop on Neural Networks and Fuzzy Logic, volume 1

NASA Technical Reports Server (NTRS)

Lea, Robert N. (Editor); Villarreal, James (Editor)

1991-01-01

Documented here are papers presented at the Neural Networks and Fuzzy Logic Workshop sponsored by NASA and the University of Houston, Clear Lake. The workshop was held April 11 to 13 at the Johnson Space Flight Center. Technical topics addressed included adaptive systems, learning algorithms, network architectures, vision, robotics, neurobiological connections, speech recognition and synthesis, fuzzy set theory and application, control and dynamics processing, space applications, fuzzy logic and neural network computers, approximate reasoning, and multiobject decision making.

Application of Fiber-Optical Techniques in the Access Transmission and Backbone Transport of Mobile Networks

NASA Astrophysics Data System (ADS)

Hilt, Attila; Pozsonyi, László

2012-09-01

Fixed access networks widely employ fiber-optical techniques due to the extremely wide bandwidth offered to subscribers. In the last decade, there has also been an enormous increase of user data visible in mobile systems. The importance of fiber-optical techniques within the fixed transmission/transport networks of mobile systems is therefore inevitably increasing. This article summarizes a few reasons and gives examples why and how fiber-optic techniques are employed efficiently in second-generation networks.

Learning In networks

NASA Technical Reports Server (NTRS)

Buntine, Wray L.

1995-01-01

Intelligent systems require software incorporating probabilistic reasoning, and often times learning. Networks provide a framework and methodology for creating this kind of software. This paper introduces network models based on chain graphs with deterministic nodes. Chain graphs are defined as a hierarchical combination of Bayesian and Markov networks. To model learning, plates on chain graphs are introduced to model independent samples. The paper concludes by discussing various operations that can be performed on chain graphs with plates as a simplification process or to generate learning algorithms.

A Modified LS+AR Model to Improve the Accuracy of the Short-term Polar Motion Prediction

NASA Astrophysics Data System (ADS)

Wang, Z. W.; Wang, Q. X.; Ding, Y. Q.; Zhang, J. J.; Liu, S. S.

2017-03-01

There are two problems of the LS (Least Squares)+AR (AutoRegressive) model in polar motion forecast: the inner residual value of LS fitting is reasonable, but the residual value of LS extrapolation is poor; and the LS fitting residual sequence is non-linear. It is unsuitable to establish an AR model for the residual sequence to be forecasted, based on the residual sequence before forecast epoch. In this paper, we make solution to those two problems with two steps. First, restrictions are added to the two endpoints of LS fitting data to fix them on the LS fitting curve. Therefore, the fitting values next to the two endpoints are very close to the observation values. Secondly, we select the interpolation residual sequence of an inward LS fitting curve, which has a similar variation trend as the LS extrapolation residual sequence, as the modeling object of AR for the residual forecast. Calculation examples show that this solution can effectively improve the short-term polar motion prediction accuracy by the LS+AR model. In addition, the comparison results of the forecast models of RLS (Robustified Least Squares)+AR, RLS+ARIMA (AutoRegressive Integrated Moving Average), and LS+ANN (Artificial Neural Network) confirm the feasibility and effectiveness of the solution for the polar motion forecast. The results, especially for the polar motion forecast in the 1-10 days, show that the forecast accuracy of the proposed model can reach the world level.

Modelling Blended Solutions for Higher Education: Teaching, Learning, and Assessment in the Network and Mobile Technology Era

ERIC Educational Resources Information Center

Bocconi, Stefania; Trentin, Guglielmo

2014-01-01

The article addresses the role of network and mobile technologies in enhancing blended solutions with a view to (a) enriching the teaching/learning processes, (b) exploiting the opportunities it offers for their observability, and hence for their monitoring and formative/summative assessment. It will also discuss how such potential can only be…

Efficient algorithm for locating and sizing series compensation devices in large power transmission grids: II. Solutions and applications

DOE PAGES

Frolov, Vladimir; Backhaus, Scott; Chertkov, Misha

2014-10-01

In a companion manuscript, we developed a novel optimization method for placement, sizing, and operation of Flexible Alternating Current Transmission System (FACTS) devices to relieve transmission network congestion. Specifically, we addressed FACTS that provide Series Compensation (SC) via modification of line inductance. In this manuscript, this heuristic algorithm and its solutions are explored on a number of test cases: a 30-bus test network and a realistically-sized model of the Polish grid (~ 2700 nodes and ~ 3300 lines). The results on the 30-bus network are used to study the general properties of the solutions including non-locality and sparsity. The Polishmore » grid is used as a demonstration of the computational efficiency of the heuristics that leverages sequential linearization of power flow constraints and cutting plane methods that take advantage of the sparse nature of the SC placement solutions. Using these approaches, the algorithm is able to solve an instance of Polish grid in tens of seconds. We explore the utility of the algorithm by analyzing transmission networks congested by (a) uniform load growth, (b) multiple overloaded configurations, and (c) sequential generator retirements.« less

Frequency assignments for HFDF receivers in a search and rescue network

NASA Astrophysics Data System (ADS)

Johnson, Krista E.

1990-03-01

This thesis applies a multiobjective linear programming approach to the problem of assigning frequencies to high frequency direction finding (HFDF) receivers in a search-and-rescue network in order to maximize the expected number of geolocations of vessels in distress. The problem is formulated as a multiobjective integer linear programming problem. The integrality of the solutions is guaranteed by the totally unimodularity of the A-matrix. Two approaches are taken to solve the multiobjective linear programming problem: (1) the multiobjective simplex method as implemented in ADBASE; and (2) an iterative approach. In this approach, the individual objective functions are weighted and combined in a single additive objective function. The resulting single objective problem is expressed as a network programming problem and solved using SAS NETFLOW. The process is then repeated with different weightings for the objective functions. The solutions obtained from the multiobjective linear programs are evaluated using a FORTRAN program to determine which solution provides the greatest expected number of geolocations. This solution is then compared to the sample mean and standard deviation for the expected number of geolocations resulting from 10,000 random frequency assignments for the network.

Efficient Algorithm for Locating and Sizing Series Compensation Devices in Large Transmission Grids: Solutions and Applications (PART II)

DOE Office of Scientific and Technical Information (OSTI.GOV)

Frolov, Vladimir; Backhaus, Scott N.; Chertkov, Michael

2014-01-14

In a companion manuscript, we developed a novel optimization method for placement, sizing, and operation of Flexible Alternating Current Transmission System (FACTS) devices to relieve transmission network congestion. Specifically, we addressed FACTS that provide Series Compensation (SC) via modification of line inductance. In this manuscript, this heuristic algorithm and its solutions are explored on a number of test cases: a 30-bus test network and a realistically-sized model of the Polish grid (~2700 nodes and ~3300 lines). The results on the 30-bus network are used to study the general properties of the solutions including non-locality and sparsity. The Polish grid ismore » used as a demonstration of the computational efficiency of the heuristics that leverages sequential linearization of power flow constraints and cutting plane methods that take advantage of the sparse nature of the SC placement solutions. Using these approaches, the algorithm is able to solve an instance of Polish grid in tens of seconds. We explore the utility of the algorithm by analyzing transmission networks congested by (a) uniform load growth, (b) multiple overloaded configurations, and (c) sequential generator retirements« less

Harmony search optimization algorithm for a novel transportation problem in a consolidation network

NASA Astrophysics Data System (ADS)

Davod Hosseini, Seyed; Akbarpour Shirazi, Mohsen; Taghi Fatemi Ghomi, Seyed Mohammad

2014-11-01

This article presents a new harmony search optimization algorithm to solve a novel integer programming model developed for a consolidation network. In this network, a set of vehicles is used to transport goods from suppliers to their corresponding customers via two transportation systems: direct shipment and milk run logistics. The objective of this problem is to minimize the total shipping cost in the network, so it tries to reduce the number of required vehicles using an efficient vehicle routing strategy in the solution approach. Solving several numerical examples confirms that the proposed solution approach based on the harmony search algorithm performs much better than CPLEX in reducing both the shipping cost in the network and computational time requirement, especially for realistic size problem instances.

Solute diffusion in liquid metals

NASA Technical Reports Server (NTRS)

Bhat, B. N.

1973-01-01

A gas model of diffusion in liquid metals is presented. In this model, ions of liquid metals are assumed to behave like the molecules in a dense gas. Diffusion coefficient of solute is discussed with reference to its mass, ionic size, and pair potential. The model is applied to the case of solute diffusion in liquid silver. An attempt was made to predict diffusion coefficients of solutes with reasonable accuracy.

Generation of murine induced pluripotent stem cells by using high-density distributed electrodes network.

PubMed

Lu, Ming-Yu; Li, Zhihong; Hwang, Shiaw-Min; Linju Yen, B; Lee, Gwo-Bin

2015-09-01

This study reports a robust method of gene transfection in a murine primary cell model by using a high-density electrodes network (HDEN). By demonstrating high cell viability after gene transfection and successful expression of transgenes including fluorescent proteins, the HDEN device shows great promise as a solution in which reprogramming efficiency using non-viral induction for generation of murine induced pluripotent stem cells (iPSCs) is optimized. High and steady transgene expression levels in host cells of iPSCs can be demonstrated using this method. Moreover, the HDEN device achieved successful gene transfection with a low voltage of less than 180 V while requiring relatively low cell numbers (less than 1.5 × 10(4) cells). The results are comparable to current conventional methods, demonstrating a reasonable fluorescent-plasmid transfection rate (42.4% in single transfection and 24.5% in triple transfection) and high cell viability of over 95%. The gene expression levels of each iPSC factor was measured to be over 10-fold higher than that reported in previous studies using a single mouse embryonic fibroblast cell. Our results demonstrate that the generation of iPSCs using HDEN transfection of plasmid DNA may be a feasible and safe alternative to using viral transfection methods in the near future.

Neighboring and connectivity-aware routing in VANETs.

PubMed

Ghafoor, Huma; Koo, Insoo; Gohar, Nasir-ud-Din

2014-01-01

A novel position-based routing protocol anchor-based connectivity-aware routing (ACAR) for vehicular ad hoc networks (VANETs) is proposed in this paper to ensure connectivity of routes with more successfully delivered packets. Both buses and cars are considered as vehicular nodes running in both clockwise and anticlockwise directions in a city scenario. Both directions are taken into account for faster communication. ACAR is a hybrid protocol, using both the greedy forwarding approach and the store-carry-and-forward approach to minimize the packet drop rate on the basis of certain assumptions. Our solution to situations that occur when the network is sparse and when any (source or intermediate) node has left its initial position makes this protocol different from those existing in the literature. We consider only vehicle-to-vehicle (V2V) communication in which both the source and destination nodes are moving vehicles. Also, no road-side units are considered. Finally, we compare our protocol with A-STAR (a plausible connectivity-aware routing protocol for city environments), and simulation results in NS-2 show improvement in the number of packets delivered to the destination using fewer hops. Also, we show that ACAR has more successfully-delivered long-distance packets with reasonable packet delay than A-STAR.

Inverter Circuits Using ZnO Nanoparticle Based Thin-Film Transistors for Flexible Electronic Applications

PubMed Central

Vidor, Fábio F.; Meyers, Thorsten; Hilleringmann, Ulrich

2016-01-01

Innovative systems exploring the flexibility and the transparency of modern semiconducting materials are being widely researched by the scientific community and by several companies. For a low-cost production and large surface area applications, thin-film transistors (TFTs) are the key elements driving the system currents. In order to maintain a cost efficient integration process, solution based materials are used as they show an outstanding tradeoff between cost and system complexity. In this paper, we discuss the integration process of ZnO nanoparticle TFTs using a high-k resin as gate dielectric. The performance in dependence on the transistor structure has been investigated, and inverted staggered setups depict an improved performance over the coplanar device increasing both the field-effect mobility and the ION/IOFF ratio. Aiming at the evaluation of the TFT characteristics for digital circuit applications, inverter circuits using a load TFT in the pull-up network and an active TFT in the pull-down network were integrated. The inverters show reasonable switching characteristics and V/V gains. Conjointly, the influence of the geometry ratio and the supply voltage on the devices have been analyzed. Moreover, as all integration steps are suitable to polymeric templates, the fabrication process is fully compatible to flexible substrates. PMID:28335282

Inverter Circuits Using ZnO Nanoparticle Based Thin-Film Transistors for Flexible Electronic Applications.

PubMed

Vidor, Fábio F; Meyers, Thorsten; Hilleringmann, Ulrich

2016-08-23

Innovative systems exploring the flexibility and the transparency of modern semiconducting materials are being widely researched by the scientific community and by several companies. For a low-cost production and large surface area applications, thin-film transistors (TFTs) are the key elements driving the system currents. In order to maintain a cost efficient integration process, solution based materials are used as they show an outstanding tradeoff between cost and system complexity. In this paper, we discuss the integration process of ZnO nanoparticle TFTs using a high- k resin as gate dielectric. The performance in dependence on the transistor structure has been investigated, and inverted staggered setups depict an improved performance over the coplanar device increasing both the field-effect mobility and the I ON / I OFF ratio. Aiming at the evaluation of the TFT characteristics for digital circuit applications, inverter circuits using a load TFT in the pull-up network and an active TFT in the pull-down network were integrated. The inverters show reasonable switching characteristics and V / V gains. Conjointly, the influence of the geometry ratio and the supply voltage on the devices have been analyzed. Moreover, as all integration steps are suitable to polymeric templates, the fabrication process is fully compatible to flexible substrates.

Standby battery requirements for telecommunications power

NASA Astrophysics Data System (ADS)

May, G. J.

The requirements for standby power for telecommunications are changing as the network moves from conventional systems to Internet Protocol (IP) telephony. These new systems require higher power levels closer to the user but the level of availability and reliability cannot be compromised if the network is to provide service in the event of a failure of the public utility. Many parts of these new networks are ac rather than dc powered with UPS systems for back-up power. These generally have lower levels of reliability than dc systems and the network needs to be designed such that overall reliability is not reduced through appropriate levels of redundancy. Mobile networks have different power requirements. Where there is a high density of nodes, continuity of service can be reasonably assured with short autonomy times. Furthermore, there is generally no requirement that these networks are the provider of last resort and therefore, specifications for continuity of power are directed towards revenue protection and overall reliability targets. As a result of these changes, battery requirements for reserve power are evolving. Shorter autonomy times are specified for parts of the network although a large part will continue to need support for hours rather minutes. Operational temperatures are increasing and battery solutions that provide longer life in extreme conditions are becoming important. Different battery technologies will be discussed in the context of these requirements. Conventional large flooded lead/acid cells both with pasted and tubular plates are used in larger central office applications but the majority of requirements are met with valve-regulated lead/acid (VRLA) batteries. The different types of VRLA battery will be described and their suitability for various applications outlined. New developments in battery construction and battery materials have improved both performance and reliability in recent years. Alternative technologies are also being proposed for telecommunications power, either different battery chemistries including lithium batteries, flywheel energy storage or the use of fuel cells. These will be evaluated and the position of lead/acid batteries in the medium term for this important market will be assessed.

Diffusion in random networks: Asymptotic properties, and numerical and engineering approximations

NASA Astrophysics Data System (ADS)

Padrino, Juan C.; Zhang, Duan Z.

2016-11-01

The ensemble phase averaging technique is applied to model mass transport by diffusion in random networks. The system consists of an ensemble of random networks, where each network is made of a set of pockets connected by tortuous channels. Inside a channel, we assume that fluid transport is governed by the one-dimensional diffusion equation. Mass balance leads to an integro-differential equation for the pores mass density. The so-called dual porosity model is found to be equivalent to the leading order approximation of the integration kernel when the diffusion time scale inside the channels is small compared to the macroscopic time scale. As a test problem, we consider the one-dimensional mass diffusion in a semi-infinite domain, whose solution is sought numerically. Because of the required time to establish the linear concentration profile inside a channel, for early times the similarity variable is xt- 1 / 4 rather than xt- 1 / 2 as in the traditional theory. This early time sub-diffusive similarity can be explained by random walk theory through the network. In addition, by applying concepts of fractional calculus, we show that, for small time, the governing equation reduces to a fractional diffusion equation with known solution. We recast this solution in terms of special functions easier to compute. Comparison of the numerical and exact solutions shows excellent agreement.

Engine With Regression and Neural Network Approximators Designed

NASA Technical Reports Server (NTRS)

Patnaik, Surya N.; Hopkins, Dale A.

2001-01-01

At the NASA Glenn Research Center, the NASA engine performance program (NEPP, ref. 1) and the design optimization testbed COMETBOARDS (ref. 2) with regression and neural network analysis-approximators have been coupled to obtain a preliminary engine design methodology. The solution to a high-bypass-ratio subsonic waverotor-topped turbofan engine, which is shown in the preceding figure, was obtained by the simulation depicted in the following figure. This engine is made of 16 components mounted on two shafts with 21 flow stations. The engine is designed for a flight envelope with 47 operating points. The design optimization utilized both neural network and regression approximations, along with the cascade strategy (ref. 3). The cascade used three algorithms in sequence: the method of feasible directions, the sequence of unconstrained minimizations technique, and sequential quadratic programming. The normalized optimum thrusts obtained by the three methods are shown in the following figure: the cascade algorithm with regression approximation is represented by a triangle, a circle is shown for the neural network solution, and a solid line indicates original NEPP results. The solutions obtained from both approximate methods lie within one standard deviation of the benchmark solution for each operating point. The simulation improved the maximum thrust by 5 percent. The performance of the linear regression and neural network methods as alternate engine analyzers was found to be satisfactory for the analysis and operation optimization of air-breathing propulsion engines (ref. 4).

Using dual-process theory and analogical transfer to explain facilitation on a hypothetico-deductive reasoning task.

PubMed

Koenig, Cynthia S; Platt, Richard D; Griggs, Richard A

2007-07-01

Using the analogical transfer paradigm, the present study investigated the competing explanations of Girotto and Legrenzi (Psychological Research 51: 129-135, 1993) and Griggs, Platt, Newstead, and Jackson (Thinking and Reasoning 4: 1-14, 1998) for facilitation on the SARS version of the THOG problem, a hypothetico-deductive reasoning task. Girotto and Legrenzi argue that facilitation is based on logical analysis of the task [System 2 reasoning in Evans's (Trends in Cognitive Sciences 7: 454-459, 2003) dual-process account of reasoning] while Griggs et al. maintain that facilitation is due to an attentional heuristic produced by the wording of the problem (System 1 reasoning). If Girotto and Legrenzi are correct, then System 2 reasoning, which is volitional and responsible for deductive reasoning, should be elicited, and participants should comprehend the solution principle of the THOG task and exhibit analogical transfer. However, if Griggs et al. are correct, then System 1 reasoning, which is responsible for heuristic problem solving strategies such as an attentional heuristic, should occur, and participants should not abstract the solution principle and transfer should not occur. Significant facilitation (68 and 82% correct) was only observed for the two SARS source problems, but significant analogical transfer did not occur. This lack of transfer suggests that System 1 reasoning was responsible for the facilitation observed in the SARS problem, supporting Griggs et al.'s attentional heuristic explanation. The present results also underscore the explanatory value of using analogical transfer rather than facilitation as the criterion for problem understanding.

Exact solutions for network rewiring models

NASA Astrophysics Data System (ADS)

Evans, T. S.

2007-03-01

Evolving networks with a constant number of edges may be modelled using a rewiring process. These models are used to describe many real-world processes including the evolution of cultural artifacts such as family names, the evolution of gene variations, and the popularity of strategies in simple econophysics models such as the minority game. The model is closely related to Urn models used for glasses, quantum gravity and wealth distributions. The full mean field equation for the degree distribution is found and its exact solution and generating solution are given.

Coexistence of 3G repeaters with LTE base stations.

PubMed

Yeo, Woon-Young; Lee, Sang-Min; Hwang, Gyung-Ho; Kim, Jae-Hoon

2013-01-01

Repeaters have been an attractive solution for mobile operators to upgrade their wireless networks at low cost and to extend network coverage effectively. Since the first LTE commercial deployment in 2009, many mobile operators have launched LTE networks by upgrading their 3G and legacy networks. Because all 3G frequency bands are shared with the frequency bands for LTE deployment and 3G mobile operators have an enormous number of repeaters, reusing 3G repeaters in LTE networks is definitely a practical and cost-efficient solution. However, 3G repeaters usually do not support spatial multiplexing with multiple antennas, and thus it is difficult to reuse them directly in LTE networks. In order to support spatial multiplexing of LTE, the role of 3G repeaters should be replaced with small LTE base stations or MIMO-capable repeaters. In this paper, a repeater network is proposed to reuse 3G repeaters in LTE deployment while still supporting multilayer transmission of LTE. Interestingly, the proposed network has a higher cluster throughput than an LTE network with MIMO-capable repeaters.

Coexistence of 3G Repeaters with LTE Base Stations

PubMed Central

Yeo, Woon-Young

2013-01-01

Repeaters have been an attractive solution for mobile operators to upgrade their wireless networks at low cost and to extend network coverage effectively. Since the first LTE commercial deployment in 2009, many mobile operators have launched LTE networks by upgrading their 3G and legacy networks. Because all 3G frequency bands are shared with the frequency bands for LTE deployment and 3G mobile operators have an enormous number of repeaters, reusing 3G repeaters in LTE networks is definitely a practical and cost-efficient solution. However, 3G repeaters usually do not support spatial multiplexing with multiple antennas, and thus it is difficult to reuse them directly in LTE networks. In order to support spatial multiplexing of LTE, the role of 3G repeaters should be replaced with small LTE base stations or MIMO-capable repeaters. In this paper, a repeater network is proposed to reuse 3G repeaters in LTE deployment while still supporting multilayer transmission of LTE. Interestingly, the proposed network has a higher cluster throughput than an LTE network with MIMO-capable repeaters. PMID:24459420

Analytical Studies on the Synchronization of a Network of Linearly-Coupled Simple Chaotic Systems

NASA Astrophysics Data System (ADS)

Sivaganesh, G.; Arulgnanam, A.; Seethalakshmi, A. N.; Selvaraj, S.

2018-05-01

We present explicit generalized analytical solutions for a network of linearly-coupled simple chaotic systems. Analytical solutions are obtained for the normalized state equations of a network of linearly-coupled systems driven by a common chaotic drive system. Two parameter bifurcation diagrams revealing the various hidden synchronization regions, such as complete, phase and phase-lag synchronization are identified using the analytical results. The synchronization dynamics and their stability are studied using phase portraits and the master stability function, respectively. Further, experimental results for linearly-coupled simple chaotic systems are presented to confirm the analytical results. The synchronization dynamics of a network of chaotic systems studied analytically is reported for the first time.

Spacewire router IP-core with priority adaptive routing

NASA Astrophysics Data System (ADS)

Shakhmatov, A. V.; Chekmarev, S. A.; Vergasov, M. Y.; Khanov, V. Kh

2015-10-01

Design of modern spacecraft focuses on using network principles of interaction on-board equipment, in particular in network SpaceWire. Routers are an integral part of most SpaceWire networks. The paper presents an adaptive routing algorithm with a prioritization, allowing more flexibility to manage the routing process. This algorithm is designed to transmit SpaceWire packets over a redundant network. Also a method is proposed for rapid restoration of working capacity after power by saving the routing table and the router configuration in an external non-volatile memory. The proposed solutions used to create IP-core router, and then tested in the FPGA device. The results illustrate the realizability and rationality of the proposed solutions.

Dual-mode ultraflow access networks: a hybrid solution for the access bottleneck

NASA Astrophysics Data System (ADS)

Kazovsky, Leonid G.; Shen, Thomas Shunrong; Dhaini, Ahmad R.; Yin, Shuang; De Leenheer, Marc; Detwiler, Benjamin A.

2013-12-01

Optical Flow Switching (OFS) is a promising solution for large Internet data transfers. In this paper, we introduce UltraFlow Access, a novel optical access network architecture that offers dual-mode service to its end-users: IP and OFS. With UltraFlow Access, we design and implement a new dual-mode control plane and a new dual-mode network stack to ensure efficient connection setup and reliable and optimal data transmission. We study the impact of the UltraFlow system's design on the network throughput. Our experimental results show that with an optimized system design, near optimal (around 10 Gb/s) OFS data throughput can be attained when the line rate is 10Gb/s.

Tests of peak flow scaling in simulated self-similar river networks

USGS Publications Warehouse

Menabde, M.; Veitzer, S.; Gupta, V.; Sivapalan, M.

2001-01-01

The effect of linear flow routing incorporating attenuation and network topology on peak flow scaling exponent is investigated for an instantaneously applied uniform runoff on simulated deterministic and random self-similar channel networks. The flow routing is modelled by a linear mass conservation equation for a discrete set of channel links connected in parallel and series, and having the same topology as the channel network. A quasi-analytical solution for the unit hydrograph is obtained in terms of recursion relations. The analysis of this solution shows that the peak flow has an asymptotically scaling dependence on the drainage area for deterministic Mandelbrot-Vicsek (MV) and Peano networks, as well as for a subclass of random self-similar channel networks. However, the scaling exponent is shown to be different from that predicted by the scaling properties of the maxima of the width functions. ?? 2001 Elsevier Science Ltd. All rights reserved.

Experimental and modeling study of Newtonian and non-Newtonian fluid flow in pore network micromodels.

PubMed

Perrin, Christian L; Tardy, Philippe M J; Sorbie, Ken S; Crawshaw, John C

2006-03-15

The in situ rheology of polymeric solutions has been studied experimentally in etched silicon micromodels which are idealizations of porous media. The rectangular channels in these etched networks have dimensions typical of pore sizes in sandstone rocks. Pressure drop/flow rate relations have been measured for water and non-Newtonian hydrolyzed-polyacrylamide (HPAM) solutions in both individual straight rectangular capillaries and in networks of such capillaries. Results from these experiments have been analyzed using pore-scale network modeling incorporating the non-Newtonian fluid mechanics of a Carreau fluid. Quantitative agreement is seen between the experiments and the network calculations in the Newtonian and shear-thinning flow regions demonstrating that the 'shift factor,'alpha, can be calculated a priori. Shear-thickening behavior was observed at higher flow rates in the micromodel experiments as a result of elastic effects becoming important and this remains to be incorporated in the network model.

Global asymptotical ω-periodicity of a fractional-order non-autonomous neural networks.

PubMed

Chen, Boshan; Chen, Jiejie

2015-08-01

We study the global asymptotic ω-periodicity for a fractional-order non-autonomous neural networks. Firstly, based on the Caputo fractional-order derivative it is shown that ω-periodic or autonomous fractional-order neural networks cannot generate exactly ω-periodic signals. Next, by using the contraction mapping principle we discuss the existence and uniqueness of S-asymptotically ω-periodic solution for a class of fractional-order non-autonomous neural networks. Then by using a fractional-order differential and integral inequality technique, we study global Mittag-Leffler stability and global asymptotical periodicity of the fractional-order non-autonomous neural networks, which shows that all paths of the networks, starting from arbitrary points and responding to persistent, nonconstant ω-periodic external inputs, asymptotically converge to the same nonconstant ω-periodic function that may be not a solution. Copyright © 2015 Elsevier Ltd. All rights reserved.

A One-Layer Recurrent Neural Network for Real-Time Portfolio Optimization With Probability Criterion.

PubMed

Liu, Qingshan; Dang, Chuangyin; Huang, Tingwen

2013-02-01

This paper presents a decision-making model described by a recurrent neural network for dynamic portfolio optimization. The portfolio-optimization problem is first converted into a constrained fractional programming problem. Since the objective function in the programming problem is not convex, the traditional optimization techniques are no longer applicable for solving this problem. Fortunately, the objective function in the fractional programming is pseudoconvex on the feasible region. It leads to a one-layer recurrent neural network modeled by means of a discontinuous dynamic system. To ensure the optimal solutions for portfolio optimization, the convergence of the proposed neural network is analyzed and proved. In fact, the neural network guarantees to get the optimal solutions for portfolio-investment advice if some mild conditions are satisfied. A numerical example with simulation results substantiates the effectiveness and illustrates the characteristics of the proposed neural network.

SIRGAS: ITRF densification in Latin America and the Caribbean

NASA Astrophysics Data System (ADS)

Brunini, C.; Costa, S.; Mackern, V.; Martínez, W.; Sánchez, L.; Seemüller, W.; da Silva, A.

2009-04-01

The continental reference frame of SIRGAS (Sistema de Referencia Geocéntrico para las Américas) is at present realized by the SIRGAS Continuously Operating Network (SIRGAS-CON) composed by about 200 stations distributed over all Latin America and the Caribbean. SIRGAS member countries are qualifying their national reference frames by installing continuously operating GNSS stations, which have to be consistently integrated into the continental network. As the number of these stations is rapidly increasing, the processing strategy of the SIRGAS-CON network was redefined during the SIRGAS 2008 General Meeting in May 2008. The new strategy relies upon the definition of two hierarchy levels: a) A core network (SIRGAS-CON-C) with homogeneous continental coverage and stabile site locations ensures the long-term stability of the reference frame and provides the primary link to the ITRS. Stations belonging to this network have been selected so that each country contributes with a number of stations defined according to its surface and guarantying that the selected stations are the best in operability, continuity, reliability, and geographical coverage. b) Several densification sub-networks (SIRGAS-CON-D) improve the accessibility to the reference frame. The SIRGAS-CON-D sub-networks shall correspond to the national reference frames, i.e., as an optimum there shall be as many sub-networks as countries in the region. The goal is that each country processes its own continuously stations following the SIRGAS processing guidelines, which are defined in accordance with the IERS and IGS standards and conventions. Since at present not all of the countries are operating a processing centre, the existing stations are classified in three densification networks (a Northern, a middle, and a Southern one), which are processed by three local processing centres until new ones are installed. As SIRGAS is defined as a densification of the ITRS, stations included in the core network, as well as in the densification sub-networks match the requirements, characteristics, and processing performance of the ITRF. The SIRGAS-CON-C network is processed by DGFI (Deutsches Geodätisches Forschungsinstitut, Germany) as the IGS-RNAAC-SIR. The Local Processing Centres are for the Northern sub-network IGAC (Instituto Geográfico Augustín Codazzi, Colombia), for the middle sub-network IBGE (Instituto Brasileiro de Geografia e Estátistica, Brazil), and for the Southern sub-network IGG-CIMA (Instituto de Geodesia y Geodinámica, Universidad Nacional de Cuyo, Argentina). These four Processing Centres deliver loosely constrained weekly solutions for station coordinates (i.e., satellite orbits, satellite clock offsets, and Earth orientation parameters are fixed to the final weekly IGS solutions and coordinates for all sites are constrained to 1 m). The individual contributions are integrated in a unified solution by the SIRGAS Combination Centres (DGFI and IBGE) according to the following strategy: 1) Individual solutions are reviewed/corrected for possible format problems, data inconsistencies, etc. 2) Constraints imposed in the delivered normal equations are removed. 3) Sub-networks are individually aligned to the IGS05 reference frame by applying the No Net Rotation (NNR) and No Net Translation (NNT) conditions. 4) Coordinates obtained in (3) for each sub-network are compared to IGS05 values and to each other in order to identify possible outliers. 5) Stations with large residuals (more than 10 mm in the N-E component, and more than 20 mm in the Up component) are reduced from the normal equations. Steps (3), (4), and (5) are done iteratively. 6) Since at present the four Analysis Centres are processing GPS observations only and all of them use the Bernese Software for computing weekly solutions, relative weighting factors are not applied in the combination. 7) Individual normal equations are accumulated and solved for computing a loosely constrained weekly solution for station coordinates (i.e., coordinates for all stations are constrained to 1 m). This solution in SINEX format is submitted to IGS for the global polyhedron. 8) Combination obtained in (7) is constrained by applying NNR+NNT conditions with respect to the IGS05 stations included the SIRGAS region to provide constrained coordinates for all SIRGAS-CON (core + densification) stations. The applied IGS05 reference coordinates correspond to the weekly IGS solution for the global network, i.e., coordinates included in the igsYYPwwww.snx files. This constrained solution provides the final weekly SIRGAS-CON coordinates for practical applications. The DGFI (i.e. IGS RNAAC SIR) weekly combinations are delivered to the IGS Data Centres for combination in the global polyhedron, and made available for users as official SIRGAS products, respectively. The IBGE weekly combinations provide control and back-up. The above described analysis strategy is applied since GPS week 1495. Before (since June 1996 to August 2008), the SIRGAS-CON network was totally processed by DGFI. Until now, results show a very good agreement with previous computations; however, the present sub-networks distribution has two main disadvantages: 1) Not all SIRGAS-CON stations are included in the same number of individual solutions, i.e., they are unequally weighted in the weekly combinations, and 2) since there are not enough Local Processing Centres, the required redundancy (each station processed by at least three processing centres) is not fulfilled. Therefore, efforts are being made to install additional Local Processing Centres in Latin American countries as Argentina, Ecuador, Mexico, Peru, Uruguay, and Venezuela.

Urban Water Innovation Network (UWIN): Transitioning Toward Sustainbale Urban Water Systems

NASA Astrophysics Data System (ADS)

Arabi, M.

2015-12-01

City water systems are at risk of disruption from global social and environmental hazards, which could have deleterious effects on human health, property, and loss of critical infrastructure. The Urban Water Innovation Network (UWIN), a consortium of 14 academic institutions and other key partners across the U.S., is working to address challenges that threaten urban water systems across the nation. UWIN's mission is to create technological, institutional and management solutions to help communities increase the resilience of their water systems and enhance their preparedness for responding to water crisis. The network seeks solutions that achieve widespread adoption consistent with inclusive, equitable and sustainable urban development. The integrative and adaptive analysis framework of UWIN is presented. The framework identifies a toolbox of sustainable solutions by simultaneously minimizing pressures, enhancing resilience to extreme events, and maximizing cobenefits. The benefits of sustainable urban water solutions for linked urban ecosystems, economies, and arrangements for environmental justice and social equity, will be discussed. The network encompasses six U.S. regions with varying ecohydrologic and climatic regimes ranging from the coastal moist mid-latitude climates of the Mid-Atlantic to the subtropical semi-arid deserts of the Southwest. These regions also represent a wide spectrum of demographic, cultural, and policy settings. The opportunities for cross-site assessments that facilitate the exploration of locally appropriate solutions across regions undergoing various development trajectories will be discussed.

Open solutions to distributed control in ground tracking stations

NASA Technical Reports Server (NTRS)

Heuser, William Randy

1994-01-01

The advent of high speed local area networks has made it possible to interconnect small, powerful computers to function together as a single large computer. Today, distributed computer systems are the new paradigm for large scale computing systems. However, the communications provided by the local area network is only one part of the solution. The services and protocols used by the application programs to communicate across the network are as indispensable as the local area network. And the selection of services and protocols that do not match the system requirements will limit the capabilities, performance, and expansion of the system. Proprietary solutions are available but are usually limited to a select set of equipment. However, there are two solutions based on 'open' standards. The question that must be answered is 'which one is the best one for my job?' This paper examines a model for tracking stations and their requirements for interprocessor communications in the next century. The model and requirements are matched with the model and services provided by the five different software architectures and supporting protocol solutions. Several key services are examined in detail to determine which services and protocols most closely match the requirements for the tracking station environment. The study reveals that the protocols are tailored to the problem domains for which they were originally designed. Further, the study reveals that the process control model is the closest match to the tracking station model.

Implementation of Finite Volume based Navier Stokes Algorithm Within General Purpose Flow Network Code

NASA Technical Reports Server (NTRS)

Schallhorn, Paul; Majumdar, Alok

2012-01-01

This paper describes a finite volume based numerical algorithm that allows multi-dimensional computation of fluid flow within a system level network flow analysis. There are several thermo-fluid engineering problems where higher fidelity solutions are needed that are not within the capacity of system level codes. The proposed algorithm will allow NASA's Generalized Fluid System Simulation Program (GFSSP) to perform multi-dimensional flow calculation within the framework of GFSSP s typical system level flow network consisting of fluid nodes and branches. The paper presents several classical two-dimensional fluid dynamics problems that have been solved by GFSSP's multi-dimensional flow solver. The numerical solutions are compared with the analytical and benchmark solution of Poiseulle, Couette and flow in a driven cavity.

Secure NFV Orchestration Over an SDN-Controlled Optical Network With Time-Shared Quantum Key Distribution Resources

NASA Astrophysics Data System (ADS)

Aguado, Alejandro; Hugues-Salas, Emilio; Haigh, Paul Anthony; Marhuenda, Jaume; Price, Alasdair B.; Sibson, Philip; Kennard, Jake E.; Erven, Chris; Rarity, John G.; Thompson, Mark Gerard; Lord, Andrew; Nejabati, Reza; Simeonidou, Dimitra

2017-04-01

We demonstrate, for the first time, a secure optical network architecture that combines NFV orchestration and SDN control with quantum key distribution (QKD) technology. A novel time-shared QKD network design is presented as a cost-effective solution for practical networks.

Security Aspects of an Enterprise-Wide Network Architecture.

ERIC Educational Resources Information Center

Loew, Robert; Stengel, Ingo; Bleimann, Udo; McDonald, Aidan

1999-01-01

Presents an overview of two projects that concern local area networks and the common point between networks as they relate to network security. Discusses security architectures based on firewall components, packet filters, application gateways, security-management components, an intranet solution, user registration by Web form, and requests for…

Deep space network energy program

NASA Technical Reports Server (NTRS)

Friesema, S. E.

1980-01-01

If the Deep Space Network is to exist in a cost effective and reliable manner in the next decade, the problems presented by international energy cost increases and energy availability must be addressed. The Deep Space Network Energy Program was established to implement solutions compatible with the ongoing development of the total network.

Markov logic network based complex event detection under uncertainty

NASA Astrophysics Data System (ADS)

Lu, Jingyang; Jia, Bin; Chen, Genshe; Chen, Hua-mei; Sullivan, Nichole; Pham, Khanh; Blasch, Erik

2018-05-01

In a cognitive reasoning system, the four-stage Observe-Orient-Decision-Act (OODA) reasoning loop is of interest. The OODA loop is essential for the situational awareness especially in heterogeneous data fusion. Cognitive reasoning for making decisions can take advantage of different formats of information such as symbolic observations, various real-world sensor readings, or the relationship between intelligent modalities. Markov Logic Network (MLN) provides mathematically sound technique in presenting and fusing data at multiple levels of abstraction, and across multiple intelligent sensors to conduct complex decision-making tasks. In this paper, a scenario about vehicle interaction is investigated, in which uncertainty is taken into consideration as no systematic approaches can perfectly characterize the complex event scenario. MLNs are applied to the terrestrial domain where the dynamic features and relationships among vehicles are captured through multiple sensors and information sources regarding the data uncertainty.

A Wireless Sensor Network-Based Approach with Decision Support for Monitoring Lake Water Quality.

PubMed

Huang, Xiaoci; Yi, Jianjun; Chen, Shaoli; Zhu, Xiaomin

2015-11-19

Online monitoring and water quality analysis of lakes are urgently needed. A feasible and effective approach is to use a Wireless Sensor Network (WSN). Lake water environments, like other real world environments, present many changing and unpredictable situations. To ensure flexibility in such an environment, the WSN node has to be prepared to deal with varying situations. This paper presents a WSN self-configuration approach for lake water quality monitoring. The approach is based on the integration of a semantic framework, where a reasoner can make decisions on the configuration of WSN services. We present a WSN ontology and the relevant water quality monitoring context information, which considers its suitability in a pervasive computing environment. We also propose a rule-based reasoning engine that is used to conduct decision support through reasoning techniques and context-awareness. To evaluate the approach, we conduct usability experiments and performance benchmarks.

Helping Young Children to Develop Character.

ERIC Educational Resources Information Center

Crosser, Sandra

1997-01-01

Argues that, of the authoritarian, permissive, and authoritative styles of interaction with children, the latter nurtures the emergence of positive character traits in young children. Suggests listening, setting high and reasonable standards, explaining why, negotiating reasonable solutions, offering choices, and valuing ideas and opinions as…

Quantitative Reasoning in Problem Solving

ERIC Educational Resources Information Center

Ramful, Ajay; Ho, Siew Yin

2015-01-01

In this article, Ajay Ramful and Siew Yin Ho explain the meaning of quantitative reasoning, describing how it is used in the to solve mathematical problems. They also describe a diagrammatic approach to represent relationships among quantities and provide examples of problems and their solutions.

Mobility management techniques for the next-generation wireless networks

NASA Astrophysics Data System (ADS)

Sun, Junzhao; Howie, Douglas P.; Sauvola, Jaakko J.

2001-10-01

The tremendous demands from social market are pushing the booming development of mobile communications faster than ever before, leading to plenty of new advanced techniques emerging. With the converging of mobile and wireless communications with Internet services, the boundary between mobile personal telecommunications and wireless computer networks is disappearing. Wireless networks of the next generation need the support of all the advances on new architectures, standards, and protocols. Mobility management is an important issue in the area of mobile communications, which can be best solved at the network layer. One of the key features of the next generation wireless networks is all-IP infrastructure. This paper discusses the mobility management schemes for the next generation mobile networks through extending IP's functions with mobility support. A global hierarchical framework model for the mobility management of wireless networks is presented, in which the mobility management is divided into two complementary tasks: macro mobility and micro mobility. As the macro mobility solution, a basic principle of Mobile IP is introduced, together with the optimal schemes and the advances in IPv6. The disadvantages of the Mobile IP on solving the micro mobility problem are analyzed, on the basis of which three main proposals are discussed as the micro mobility solutions for mobile communications, including Hierarchical Mobile IP (HMIP), Cellular IP, and Handoff-Aware Wireless Access Internet Infrastructure (HAWAII). A unified model is also described in which the different micro mobility solutions can coexist simultaneously in mobile networks.

A federated information management system for the Deep Space Network. M.S. Thesis - Univ. of Southern California

NASA Technical Reports Server (NTRS)

Dobinson, E.

1982-01-01

General requirements for an information management system for the deep space network (DSN) are examined. A concise review of available database management system technology is presented. It is recommended that a federation of logically decentralized databases be implemented for the Network Information Management System of the DSN. Overall characteristics of the federation are specified, as well as reasons for adopting this approach.

A task-invariant cognitive reserve network.

PubMed

Stern, Yaakov; Gazes, Yunglin; Razlighi, Qolomreza; Steffener, Jason; Habeck, Christian

2018-05-14

The concept of cognitive reserve (CR) can explain individual differences in susceptibility to cognitive or functional impairment in the presence of age or disease-related brain changes. Epidemiologic evidence indicates that CR helps maintain performance in the face of pathology across multiple cognitive domains. We therefore tried to identify a single, "task-invariant" CR network that is active during the performance of many disparate tasks. In imaging data acquired from 255 individuals age 20-80 while performing 12 different cognitive tasks, we used an iterative approach to derive a multivariate network that was expressed during the performance of all tasks, and whose degree of expression correlated with IQ, a proxy for CR. When applied to held out data or forward applied to fMRI data from an entirely different activation task, network expression correlated with IQ. Expression of the CR pattern accounted for additional variance in fluid reasoning performance over and above the influence of cortical thickness, and also moderated between cortical thickness and reasoning performance, consistent with the behavior of a CR network. The identification of a task-invariant CR network supports the idea that life experiences may result in brain processing differences that might provide reserve against age- or disease-related changes across multiple tasks. Copyright © 2018. Published by Elsevier Inc.

Information processing in echo state networks at the edge of chaos.

PubMed

Boedecker, Joschka; Obst, Oliver; Lizier, Joseph T; Mayer, N Michael; Asada, Minoru

2012-09-01

We investigate information processing in randomly connected recurrent neural networks. It has been shown previously that the computational capabilities of these networks are maximized when the recurrent layer is close to the border between a stable and an unstable dynamics regime, the so called edge of chaos. The reasons, however, for this maximized performance are not completely understood. We adopt an information-theoretical framework and are for the first time able to quantify the computational capabilities between elements of these networks directly as they undergo the phase transition to chaos. Specifically, we present evidence that both information transfer and storage in the recurrent layer are maximized close to this phase transition, providing an explanation for why guiding the recurrent layer toward the edge of chaos is computationally useful. As a consequence, our study suggests self-organized ways of improving performance in recurrent neural networks, driven by input data. Moreover, the networks we study share important features with biological systems such as feedback connections and online computation on input streams. A key example is the cerebral cortex, which was shown to also operate close to the edge of chaos. Consequently, the behavior of model systems as studied here is likely to shed light on reasons why biological systems are tuned into this specific regime.

Personal and Impersonal Stimuli Differentially Engage Brain Networks during Moral Reasoning

ERIC Educational Resources Information Center

Xue, Shao-Wei; Wang, Yan; Tang, Yi-Yuan

2013-01-01

Moral decision making has recently attracted considerable attention as a core feature of all human endeavors. Previous functional magnetic resonance imaging studies about moral judgment have identified brain areas associated with cognitive or emotional engagement. Here, we applied graph theory-based network analysis of event-related potentials…

Causal Networks or Causal Islands? The Representation of Mechanisms and the Transitivity of Causal Judgment

ERIC Educational Resources Information Center

Johnson, Samuel G. B.; Ahn, Woo-kyoung

2015-01-01

Knowledge of mechanisms is critical for causal reasoning. We contrasted two possible organizations of causal knowledge--an interconnected causal "network," where events are causally connected without any boundaries delineating discrete mechanisms; or a set of disparate mechanisms--causal "islands"--such that events in different…

47 CFR 64.4002 - Notification obligations of LECs.

Code of Federal Regulations, 2012 CFR

2012-10-01

... and processing a PIC selection submitted by a customer and placing the customer on the network of the...-submitted PIC order (i.e., mirror image of the original order), unless otherwise specified by this paragraph... request (i.e., the mirror image of the original request), along with the specific reason(s) why the...

47 CFR 64.4002 - Notification obligations of LECs.

Code of Federal Regulations, 2013 CFR

2013-10-01

... and processing a PIC selection submitted by a customer and placing the customer on the network of the...-submitted PIC order (i.e., mirror image of the original order), unless otherwise specified by this paragraph... request (i.e., the mirror image of the original request), along with the specific reason(s) why the...

47 CFR 64.4002 - Notification obligations of LECs.

Code of Federal Regulations, 2014 CFR

2014-10-01

... and processing a PIC selection submitted by a customer and placing the customer on the network of the...-submitted PIC order (i.e., mirror image of the original order), unless otherwise specified by this paragraph... request (i.e., the mirror image of the original request), along with the specific reason(s) why the...

47 CFR 64.4002 - Notification obligations of LECs.

Code of Federal Regulations, 2011 CFR

2011-10-01

... and processing a PIC selection submitted by a customer and placing the customer on the network of the...-submitted PIC order (i.e., mirror image of the original order), unless otherwise specified by this paragraph... request (i.e., the mirror image of the original request), along with the specific reason(s) why the...

Service-oriented Reasoning Architecture for Resource-Task Assignment in Sensor Networks

DTIC Science & Technology

2011-04-01

www.csd.abdn.ac.uk/research/ita/sam/downloads/ontology/ISTAR.owl Sensing Resource Platform Sensors SR4 Nimrod MR2 LDRFCamera, SARCamera, TVCamera SR5 WASP...resources in the theatre. This is because according to the knowledge available to the ISTAR reasoner service, a ‘ Nimrod ’ could perform high altitude

Synchronization properties of network motifs: Influence of coupling delay and symmetry

NASA Astrophysics Data System (ADS)

D'Huys, O.; Vicente, R.; Erneux, T.; Danckaert, J.; Fischer, I.

2008-09-01

We investigate the effect of coupling delays on the synchronization properties of several network motifs. In particular, we analyze the synchronization patterns of unidirectionally coupled rings, bidirectionally coupled rings, and open chains of Kuramoto oscillators. Our approach includes an analytical and semianalytical study of the existence and stability of different in-phase and out-of-phase periodic solutions, complemented by numerical simulations. The delay is found to act differently on networks possessing different symmetries. While for the unidirectionally coupled ring the coupling delay is mainly observed to induce multistability, its effect on bidirectionally coupled rings is to enhance the most symmetric solution. We also study the influence of feedback and conclude that it also promotes the in-phase solution of the coupled oscillators. We finally discuss the relation between our theoretical results on delay-coupled Kuramoto oscillators and the synchronization properties of networks consisting of real-world delay-coupled oscillators, such as semiconductor laser arrays and neuronal circuits.

State of the Art in LP-WAN Solutions for Industrial IoT Services

PubMed Central

Sanchez-Iborra, Ramon; Cano, Maria-Dolores

2016-01-01

The emergence of low-cost connected devices is enabling a new wave of sensorization services. These services can be highly leveraged in industrial applications. However, the technologies employed so far for managing this kind of system do not fully cover the strict requirements of industrial networks, especially those regarding energy efficiency. In this article a novel paradigm, called Low-Power Wide Area Networking (LP-WAN), is explored. By means of a cellular-type architecture, LP-WAN–based solutions aim at fulfilling the reliability and efficiency challenges posed by long-term industrial networks. Thus, the most prominent LP-WAN solutions are reviewed, identifying and discussing the pros and cons of each of them. The focus is also on examining the current deployment state of these platforms in Spain. Although LP-WAN systems are at early stages of development, they represent a promising alternative for boosting future industrial IIoT (Industrial Internet of Things) networks and services. PMID:27196909

State of the Art in LP-WAN Solutions for Industrial IoT Services.

PubMed

Sanchez-Iborra, Ramon; Cano, Maria-Dolores

2016-05-17

The emergence of low-cost connected devices is enabling a new wave of sensorization services. These services can be highly leveraged in industrial applications. However, the technologies employed so far for managing this kind of system do not fully cover the strict requirements of industrial networks, especially those regarding energy efficiency. In this article a novel paradigm, called Low-Power Wide Area Networking (LP-WAN), is explored. By means of a cellular-type architecture, LP-WAN-based solutions aim at fulfilling the reliability and efficiency challenges posed by long-term industrial networks. Thus, the most prominent LP-WAN solutions are reviewed, identifying and discussing the pros and cons of each of them. The focus is also on examining the current deployment state of these platforms in Spain. Although LP-WAN systems are at early stages of development, they represent a promising alternative for boosting future industrial IIoT (Industrial Internet of Things) networks and services.

WaterNet:The NASA Water Cycle Solutions Network

NASA Astrophysics Data System (ADS)

Belvedere, D. R.; Houser, P. R.; Pozzi, W.; Imam, B.; Schiffer, R.; Schlosser, C. A.; Gupta, H.; Martinez, G.; Lopez, V.; Vorosmarty, C.; Fekete, B.; Matthews, D.; Lawford, R.; Welty, C.; Seck, A.

2008-12-01

Water is essential to life and directly impacts and constrains society's welfare, progress, and sustainable growth, and is continuously being transformed by climate change, erosion, pollution, and engineering. Projections of the effects of such factors will remain speculative until more effective global prediction systems and applications are implemented. NASA's unique role is to use its view from space to improve water and energy cycle monitoring and prediction, and has taken steps to collaborate and improve interoperability with existing networks and nodes of research organizations, operational agencies, science communities, and private industry. WaterNet is a Solutions Network, devoted to the identification and recommendation of candidate solutions that propose ways in which water-cycle related NASA research results can be skillfully applied by partner agencies, international organizations, state, and local governments. It is designed to improve and optimize the sustained ability of water cycle researchers, stakeholders, organizations and networks to interact, identify, harness, and extend NASA research results to augment Decision Support Tools that address national needs.

Circuity analyses of HSR network and high-speed train paths in China

PubMed Central

Zhao, Shuo; Huang, Jie; Shan, Xinghua

2017-01-01

Circuity, defined as the ratio of the shortest network distance to the Euclidean distance between one origin–destination (O-D) pair, can be adopted as a helpful evaluation method of indirect degrees of train paths. In this paper, the maximum circuity of the paths of operated trains is set to be the threshold value of the circuity of high-speed train paths. For the shortest paths of any node pairs, if their circuity is not higher than the threshold value, the paths can be regarded as the reasonable paths. With the consideration of a certain relative or absolute error, we cluster the reasonable paths on the basis of their inclusion relationship and the center path of each class represents a passenger transit corridor. We take the high-speed rail (HSR) network in China at the end of 2014 as an example, and obtain 51 passenger transit corridors, which are alternative sets of train paths. Furthermore, we analyze the circuity distribution of paths of all node pairs in the network. We find that the high circuity of train paths can be decreased with the construction of a high-speed railway line, which indicates that the structure of the HSR network in China tends to be more complete and the HSR network can make the Chinese railway network more efficient. PMID:28945757

Promoting Wired Links in Wireless Mesh Networks: An Efficient Engineering Solution

PubMed Central

Barekatain, Behrang; Raahemifar, Kaamran; Ariza Quintana, Alfonso; Triviño Cabrera, Alicia

2015-01-01

Wireless Mesh Networks (WMNs) cannot completely guarantee good performance of traffic sources such as video streaming. To improve the network performance, this study proposes an efficient engineering solution named Wireless-to-Ethernet-Mesh-Portal-Passageway (WEMPP) that allows effective use of wired communication in WMNs. WEMPP permits transmitting data through wired and stable paths even when the destination is in the same network as the source (Intra-traffic). Tested with four popular routing protocols (Optimized Link State Routing or OLSR as a proactive protocol, Dynamic MANET On-demand or DYMO as a reactive protocol, DYMO with spanning tree ability and HWMP), WEMPP considerably decreases the end-to-end delay, jitter, contentions and interferences on nodes, even when the network size or density varies. WEMPP is also cost-effective and increases the network throughput. Moreover, in contrast to solutions proposed by previous studies, WEMPP is easily implemented by modifying the firmware of the actual Ethernet hardware without altering the routing protocols and/or the functionality of the IP/MAC/Upper layers. In fact, there is no need for modifying the functionalities of other mesh components in order to work with WEMPPs. The results of this study show that WEMPP significantly increases the performance of all routing protocols, thus leading to better video quality on nodes. PMID:25793516