Resistance and Security Index of Networks: Structural Information Perspective of Network Security

PubMed Central

Li, Angsheng; Hu, Qifu; Liu, Jun; Pan, Yicheng

2016-01-01

Recently, Li and Pan defined the metric of the K-dimensional structure entropy of a structured noisy dataset G to be the information that controls the formation of the K-dimensional structure of G that is evolved by the rules, order and laws of G, excluding the random variations that occur in G. Here, we propose the notion of resistance of networks based on the one- and two-dimensional structural information of graphs. Given a graph G, we define the resistance of G, written , as the greatest overall number of bits required to determine the code of the module that is accessible via random walks with stationary distribution in G, from which the random walks cannot escape. We show that the resistance of networks follows the resistance law of networks, that is, for a network G, the resistance of G is , where and are the one- and two-dimensional structure entropies of G, respectively. Based on the resistance law, we define the security index of a network G to be the normalised resistance of G, that is, . We show that the resistance and security index are both well-defined measures for the security of the networks. PMID:27255783

Robust Network Architecture Against Random Threats in WMD Environments: Theoretical Limits and Recovery Strategies

DTIC Science & Technology

2017-08-01

green energy sources such as the Photovoltaic (PV) and Wind Turbine (WT). All those devices are equipped with Intelligent Electronic Devices (IEDs...equivalent to the connectivity in the wired networks, which is used as a prerequisite to evaluate the functionality of the network applications. Moreover, a...using different access technologies, including wired and wireless, on licensed and unlicensed frequency bands. The objectives can be two-fold in general

Network coding multiuser scheme for indoor visible light communications

NASA Astrophysics Data System (ADS)

Zhang, Jiankun; Dang, Anhong

2017-12-01

Visible light communication (VLC) is a unique alternative for indoor data transfer and developing beyond point-to-point. However, for realizing high-capacity networks, VLC is facing challenges including the constrained bandwidth of the optical access point and random occlusion. A network coding scheme for VLC (NC-VLC) is proposed, with increased throughput and system robustness. Based on the Lambertian illumination model, theoretical decoding failure probability of the multiuser NC-VLC system is derived, and the impact of the system parameters on the performance is analyzed. Experiments demonstrate the proposed scheme successfully in the indoor multiuser scenario. These results indicate that the NC-VLC system shows a good performance under the link loss and random occlusion.

Neural-Network Simulator

NASA Technical Reports Server (NTRS)

Mitchell, Paul H.

1991-01-01

F77NNS (FORTRAN 77 Neural Network Simulator) computer program simulates popular back-error-propagation neural network. Designed to take advantage of vectorization when used on computers having this capability, also used on any computer equipped with ANSI-77 FORTRAN Compiler. Problems involving matching of patterns or mathematical modeling of systems fit class of problems F77NNS designed to solve. Program has restart capability so neural network solved in stages suitable to user's resources and desires. Enables user to customize patterns of connections between layers of network. Size of neural network F77NNS applied to limited only by amount of random-access memory available to user.

The Practical Impact of Recent Computer Advances on the Analysis and Design of Large Scale Networks

DTIC Science & Technology

1974-12-01

Communications, ICC-74, June 17-19, Minneapolis, Minnesota, pp. 31C-1-21C-5. 28. Gitman , I., R, M. Van Slvke and H. Frank, "On Splitting Random Access Broadcast...1974. 29. Gitman , I., "On the Capacity of Slotted ALOHA Network and Some Design Problems," IEEE Transactions on Communications, Maren, 1975. 30

Soft-error tolerance and energy consumption evaluation of embedded computer with magnetic random access memory in practical systems using computer simulations

NASA Astrophysics Data System (ADS)

Nebashi, Ryusuke; Sakimura, Noboru; Sugibayashi, Tadahiko

2017-08-01

We evaluated the soft-error tolerance and energy consumption of an embedded computer with magnetic random access memory (MRAM) using two computer simulators. One is a central processing unit (CPU) simulator of a typical embedded computer system. We simulated the radiation-induced single-event-upset (SEU) probability in a spin-transfer-torque MRAM cell and also the failure rate of a typical embedded computer due to its main memory SEU error. The other is a delay tolerant network (DTN) system simulator. It simulates the power dissipation of wireless sensor network nodes of the system using a revised CPU simulator and a network simulator. We demonstrated that the SEU effect on the embedded computer with 1 Gbit MRAM-based working memory is less than 1 failure in time (FIT). We also demonstrated that the energy consumption of the DTN sensor node with MRAM-based working memory can be reduced to 1/11. These results indicate that MRAM-based working memory enhances the disaster tolerance of embedded computers.

Tuning resistance states by thickness control in an electroforming-free nanometallic complementary resistance random access memory

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

Yang, Xiang; Lu, Yang; Lee, Jongho

2016-01-04

Tuning low resistance state is crucial for resistance random access memory (RRAM) that aims to achieve optimal read margin and design flexibility. By back-to-back stacking two nanometallic bipolar RRAMs with different thickness into a complementary structure, we have found that its low resistance can be reliably tuned over several orders of magnitude. Such high tunability originates from the exponential thickness dependence of the high resistance state of nanometallic RRAM, in which electron wave localization in a random network gives rise to the unique scaling behavior. The complementary nanometallic RRAM provides electroforming-free, multi-resistance-state, sub-100 ns switching capability with advantageous characteristics formore » memory arrays.« less

Spatial Reuse through Dynamic Power and Routing Control in Common-Channel Random-Access Packet Radio Networks

DTIC Science & Technology

1988-08-01

routing at the network layer. Methods of implementing dynamic power control at the link la -er on an individual packet- by-packe transmission basis are...versions of the simulators that were used to obtain many of the results. Vida Pitman of Rockwell provided an appreciated review of the grammar and style of...155 R EFER EN C ES

Uncoordinated MAC for Adaptive Multi Beam Directional Networks: Analysis and Evaluation

DTIC Science & Technology

2016-08-01

control (MAC) policies for emerging systems that are equipped with fully digital antenna arrays which are capable of adaptive multi-beam directional...Adaptive Beam- forming, Multibeam, Directional Networking, Random Access, Smart Antennas I. INTRODUCTION Fully digital beamforming antenna arrays that...are capable of adaptive multi-beam communications are quickly becoming a reality. These antenna arrays allow users to form multiple simultaneous

Telecommunications media for the delivery of educational programming

NASA Technical Reports Server (NTRS)

Ballard, R.; Eastwood, L. F., Jr.

1974-01-01

The technical characteristics of various telecommunications media are examined for incorporation into educational networks. FM radio, AM radio, and VHF and UHF television are considered along with computer-aided instruction. The application of iteration networks to library systems, and microform technology are discussed. The basic principles of the communications theory are outlined, and the operation of the PLATO 4 random access system is described.

A novel strategy for load balancing of distributed medical applications.

PubMed

Logeswaran, Rajasvaran; Chen, Li-Choo

2012-04-01

Current trends in medicine, specifically in the electronic handling of medical applications, ranging from digital imaging, paperless hospital administration and electronic medical records, telemedicine, to computer-aided diagnosis, creates a burden on the network. Distributed Service Architectures, such as Intelligent Network (IN), Telecommunication Information Networking Architecture (TINA) and Open Service Access (OSA), are able to meet this new challenge. Distribution enables computational tasks to be spread among multiple processors; hence, performance is an important issue. This paper proposes a novel approach in load balancing, the Random Sender Initiated Algorithm, for distribution of tasks among several nodes sharing the same computational object (CO) instances in Distributed Service Architectures. Simulations illustrate that the proposed algorithm produces better network performance than the benchmark load balancing algorithms-the Random Node Selection Algorithm and the Shortest Queue Algorithm, especially under medium and heavily loaded conditions.

Jargon that Computes: Today's PC Terminology.

ERIC Educational Resources Information Center

Crawford, Walt

1997-01-01

Discusses PC (personal computer) and telecommunications terminology in context: Integrated Services Digital Network (ISDN); Asymmetric Digital Subscriber Line (ADSL); cable modems; satellite downloads; T1 and T3 lines; magnitudes ("giga-,""nano-"); Central Processing Unit (CPU); Random Access Memory (RAM); Universal Serial Bus…

Medium Access Control Protocols for Cognitive Radio Ad Hoc Networks: A Survey

PubMed Central

Islam, A. K. M. Muzahidul; Baharun, Sabariah; Mansoor, Nafees

2017-01-01

New wireless network paradigms will demand higher spectrum use and availability to cope with emerging data-hungry devices. Traditional static spectrum allocation policies cause spectrum scarcity, and new paradigms such as Cognitive Radio (CR) and new protocols and techniques need to be developed in order to have efficient spectrum usage. Medium Access Control (MAC) protocols are accountable for recognizing free spectrum, scheduling available resources and coordinating the coexistence of heterogeneous systems and users. This paper provides an ample review of the state-of-the-art MAC protocols, which mainly focuses on Cognitive Radio Ad Hoc Networks (CRAHN). First, a description of the cognitive radio fundamental functions is presented. Next, MAC protocols are divided into three groups, which are based on their channel access mechanism, namely time-slotted protocol, random access protocol and hybrid protocol. In each group, a detailed and comprehensive explanation of the latest MAC protocols is presented, as well as the pros and cons of each protocol. A discussion on future challenges for CRAHN MAC protocols is included with a comparison of the protocols from a functional perspective. PMID:28926952

Provably Secure Heterogeneous Access Control Scheme for Wireless Body Area Network.

PubMed

Omala, Anyembe Andrew; Mbandu, Angolo Shem; Mutiria, Kamenyi Domenic; Jin, Chunhua; Li, Fagen

2018-04-28

Wireless body area network (WBAN) provides a medium through which physiological information could be harvested and transmitted to application provider (AP) in real time. Integrating WBAN in a heterogeneous Internet of Things (IoT) ecosystem would enable an AP to monitor patients from anywhere and at anytime. However, the IoT roadmap of interconnected 'Things' is still faced with many challenges. One of the challenges in healthcare is security and privacy of streamed medical data from heterogeneously networked devices. In this paper, we first propose a heterogeneous signcryption scheme where a sender is in a certificateless cryptographic (CLC) environment while a receiver is in identity-based cryptographic (IBC) environment. We then use this scheme to design a heterogeneous access control protocol. Formal security proof for indistinguishability against adaptive chosen ciphertext attack and unforgeability against adaptive chosen message attack in random oracle model is presented. In comparison with some of the existing access control schemes, our scheme has lower computation and communication cost.

[Role of academic social networks in disseminating the scientific production of researchers in biology/medicine: the example of ResearchGate].

PubMed

Boudry, Christophe; Bouchard, Aline

2017-01-01

Over time, academic social networks are more and more used by researchers, especially thanks to the possibilities of sharing articles they offer. The objective of the present study was to evaluate the proportion, the typology (pre-print, post-print author/publisher) and the legality of the full-text publications deposited by researchers on ResearchGate which is widely used by the medical and biological community, using a sample of 1,500 randomly selected articles in PubMed and published between 2013 and 2015. To compare, the access to the full-text of the 1500 articles via PubMed and PubMed Central has been assessed, putting into evidence the important role ResearchGate plays for providing full-texts of articles in biology/medicine. It also puts academic social networks into perspective in relation to open-access repositories and open access. © 2017 médecine/sciences – Inserm.

Physical layer one-time-pad data encryption through synchronized semiconductor laser networks

NASA Astrophysics Data System (ADS)

Argyris, Apostolos; Pikasis, Evangelos; Syvridis, Dimitris

2016-02-01

Semiconductor lasers (SL) have been proven to be a key device in the generation of ultrafast true random bit streams. Their potential to emit chaotic signals under conditions with desirable statistics, establish them as a low cost solution to cover various needs, from large volume key generation to real-time encrypted communications. Usually, only undemanding post-processing is needed to convert the acquired analog timeseries to digital sequences that pass all established tests of randomness. A novel architecture that can generate and exploit these true random sequences is through a fiber network in which the nodes are semiconductor lasers that are coupled and synchronized to central hub laser. In this work we show experimentally that laser nodes in such a star network topology can synchronize with each other through complex broadband signals that are the seed to true random bit sequences (TRBS) generated at several Gb/s. The potential for each node to access real-time generated and synchronized with the rest of the nodes random bit streams, through the fiber optic network, allows to implement an one-time-pad encryption protocol that mixes the synchronized true random bit sequence with real data at Gb/s rates. Forward-error correction methods are used to reduce the errors in the TRBS and the final error rate at the data decoding level. An appropriate selection in the sampling methodology and properties, as well as in the physical properties of the chaotic seed signal through which network locks in synchronization, allows an error free performance.

CSMA/RN: A universal protocol for gigabit networks

NASA Technical Reports Server (NTRS)

Foudriat, E. C.; Maly, Kurt J.; Overstreet, C. Michael; Khanna, S.; Paterra, Frank

1990-01-01

Networks must provide intelligent access for nodes to share the communications resources. In the range of 100 Mbps to 1 Gbps, the demand access class of protocols were studied extensively. Many use some form of slot or reservation system and many the concept of attempt and defer to determine the presence or absence of incoming information. The random access class of protocols like shared channel systems (Ethernet), also use the concept of attempt and defer in the form of carrier sensing to alleviate the damaging effects of collisions. In CSMA/CD, the sensing of interference is on a global basis. All systems discussed above have one aspect in common, they examine activity on the network either locally or globally and react in an attempt and whatever mechanism. Of the attempt + mechanisms discussed, one is obviously missing; that is attempt and truncate. Attempt and truncate was studied in a ring configuration called the Carrier Sensed Multiple Access Ring Network (CSMA/RN). The system features of CSMA/RN are described including a discussion of the node operations for inserting and removing messages and for handling integrated traffic. The performance and operational features based on analytical and simulation studies which indicate that CSMA/RN is a useful and adaptable protocol over a wide range of network conditions are discussed. Finally, the research and development activities necessary to demonstrate and realize the potential of CSMA/RN as a universal, gigabit network protocol is outlined.

Cerebellar models of associative memory: Three papers from IEEE COMPCON spring 1989

NASA Technical Reports Server (NTRS)

Raugh, Michael R. (Editor)

1989-01-01

Three papers are presented on the following topics: (1) a cerebellar-model associative memory as a generalized random-access memory; (2) theories of the cerebellum - two early models of associative memory; and (3) intelligent network management and functional cerebellum synthesis.

Changing Community Health Behaviors with a Health Promotion Computer Network: Preliminary Findings from Stanford Health-Net

PubMed Central

Robinson, Thomas N.; Walters, Paul A.

1987-01-01

Computer-based health education has been employed in many settings. However, data on resultant behavior change are lacking. A randomized, controlled, prospective study was performed to test the efficacy of Stanford Health-Net in changing community health behaviors. Graduate and undergraduate students (N=1003) were randomly assigned to treatment and control conditions. The treatment group received access to Health-Net, a health promotion computer network emphasizing specific self-care and preventive strategies. Over a four month intervention period, 26% of the treatment group used Health-Net an average of 6.4 times each (range 1 to 97). Users rated Health-Net favorably. The mean number of ambulatory medical visits decreesed 22.5% more in the treatment group than in the control group (P<.05), while hospitalizations did not differ significantly between groups. In addition, perceived self-efficacy for preventing the acquisition of a STD and herpes increased 577% (P<.05) and 261% (P<.01) more, respectively, in the treatment group than in the control group. These findings suggest that access to Stanford Health-Net can result in significant health behavior change. The advantages of the network approach make it a potential model for other communities.

Asynchronous Communication Scheme For Hypercube Computer

NASA Technical Reports Server (NTRS)

Madan, Herb S.

1988-01-01

Scheme devised for asynchronous-message communication system for Mark III hypercube concurrent-processor network. Network consists of up to 1,024 processing elements connected electrically as though were at corners of 10-dimensional cube. Each node contains two Motorola 68020 processors along with Motorola 68881 floating-point processor utilizing up to 4 megabytes of shared dynamic random-access memory. Scheme intended to support applications requiring passage of both polled or solicited and unsolicited messages.

Passive Fingerprinting Of Computer Network Reconnaissance Tools

DTIC Science & Technology

2009-09-01

v6 for version 6 MITM : Man-In-The-Middle Attack MSS: Maximum Segment Size NOP: No Operation Performed NPS: Naval Postgraduate School OS...specific, or man-in-the- middle ( MITM ) attacks. Depending on the attacker’s position to access the targeted network, the attacker may be able to...identification numbers. Both are ordinarily supposed to be initialized as a random number to make it difficult for an attacker to perform an injection MITM

Assessing new patient access to mental health providers in HMO networks.

PubMed

Barry, Colleen L; Venkatesh, Mohini; Busch, Susan H

2008-12-01

This study examined access to mental health providers in health maintenance organization (HMO) networks. A telephone survey was conducted with a stratified random sample of mental health providers listed as being in a network for at lease one of six HMOs operating in Connecticut (response rate=72%; N=366). Data were collected between December 2006 and March 2007. Measures included the accuracy of network listings, acceptance rates of new patients, and reasons for not accepting new patients. Acceptance of new patients was defined as scheduling an appointment within two weeks from the time of the initial contact. Logistic regression was used to examine acceptance rates of new patients while controlling for type of provider (social worker, nurse, psychologist, or psychiatrist) and practice characteristics. Findings indicate that 17% of sampled HMO network listings were inaccurate. Among the providers with an accurate listing, 73% were accepting new HMO patients and 76% were accepting new self-pay patients. These aggregate acceptance rates of new patients mask differences among providers, with psychiatrists significantly less likely than other providers to accept new patients (55% of psychiatrists were accepting new patients). The most common reason for not accepting new patients was the lack of available appointments. Results indicate that access to mental health providers in HMO networks varied by type of provider. For HMO enrollees seeking treatment for mental health problems from a provider with a master's degree in social work (M.S.W. degree), network access was not a major problem. Scheduling an appointment with a psychiatrist, particularly a psychiatrist treating children only, was more difficult.

An Adaptive OFDMA-Based MAC Protocol for Underwater Acoustic Wireless Sensor Networks

PubMed Central

Khalil, Issa M.; Gadallah, Yasser; Hayajneh, Mohammad; Khreishah, Abdallah

2012-01-01

Underwater acoustic wireless sensor networks (UAWSNs) have many applications across various civilian and military domains. However, they suffer from the limited available bandwidth of acoustic signals and harsh underwater conditions. In this work, we present an Orthogonal Frequency Division Multiple Access (OFDMA)-based Media Access Control (MAC) protocol that is configurable to suit the operating requirements of the underwater sensor network. The protocol has three modes of operation, namely random, equal opportunity and energy-conscious modes of operation. Our MAC design approach exploits the multi-path characteristics of a fading acoustic channel to convert it into parallel independent acoustic sub-channels that undergo flat fading. Communication between node pairs within the network is done using subsets of these sub-channels, depending on the configurations of the active mode of operation. Thus, the available limited bandwidth gets fully utilized while completely avoiding interference. We derive the mathematical model for optimal power loading and subcarrier selection, which is used as basis for all modes of operation of the protocol. We also conduct many simulation experiments to evaluate and compare our protocol with other Code Division Multiple Access (CDMA)-based MAC protocols. PMID:23012517

An adaptive OFDMA-based MAC protocol for underwater acoustic wireless sensor networks.

PubMed

Khalil, Issa M; Gadallah, Yasser; Hayajneh, Mohammad; Khreishah, Abdallah

2012-01-01

Underwater acoustic wireless sensor networks (UAWSNs) have many applications across various civilian and military domains. However, they suffer from the limited available bandwidth of acoustic signals and harsh underwater conditions. In this work, we present an Orthogonal Frequency Division Multiple Access (OFDMA)-based Media Access Control (MAC) protocol that is configurable to suit the operating requirements of the underwater sensor network. The protocol has three modes of operation, namely random, equal opportunity and energy-conscious modes of operation. Our MAC design approach exploits the multi-path characteristics of a fading acoustic channel to convert it into parallel independent acoustic sub-channels that undergo flat fading. Communication between node pairs within the network is done using subsets of these sub-channels, depending on the configurations of the active mode of operation. Thus, the available limited bandwidth gets fully utilized while completely avoiding interference. We derive the mathematical model for optimal power loading and subcarrier selection, which is used as basis for all modes of operation of the protocol. We also conduct many simulation experiments to evaluate and compare our protocol with other Code Division Multiple Access (CDMA)-based MAC protocols.

Engineering Online and In-person Social Networks for Physical Activity: A Randomized Trial

PubMed Central

Rovniak, Liza S.; Kong, Lan; Hovell, Melbourne F.; Ding, Ding; Sallis, James F.; Ray, Chester A.; Kraschnewski, Jennifer L.; Matthews, Stephen A.; Kiser, Elizabeth; Chinchilli, Vernon M.; George, Daniel R.; Sciamanna, Christopher N.

2016-01-01

Background Social networks can influence physical activity, but little is known about how best to engineer online and in-person social networks to increase activity. Purpose To conduct a randomized trial based on the Social Networks for Activity Promotion model to assess the incremental contributions of different procedures for building social networks on objectively-measured outcomes. Methods Physically inactive adults (n = 308, age, 50.3 (SD = 8.3) years, 38.3% male, 83.4% overweight/obese) were randomized to 1 of 3 groups. The Promotion group evaluated the effects of weekly emailed tips emphasizing social network interactions for walking (e.g., encouragement, informational support); the Activity group evaluated the incremental effect of adding an evidence-based online fitness walking intervention to the weekly tips; and the Social Networks group evaluated the additional incremental effect of providing access to an online networking site for walking, and prompting walking/activity across diverse settings. The primary outcome was mean change in accelerometer-measured moderate-to-vigorous physical activity (MVPA), assessed at 3 and 9 months from baseline. Results Participants increased their MVPA by 21.0 mins/week, 95% CI [5.9, 36.1], p = .005, at 3 months, and this change was sustained at 9 months, with no between-group differences. Conclusions Although the structure of procedures for targeting social networks varied across intervention groups, the functional effect of these procedures on physical activity was similar. Future research should evaluate if more powerful reinforcers improve the effects of social network interventions. Trial Registration Number NCT01142804 PMID:27405724

A tensor network approach to many-body localization

NASA Astrophysics Data System (ADS)

Yu, Xiongjie; Pekker, David; Clark, Bryan

Understanding the many-body localized phase requires access to eigenstates in the middle of the many-body spectrum. While exact-diagonalization is able to access these eigenstates, it is restricted to systems sizes of about 22 spins. To overcome this limitation, we develop tensor network algorithms which increase the accessible system size by an order of magnitude. We describe both our new algorithms as well as the additional physics about MBL we can extract from them. For example, we demonstrate the power of these methods by verifying the breakdown of the Eigenstate Thermalization Hypothesis (ETH) in the many-body localized phase of the random field Heisenberg model, and show the saturation of entanglement in the MBL phase and generate eigenstates that differ by local excitations. Work was supported by AFOSR FA9550-10-1-0524 and FA9550-12-1-0057, the Kaufmann foundation, and SciDAC FG02-12ER46875.

The impact of capacity growth in national telecommunications networks.

PubMed

Lord, Andrew; Soppera, Andrea; Jacquet, Arnaud

2016-03-06

This paper discusses both UK-based and global Internet data bandwidth growth, beginning with historical data for the BT network. We examine the time variations in consumer behaviour and how this is statistically aggregated into larger traffic loads on national core fibre communications networks. The random nature of consumer Internet behaviour, where very few consumers require maximum bandwidth simultaneously, provides the opportunity for a significant statistical gain. The paper looks at predictions for how this growth might continue over the next 10-20 years, giving estimates for the amount of bandwidth that networks should support in the future. The paper then explains how national networks are designed to accommodate these traffic levels, and the various network roles, including access, metro and core, are described. The physical layer network is put into the context of how the packet and service layers are designed and the applications and location of content are also included in an overall network overview. The specific role of content servers in alleviating core network traffic loads is highlighted. The status of the relevant transmission technologies in the access, metro and core is given, showing that these technologies, with adequate research, should be sufficient to provide bandwidth for consumers in the next 10-20 years. © 2016 The Author(s).

Folding energy landscape and network dynamics of small globular proteins

PubMed Central

Hori, Naoto; Chikenji, George; Berry, R. Stephen; Takada, Shoji

2009-01-01

The folding energy landscape of proteins has been suggested to be funnel-like with some degree of ruggedness on the slope. How complex the landscape, however, is still rather unclear. Many experiments for globular proteins suggested relative simplicity, whereas molecular simulations of shorter peptides implied more complexity. Here, by using complete conformational sampling of 2 globular proteins, protein G and src SH3 domain and 2 related random peptides, we investigated their energy landscapes, topological properties of folding networks, and folding dynamics. The projected energy surfaces of globular proteins were funneled in the vicinity of the native but also have other quite deep, accessible minima, whereas the randomized peptides have many local basins, including some leading to seriously misfolded forms. Dynamics in the denatured part of the network exhibited basin-hopping itinerancy among many conformations, whereas the protein reached relatively well-defined final stages that led to their native states. We also found that the folding network has the hierarchic nature characterized by the scale-free and the small-world properties. PMID:19114654

Folding energy landscape and network dynamics of small globular proteins.

PubMed

Hori, Naoto; Chikenji, George; Berry, R Stephen; Takada, Shoji

2009-01-06

The folding energy landscape of proteins has been suggested to be funnel-like with some degree of ruggedness on the slope. How complex the landscape, however, is still rather unclear. Many experiments for globular proteins suggested relative simplicity, whereas molecular simulations of shorter peptides implied more complexity. Here, by using complete conformational sampling of 2 globular proteins, protein G and src SH3 domain and 2 related random peptides, we investigated their energy landscapes, topological properties of folding networks, and folding dynamics. The projected energy surfaces of globular proteins were funneled in the vicinity of the native but also have other quite deep, accessible minima, whereas the randomized peptides have many local basins, including some leading to seriously misfolded forms. Dynamics in the denatured part of the network exhibited basin-hopping itinerancy among many conformations, whereas the protein reached relatively well-defined final stages that led to their native states. We also found that the folding network has the hierarchic nature characterized by the scale-free and the small-world properties.

Data Processing for NASA's TDRSS DAMA Channel

NASA Technical Reports Server (NTRS)

Long, Christopher C.; Horan, Stephen

1996-01-01

A concept for the addition of a Demand Assignment Multiple Access (DAMA) service to NASA's current Space Network (SN) is developed. Specifically, the design of a receiver for the DAMA channel is outlined. Also, an outline of the procedures taken to process the received service request is presented. The modifications to the (SN) system are minimal. The post reception processing is accomplished using standard commercial off the shelf (COTS) packages. The result is a random access system capable of receiving requests for service.

Random access to mobile networks with advanced error correction

NASA Technical Reports Server (NTRS)

Dippold, Michael

1990-01-01

A random access scheme for unreliable data channels is investigated in conjunction with an adaptive Hybrid-II Automatic Repeat Request (ARQ) scheme using Rate Compatible Punctured Codes (RCPC) Forward Error Correction (FEC). A simple scheme with fixed frame length and equal slot sizes is chosen and reservation is implicit by the first packet transmitted randomly in a free slot, similar to Reservation Aloha. This allows the further transmission of redundancy if the last decoding attempt failed. Results show that a high channel utilization and superior throughput can be achieved with this scheme that shows a quite low implementation complexity. For the example of an interleaved Rayleigh channel and soft decision utilization and mean delay are calculated. A utilization of 40 percent may be achieved for a frame with the number of slots being equal to half the station number under high traffic load. The effects of feedback channel errors and some countermeasures are discussed.

Comparison of RF spectrum prediction methods for dynamic spectrum access

NASA Astrophysics Data System (ADS)

Kovarskiy, Jacob A.; Martone, Anthony F.; Gallagher, Kyle A.; Sherbondy, Kelly D.; Narayanan, Ram M.

2017-05-01

Dynamic spectrum access (DSA) refers to the adaptive utilization of today's busy electromagnetic spectrum. Cognitive radio/radar technologies require DSA to intelligently transmit and receive information in changing environments. Predicting radio frequency (RF) activity reduces sensing time and energy consumption for identifying usable spectrum. Typical spectrum prediction methods involve modeling spectral statistics with Hidden Markov Models (HMM) or various neural network structures. HMMs describe the time-varying state probabilities of Markov processes as a dynamic Bayesian network. Neural Networks model biological brain neuron connections to perform a wide range of complex and often non-linear computations. This work compares HMM, Multilayer Perceptron (MLP), and Recurrent Neural Network (RNN) algorithms and their ability to perform RF channel state prediction. Monte Carlo simulations on both measured and simulated spectrum data evaluate the performance of these algorithms. Generalizing spectrum occupancy as an alternating renewal process allows Poisson random variables to generate simulated data while energy detection determines the occupancy state of measured RF spectrum data for testing. The results suggest that neural networks achieve better prediction accuracy and prove more adaptable to changing spectral statistics than HMMs given sufficient training data.

Random Access Memories: A New Paradigm for Target Detection in High Resolution Aerial Remote Sensing Images.

PubMed

Zou, Zhengxia; Shi, Zhenwei

2018-03-01

We propose a new paradigm for target detection in high resolution aerial remote sensing images under small target priors. Previous remote sensing target detection methods frame the detection as learning of detection model + inference of class-label and bounding-box coordinates. Instead, we formulate it from a Bayesian view that at inference stage, the detection model is adaptively updated to maximize its posterior that is determined by both training and observation. We call this paradigm "random access memories (RAM)." In this paradigm, "Memories" can be interpreted as any model distribution learned from training data and "random access" means accessing memories and randomly adjusting the model at detection phase to obtain better adaptivity to any unseen distribution of test data. By leveraging some latest detection techniques e.g., deep Convolutional Neural Networks and multi-scale anchors, experimental results on a public remote sensing target detection data set show our method outperforms several other state of the art methods. We also introduce a new data set "LEarning, VIsion and Remote sensing laboratory (LEVIR)", which is one order of magnitude larger than other data sets of this field. LEVIR consists of a large set of Google Earth images, with over 22 k images and 10 k independently labeled targets. RAM gives noticeable upgrade of accuracy (an mean average precision improvement of 1% ~ 4%) of our baseline detectors with acceptable computational overhead.

On Searching Available Channels with Asynchronous MAC-Layer Spectrum Sensing

NASA Astrophysics Data System (ADS)

Jiang, Chunxiao; Ma, Xin; Chen, Canfeng; Ma, Jian; Ren, Yong

Dynamic spectrum access has become a focal issue recently, in which identifying the available spectrum plays a rather important role. Lots of work has been done concerning secondary user (SU) synchronously accessing primary user's (PU's) network. However, on one hand, SU may have no idea about PU's communication protocols; on the other, it is possible that communications among PU are not based on synchronous scheme at all. In order to address such problems, this paper advances a strategy for SU to search available spectrums with asynchronous MAC-layer sensing. With this method, SUs need not know the communication mechanisms in PU's network when dynamically accessing. We will focus on four aspects: 1) strategy for searching available channels; 2) vacating strategy when PUs come back; 3) estimation of channel parameters; 4) impact of SUs' interference on PU's data rate. The simulations show that our search strategy not only can achieve nearly 50% less interference probability than equal allocation of total search time, but also well adapts to time-varying channels. Moreover, access by our strategies can attain 150% more access time than random access. The moment matching estimator shows good performance in estimating and tracing time-varying channels.

Disease Surveillance on Complex Social Networks.

PubMed

Herrera, Jose L; Srinivasan, Ravi; Brownstein, John S; Galvani, Alison P; Meyers, Lauren Ancel

2016-07-01

As infectious disease surveillance systems expand to include digital, crowd-sourced, and social network data, public health agencies are gaining unprecedented access to high-resolution data and have an opportunity to selectively monitor informative individuals. Contact networks, which are the webs of interaction through which diseases spread, determine whether and when individuals become infected, and thus who might serve as early and accurate surveillance sensors. Here, we evaluate three strategies for selecting sensors-sampling the most connected, random, and friends of random individuals-in three complex social networks-a simple scale-free network, an empirical Venezuelan college student network, and an empirical Montreal wireless hotspot usage network. Across five different surveillance goals-early and accurate detection of epidemic emergence and peak, and general situational awareness-we find that the optimal choice of sensors depends on the public health goal, the underlying network and the reproduction number of the disease (R0). For diseases with a low R0, the most connected individuals provide the earliest and most accurate information about both the onset and peak of an outbreak. However, identifying network hubs is often impractical, and they can be misleading if monitored for general situational awareness, if the underlying network has significant community structure, or if R0 is high or unknown. Taking a theoretical approach, we also derive the optimal surveillance system for early outbreak detection but find that real-world identification of such sensors would be nearly impossible. By contrast, the friends-of-random strategy offers a more practical and robust alternative. It can be readily implemented without prior knowledge of the network, and by identifying sensors with higher than average, but not the highest, epidemiological risk, it provides reasonably early and accurate information.

Medium Access Control for Opportunistic Concurrent Transmissions under Shadowing Channels

PubMed Central

Son, In Keun; Mao, Shiwen; Hur, Seung Min

2009-01-01

We study the problem of how to alleviate the exposed terminal effect in multi-hop wireless networks in the presence of log-normal shadowing channels. Assuming node location information, we propose an extension of the IEEE 802.11 MAC protocol that sched-ules concurrent transmissions in the presence of log-normal shadowing, thus mitigating the exposed terminal problem and improving network throughput and delay performance. We observe considerable improvements in throughput and delay achieved over the IEEE 802.11 MAC under various network topologies and channel conditions in ns-2 simulations, which justify the importance of considering channel randomness in MAC protocol design for multi-hop wireless networks. PMID:22408556

Engineering Online and In-Person Social Networks for Physical Activity: A Randomized Trial.

PubMed

Rovniak, Liza S; Kong, Lan; Hovell, Melbourne F; Ding, Ding; Sallis, James F; Ray, Chester A; Kraschnewski, Jennifer L; Matthews, Stephen A; Kiser, Elizabeth; Chinchilli, Vernon M; George, Daniel R; Sciamanna, Christopher N

2016-12-01

Social networks can influence physical activity, but little is known about how best to engineer online and in-person social networks to increase activity. The purpose of this study was to conduct a randomized trial based on the Social Networks for Activity Promotion model to assess the incremental contributions of different procedures for building social networks on objectively measured outcomes. Physically inactive adults (n = 308, age, 50.3 (SD = 8.3) years, 38.3 % male, 83.4 % overweight/obese) were randomized to one of three groups. The Promotion group evaluated the effects of weekly emailed tips emphasizing social network interactions for walking (e.g., encouragement, informational support); the Activity group evaluated the incremental effect of adding an evidence-based online fitness walking intervention to the weekly tips; and the Social Networks group evaluated the additional incremental effect of providing access to an online networking site for walking as well as prompting walking/activity across diverse settings. The primary outcome was mean change in accelerometer-measured moderate-to-vigorous physical activity (MVPA), assessed at 3 and 9 months from baseline. Participants increased their MVPA by 21.0 min/week, 95 % CI [5.9, 36.1], p = .005, at 3 months, and this change was sustained at 9 months, with no between-group differences. Although the structure of procedures for targeting social networks varied across intervention groups, the functional effect of these procedures on physical activity was similar. Future research should evaluate if more powerful reinforcers improve the effects of social network interventions. The trial was registered with the ClinicalTrials.gov (NCT01142804).

Disease Surveillance on Complex Social Networks

PubMed Central

Herrera, Jose L.; Srinivasan, Ravi; Brownstein, John S.; Galvani, Alison P.; Meyers, Lauren Ancel

2016-01-01

As infectious disease surveillance systems expand to include digital, crowd-sourced, and social network data, public health agencies are gaining unprecedented access to high-resolution data and have an opportunity to selectively monitor informative individuals. Contact networks, which are the webs of interaction through which diseases spread, determine whether and when individuals become infected, and thus who might serve as early and accurate surveillance sensors. Here, we evaluate three strategies for selecting sensors—sampling the most connected, random, and friends of random individuals—in three complex social networks—a simple scale-free network, an empirical Venezuelan college student network, and an empirical Montreal wireless hotspot usage network. Across five different surveillance goals—early and accurate detection of epidemic emergence and peak, and general situational awareness—we find that the optimal choice of sensors depends on the public health goal, the underlying network and the reproduction number of the disease (R0). For diseases with a low R0, the most connected individuals provide the earliest and most accurate information about both the onset and peak of an outbreak. However, identifying network hubs is often impractical, and they can be misleading if monitored for general situational awareness, if the underlying network has significant community structure, or if R0 is high or unknown. Taking a theoretical approach, we also derive the optimal surveillance system for early outbreak detection but find that real-world identification of such sensors would be nearly impossible. By contrast, the friends-of-random strategy offers a more practical and robust alternative. It can be readily implemented without prior knowledge of the network, and by identifying sensors with higher than average, but not the highest, epidemiological risk, it provides reasonably early and accurate information. PMID:27415615

The ALOHA SYSTEM

NASA Technical Reports Server (NTRS)

Abramson, N.

1972-01-01

The report provides a status report and description of THE ALOHA SYSTEM research project at the University of Hawaii. THE ALOHA SYSTEM involves the analysis and construction of advanced methods of random access communications in large computer-communication systems. The existing ALOHA SYSTEM computer-communication network uses two 24,000 baud channels in the UHF band. The system employs message switching techniques similar to those of the ARPANET, in conjunction with a novel form of random access radio channel multiplexing. By means of these techniques the system has the capacity to accommodate several hundred active users of alphanumeric consoles on the two channels available. Each of these users can transmit and receive at a peak data rate of 24,000 baud although the average data rate of the users must of course be considerably less.

Hard-to-reach? Using health access status as a way to more effectively target segments of the Latino audience.

PubMed

Wilkin, Holley A; Ball-Rokeach, Sandra J

2011-04-01

Health issues disproportionately affect Latinos, but variations within this ethnic group may mean that some Latinos are harder to reach with health messages than others. This paper introduces a methodology grounded in communication infrastructure theory to better target 'hard-to-reach' audiences. A random digit dialing telephone survey of 739 Latinos living in two Los Angeles communities was conducted. The relationships between health access difficulties and connections to an integrated storytelling network as well as individual health communication source connections were explored. Findings suggest that Latinos who are connected to an integrated storytelling network report marginally greater ease finding healthcare, despite not being any more likely to have insurance or a regular place for healthcare. Latinos who have health access problems tended to rely more upon Spanish-language television for health information. In addition, those without healthcare access problems are more likely to indicate that they use health professionals, the Internet, mainstream TV and printed materials like health pamphlets for health information. The theoretical and methodological contributions of this work, its major findings, implications, limitations and policy guidelines are discussed.

Biochemical Network Stochastic Simulator (BioNetS): software for stochastic modeling of biochemical networks.

PubMed

Adalsteinsson, David; McMillen, David; Elston, Timothy C

2004-03-08

Intrinsic fluctuations due to the stochastic nature of biochemical reactions can have large effects on the response of biochemical networks. This is particularly true for pathways that involve transcriptional regulation, where generally there are two copies of each gene and the number of messenger RNA (mRNA) molecules can be small. Therefore, there is a need for computational tools for developing and investigating stochastic models of biochemical networks. We have developed the software package Biochemical Network Stochastic Simulator (BioNetS) for efficiently and accurately simulating stochastic models of biochemical networks. BioNetS has a graphical user interface that allows models to be entered in a straightforward manner, and allows the user to specify the type of random variable (discrete or continuous) for each chemical species in the network. The discrete variables are simulated using an efficient implementation of the Gillespie algorithm. For the continuous random variables, BioNetS constructs and numerically solves the appropriate chemical Langevin equations. The software package has been developed to scale efficiently with network size, thereby allowing large systems to be studied. BioNetS runs as a BioSpice agent and can be downloaded from http://www.biospice.org. BioNetS also can be run as a stand alone package. All the required files are accessible from http://x.amath.unc.edu/BioNetS. We have developed BioNetS to be a reliable tool for studying the stochastic dynamics of large biochemical networks. Important features of BioNetS are its ability to handle hybrid models that consist of both continuous and discrete random variables and its ability to model cell growth and division. We have verified the accuracy and efficiency of the numerical methods by considering several test systems.

Design and implementation of a random neural network routing engine.

PubMed

Kocak, T; Seeber, J; Terzioglu, H

2003-01-01

Random neural network (RNN) is an analytically tractable spiked neural network model that has been implemented in software for a wide range of applications for over a decade. This paper presents the hardware implementation of the RNN model. Recently, cognitive packet networks (CPN) is proposed as an alternative packet network architecture where there is no routing table, instead the RNN based reinforcement learning is used to route packets. Particularly, we describe implementation details for the RNN based routing engine of a CPN network processor chip: the smart packet processor (SPP). The SPP is a dual port device that stores, modifies, and interprets the defining characteristics of multiple RNN models. In addition to hardware design improvements over the software implementation such as the dual access memory, output calculation step, and reduced output calculation module, this paper introduces a major modification to the reinforcement learning algorithm used in the original CPN specification such that the number of weight terms are reduced from 2n/sup 2/ to 2n. This not only yields significant memory savings, but it also simplifies the calculations for the steady state probabilities (neuron outputs in RNN). Simulations have been conducted to confirm the proper functionality for the isolated SPP design as well as for the multiple SPP's in a networked environment.

Dynamic spectrum management: an impact on EW systems

NASA Astrophysics Data System (ADS)

Gajewski, P.; Łopatka, J.; Suchanski, M.

2017-04-01

Rapid evolution of wireless systems caused an enormous growth of data streams transmitted through the networks and, as a consequence, an accompanying demand concerning spectrum resources (SR). An avoidance of advisable disturbances is one of the main demands in military communications. To solve the interference problems, dynamic spectrum management (DSM) techniques can be used. Two main techniques are possible: centralized Coordinated Dynamic Spectrum Access (CDSA) and distributed Opportunistic Spectrum Access (OSA). CDSA enables the wireless networks planning automation, and systems dynamic reaction to random changes of Radio Environment (RE). For OSA, cognitive radio (CR) is the most promising technology that enables avoidance of interference with the other spectrum users due to CR's transmission parameters adaptation to the current radio situation, according to predefined Radio Policies rules. If DSM techniques are used, the inherent changes in EW systems are also needed. On one hand, new techniques of jamming should be elaborated, on the other hand, the rules and protocols of cooperation between communication network and EW systems should be developed.

Dynamic fair node spectrum allocation for ad hoc networks using random matrices

NASA Astrophysics Data System (ADS)

Rahmes, Mark; Lemieux, George; Chester, Dave; Sonnenberg, Jerry

2015-05-01

Dynamic Spectrum Access (DSA) is widely seen as a solution to the problem of limited spectrum, because of its ability to adapt the operating frequency of a radio. Mobile Ad Hoc Networks (MANETs) can extend high-capacity mobile communications over large areas where fixed and tethered-mobile systems are not available. In one use case with high potential impact, cognitive radio employs spectrum sensing to facilitate the identification of allocated frequencies not currently accessed by their primary users. Primary users own the rights to radiate at a specific frequency and geographic location, while secondary users opportunistically attempt to radiate at a specific frequency when the primary user is not using it. We populate a spatial radio environment map (REM) database with known information that can be leveraged in an ad hoc network to facilitate fair path use of the DSA-discovered links. Utilization of high-resolution geospatial data layers in RF propagation analysis is directly applicable. Random matrix theory (RMT) is useful in simulating network layer usage in nodes by a Wishart adjacency matrix. We use the Dijkstra algorithm for discovering ad hoc network node connection patterns. We present a method for analysts to dynamically allocate node-node path and link resources using fair division. User allocation of limited resources as a function of time must be dynamic and based on system fairness policies. The context of fair means that first available request for an asset is not envied as long as it is not yet allocated or tasked in order to prevent cycling of the system. This solution may also save money by offering a Pareto efficient repeatable process. We use a water fill queue algorithm to include Shapley value marginal contributions for allocation.

Randomized Trial of a Social Networking Intervention for Cancer-Related Distress.

PubMed

Owen, Jason E; O'Carroll Bantum, Erin; Pagano, Ian S; Stanton, Annette

2017-10-01

Web and mobile technologies appear to hold promise for delivering evidence-informed and evidence-based intervention to cancer survivors and others living with trauma and other psychological concerns. Health-space.net was developed as a comprehensive online social networking and coping skills training program for cancer survivors living with distress. The purpose of this study was to evaluate the effects of a 12-week social networking intervention on distress, depression, anxiety, vigor, and fatigue in cancer survivors reporting high levels of cancer-related distress. We recruited 347 participants from a local cancer registry and internet, and all were randomized to either a 12-week waiting list control group or to immediate access to the intervention. Intervention participants received secure access to the study website, which provided extensive social networking capabilities and coping skills training exercises facilitated by a professional facilitator. Across time, the prevalence of clinically significant depression symptoms declined from 67 to 34 % in both conditions. The health-space.net intervention had greater declines in fatigue than the waitlist control group, but the intervention did not improve outcomes for depression, trauma-related anxiety symptoms, or overall mood disturbance. For those with more severe levels of anxiety at baseline, greater engagement with the intervention was associated with higher levels of symptom reduction over time. The intervention resulted in small but significant effects on fatigue but not other primary or secondary outcomes. Results suggest that this social networking intervention may be most effective for those who have distress that is not associated with high levels of anxiety symptoms or very poor overall psychological functioning. The trial was registered with the ClinicalTrials.gov database ( ClinicalTrials.gov #NCT01976949).

Network Randomization and Dynamic Defense for Critical Infrastructure Systems

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

Chavez, Adrian R.; Martin, Mitchell Tyler; Hamlet, Jason

2015-04-01

Critical Infrastructure control systems continue to foster predictable communication paths, static configurations, and unpatched systems that allow easy access to our nation's most critical assets. This makes them attractive targets for cyber intrusion. We seek to address these attack vectors by automatically randomizing network settings, randomizing applications on the end devices themselves, and dynamically defending these systems against active attacks. Applying these protective measures will convert control systems into moving targets that proactively defend themselves against attack. Sandia National Laboratories has led this effort by gathering operational and technical requirements from Tennessee Valley Authority (TVA) and performing research and developmentmore » to create a proof-of-concept solution. Our proof-of-concept has been tested in a laboratory environment with over 300 nodes. The vision of this project is to enhance control system security by converting existing control systems into moving targets and building these security measures into future systems while meeting the unique constraints that control systems face.« less

Clustering Single-Cell Expression Data Using Random Forest Graphs.

PubMed

Pouyan, Maziyar Baran; Nourani, Mehrdad

2017-07-01

Complex tissues such as brain and bone marrow are made up of multiple cell types. As the study of biological tissue structure progresses, the role of cell-type-specific research becomes increasingly important. Novel sequencing technology such as single-cell cytometry provides researchers access to valuable biological data. Applying machine-learning techniques to these high-throughput datasets provides deep insights into the cellular landscape of the tissue where those cells are a part of. In this paper, we propose the use of random-forest-based single-cell profiling, a new machine-learning-based technique, to profile different cell types of intricate tissues using single-cell cytometry data. Our technique utilizes random forests to capture cell marker dependences and model the cellular populations using the cell network concept. This cellular network helps us discover what cell types are in the tissue. Our experimental results on public-domain datasets indicate promising performance and accuracy of our technique in extracting cell populations of complex tissues.

Productivity and cost estimators for conventional ground-based skidding on steep terrain using preplanned skid roads

Treesearch

Michael D. Erickson; Curt C. Hassler; Chris B. LeDoux

1991-01-01

Continuous time and motion study techniques were used to develop productivity and cost estimators for the skidding component of ground-based logging systems, operating on steep terrain using preplanned skid roads. Comparisons of productivity and costs were analyzed for an overland random access skidding method, verses a skidding method utilizing a network of preplanned...

Roles and functions of social networks among men who use drugs in ART initiation in Vietnam

PubMed Central

Latkin, Carl A.; Smith, M. Kumi; Ha, Tran Viet; Mo, Tran Thi; Zelaya, Carla; Sripaipan, Teerada; Le Minh, Nguyen; Quan, Vu Minh; Go, Vivian F.

2016-01-01

Support from social network members may help to facilitate access to HIV medical care, especially in low resourced communities. As part of a randomized clinical trial of a community-level stigma and risk reduction intervention in Thai Nguyen, Vietnam for people living with HIV who inject drugs (PWID), 341 participants were administered a baseline social network inventory. Network predictors of antiretroviral therapy (ART) initiation at the six-month follow-up were assessed. The social networks of PWID were sparse. Few participants who reported injectors in their networks also reported family members, whereas those who did not have injectors were more likely to report family members and network members providing emotional support and medical advice. In multivariate models, having at least one network member who provided medical advice predicted ART initiation at six months (OR=2.74, CI=1.20–6.28). These results suggest the importance of functional social support and network support mobilization for ART initiation among PWID. PMID:27125243

Roles and Functions of Social Networks Among Men Who Use Drugs in ART Initiation in Vietnam.

PubMed

Latkin, Carl A; Smith, M Kumi; Ha, Tran Viet; Mo, Tran Thi; Zelaya, Carla; Sripaipan, Teerada; Le Minh, Nguyen; Quan, Vu Minh; Go, Vivian F

2016-11-01

Support from social network members may help to facilitate access to HIV medical care, especially in low resourced communities. As part of a randomized clinical trial of a community-level stigma and risk reduction intervention in Thai Nguyen, Vietnam for people living with HIV who inject drugs (PWID), 341 participants were administered a baseline social network inventory. Network predictors of antiretroviral therapy (ART) initiation at the 6-month follow-up were assessed. The social networks of PWID were sparse. Few participants who reported injectors in their networks also reported family members, whereas those who did not have injectors were more likely to report family members and network members providing emotional support and medical advice. In multivariate models, having at least one network member who provided medical advice predicted ART initiation at 6 months (OR 2.74, CI 1.20-6.28). These results suggest the importance of functional social support and network support mobilization for ART initiation among PWID.

Digital video technologies and their network requirements

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

R. P. Tsang; H. Y. Chen; J. M. Brandt

1999-11-01

Coded digital video signals are considered to be one of the most difficult data types to transport due to their real-time requirements and high bit rate variability. In this study, the authors discuss the coding mechanisms incorporated by the major compression standards bodies, i.e., JPEG and MPEG, as well as more advanced coding mechanisms such as wavelet and fractal techniques. The relationship between the applications which use these coding schemes and their network requirements are the major focus of this study. Specifically, the authors relate network latency, channel transmission reliability, random access speed, buffering and network bandwidth with the variousmore » coding techniques as a function of the applications which use them. Such applications include High-Definition Television, Video Conferencing, Computer-Supported Collaborative Work (CSCW), and Medical Imaging.« less

Probabilistic Analysis of Hierarchical Cluster Protocols for Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Kaj, Ingemar

Wireless sensor networks are designed to extract data from the deployment environment and combine sensing, data processing and wireless communication to provide useful information for the network users. Hundreds or thousands of small embedded units, which operate under low-energy supply and with limited access to central network control, rely on interconnecting protocols to coordinate data aggregation and transmission. Energy efficiency is crucial and it has been proposed that cluster based and distributed architectures such as LEACH are particularly suitable. We analyse the random cluster hierarchy in this protocol and provide a solution for low-energy and limited-loss optimization. Moreover, we extend these results to a multi-level version of LEACH, where clusters of nodes again self-organize to form clusters of clusters, and so on.

A method of examining the structure and topological properties of public-transport networks

NASA Astrophysics Data System (ADS)

Dimitrov, Stavri Dimitri; Ceder, Avishai (Avi)

2016-06-01

This work presents a new method of examining the structure of public-transport networks (PTNs) and analyzes their topological properties through a combination of computer programming, statistical data and large-network analyses. In order to automate the extraction, processing and exporting of data, a software program was developed allowing to extract the needed data from General Transit Feed Specification, thus overcoming difficulties occurring in accessing and collecting data. The proposed method was applied to a real-life PTN in Auckland, New Zealand, with the purpose of examining whether it showed characteristics of scale-free networks and exhibited features of ;small-world; networks. As a result, new regression equations were derived analytically describing observed, strong, non-linear relationships among the probabilities of randomly chosen stops in the PTN to be serviced by a given number of routes. The established dependence is best fitted by an exponential rather than a power-law function, showing that the PTN examined is neither random nor scale-free, but a mixture of the two. This finding explains the presence of hubs that are not typical of exponential networks and simultaneously not highly connected to the other nodes as is the case with scale-free networks. On the other hand, the observed values of the topological properties of the network show that although it is highly clustered, owing to its representation as a directed graph, it differs slightly from ;small-world; networks, which are characterized by strong clustering and a short average path length.

Social networks, time homeless, and social support: A study of men on Skid Row.

PubMed

Green, Harold D; Tucker, Joan S; Golinelli, Daniela; Wenzel, Suzanne L

2013-12-18

Homeless men are frequently unsheltered and isolated, disconnected from supportive organizations and individuals. However, little research has investigated these men's social networks. We investigate the structure and composition of homeless men's social networks, vis-a-vis short- and long-term homelessness with a sample of men drawn randomly from meal lines on Skid Row in Los Angeles. Men continuously homeless for the past six months display networks composed of riskier members when compared to men intermittently homeless during that time. Men who report chronic, long-term homelessness display greater social network fragmentation when compared to non-chronically homeless men. While intermittent homelessness affects network composition in ways that may be addressable with existing interventions, chronic homelessness fragments networks, which may be more difficult to address with those interventions. These findings have implications for access to social support from network members which, in turn, impacts the resources homeless men require from other sources such as the government or NGOs.

Social networks, time homeless, and social support: A study of men on Skid Row

PubMed Central

Green, Harold D.; Tucker, Joan S.; Golinelli, Daniela; Wenzel, Suzanne L.

2014-01-01

Homeless men are frequently unsheltered and isolated, disconnected from supportive organizations and individuals. However, little research has investigated these men’s social networks. We investigate the structure and composition of homeless men’s social networks, vis-a-vis short- and long-term homelessness with a sample of men drawn randomly from meal lines on Skid Row in Los Angeles. Men continuously homeless for the past six months display networks composed of riskier members when compared to men intermittently homeless during that time. Men who report chronic, long-term homelessness display greater social network fragmentation when compared to non-chronically homeless men. While intermittent homelessness affects network composition in ways that may be addressable with existing interventions, chronic homelessness fragments networks, which may be more difficult to address with those interventions. These findings have implications for access to social support from network members which, in turn, impacts the resources homeless men require from other sources such as the government or NGOs. PMID:24466427

A Secure and Efficient Handover Authentication Protocol for Wireless Networks

PubMed Central

Wang, Weijia; Hu, Lei

2014-01-01

Handover authentication protocol is a promising access control technology in the fields of WLANs and mobile wireless sensor networks. In this paper, we firstly review an efficient handover authentication protocol, named PairHand, and its existing security attacks and improvements. Then, we present an improved key recovery attack by using the linearly combining method and reanalyze its feasibility on the improved PairHand protocol. Finally, we present a new handover authentication protocol, which not only achieves the same desirable efficiency features of PairHand, but enjoys the provable security in the random oracle model. PMID:24971471

Protocol for Communication Networking for Formation Flying

NASA Technical Reports Server (NTRS)

Jennings, Esther; Okino, Clayton; Gao, Jay; Clare, Loren

2009-01-01

An application-layer protocol and a network architecture have been proposed for data communications among multiple autonomous spacecraft that are required to fly in a precise formation in order to perform scientific observations. The protocol could also be applied to other autonomous vehicles operating in formation, including robotic aircraft, robotic land vehicles, and robotic underwater vehicles. A group of spacecraft or other vehicles to which the protocol applies could be characterized as a precision-formation- flying (PFF) network, and each vehicle could be characterized as a node in the PFF network. In order to support precise formation flying, it would be necessary to establish a corresponding communication network, through which the vehicles could exchange position and orientation data and formation-control commands. The communication network must enable communication during early phases of a mission, when little positional knowledge is available. Particularly during early mission phases, the distances among vehicles may be so large that communication could be achieved only by relaying across multiple links. The large distances and need for omnidirectional coverage would limit communication links to operation at low bandwidth during these mission phases. Once the vehicles were in formation and distances were shorter, the communication network would be required to provide high-bandwidth, low-jitter service to support tight formation-control loops. The proposed protocol and architecture, intended to satisfy the aforementioned and other requirements, are based on a standard layered-reference-model concept. The proposed application protocol would be used in conjunction with conventional network, data-link, and physical-layer protocols. The proposed protocol includes the ubiquitous Institute of Electrical and Electronics Engineers (IEEE) 802.11 medium access control (MAC) protocol to be used in the datalink layer. In addition to its widespread and proven use in diverse local-area networks, this protocol offers both (1) a random- access mode needed for the early PFF deployment phase and (2) a time-bounded-services mode needed during PFF-maintenance operations. Switching between these two modes could be controlled by upper-layer entities using standard link-management mechanisms. Because the early deployment phase of a PFF mission can be expected to involve multihop relaying to achieve network connectivity (see figure), the proposed protocol includes the open shortest path first (OSPF) network protocol that is commonly used in the Internet. Each spacecraft in a PFF network would be in one of seven distinct states as the mission evolved from initial deployment, through coarse formation, and into precise formation. Reconfiguration of the formation to perform different scientific observations would also cause state changes among the network nodes. The application protocol provides for recognition and tracking of the seven states for each node and for protocol changes under specified conditions to adapt the network and satisfy communication requirements associated with the current PFF mission phase. Except during early deployment, when peer-to-peer random access discovery methods would be used, the application protocol provides for operation in a centralized manner.

A Random Access Algorithm for Frequency Hopped Spread Spectrum Packet Radio Networks

DTIC Science & Technology

1986-03-01

in section 4.3, the probability p is given by the following expression. N rj 1-p - N1 (NR7-1). f -• (20)~ j=o j. F,=ji < N We now present a...Algorithms," Univ. of Connecticut, EECS Dept. Technical Report UCT/ DEECS /TR-86-1, January 1986. Also, submitted for publication. 119] W. Peterson and E

XRootd, disk-based, caching proxy for optimization of data access, data placement and data replication

NASA Astrophysics Data System (ADS)

Bauerdick, L. A. T.; Bloom, K.; Bockelman, B.; Bradley, D. C.; Dasu, S.; Dost, J. M.; Sfiligoi, I.; Tadel, A.; Tadel, M.; Wuerthwein, F.; Yagil, A.; Cms Collaboration

2014-06-01

Following the success of the XRootd-based US CMS data federation, the AAA project investigated extensions of the federation architecture by developing two sample implementations of an XRootd, disk-based, caching proxy. The first one simply starts fetching a whole file as soon as a file open request is received and is suitable when completely random file access is expected or it is already known that a whole file be read. The second implementation supports on-demand downloading of partial files. Extensions to the Hadoop Distributed File System have been developed to allow for an immediate fallback to network access when local HDFS storage fails to provide the requested block. Both cache implementations are in pre-production testing at UCSD.

Modeling and predicting the Spanish Bachillerato academic results over the next few years using a random network model

NASA Astrophysics Data System (ADS)

Cortés, J.-C.; Colmenar, J.-M.; Hidalgo, J.-I.; Sánchez-Sánchez, A.; Santonja, F.-J.; Villanueva, R.-J.

2016-01-01

Academic performance is a concern of paramount importance in Spain, where around of 30 % of the students in the last two courses in high school, before to access to the labor market or to the university, do not achieve the minimum knowledge required according to the Spanish educational law in force. In order to analyze this problem, we propose a random network model to study the dynamics of the academic performance in Spain. Our approach is based on the idea that both, good and bad study habits, are a mixture of personal decisions and influence of classmates. Moreover, in order to consider the uncertainty in the estimation of model parameters, we perform a lot of simulations taking as the model parameters the ones that best fit data returned by the Differential Evolution algorithm. This technique permits to forecast model trends in the next few years using confidence intervals.

A Hybrid Spectral Clustering and Deep Neural Network Ensemble Algorithm for Intrusion Detection in Sensor Networks

PubMed Central

Ma, Tao; Wang, Fen; Cheng, Jianjun; Yu, Yang; Chen, Xiaoyun

2016-01-01

The development of intrusion detection systems (IDS) that are adapted to allow routers and network defence systems to detect malicious network traffic disguised as network protocols or normal access is a critical challenge. This paper proposes a novel approach called SCDNN, which combines spectral clustering (SC) and deep neural network (DNN) algorithms. First, the dataset is divided into k subsets based on sample similarity using cluster centres, as in SC. Next, the distance between data points in a testing set and the training set is measured based on similarity features and is fed into the deep neural network algorithm for intrusion detection. Six KDD-Cup99 and NSL-KDD datasets and a sensor network dataset were employed to test the performance of the model. These experimental results indicate that the SCDNN classifier not only performs better than backpropagation neural network (BPNN), support vector machine (SVM), random forest (RF) and Bayes tree models in detection accuracy and the types of abnormal attacks found. It also provides an effective tool of study and analysis of intrusion detection in large networks. PMID:27754380

A Hybrid Spectral Clustering and Deep Neural Network Ensemble Algorithm for Intrusion Detection in Sensor Networks.

PubMed

Ma, Tao; Wang, Fen; Cheng, Jianjun; Yu, Yang; Chen, Xiaoyun

2016-10-13

The development of intrusion detection systems (IDS) that are adapted to allow routers and network defence systems to detect malicious network traffic disguised as network protocols or normal access is a critical challenge. This paper proposes a novel approach called SCDNN, which combines spectral clustering (SC) and deep neural network (DNN) algorithms. First, the dataset is divided into k subsets based on sample similarity using cluster centres, as in SC. Next, the distance between data points in a testing set and the training set is measured based on similarity features and is fed into the deep neural network algorithm for intrusion detection. Six KDD-Cup99 and NSL-KDD datasets and a sensor network dataset were employed to test the performance of the model. These experimental results indicate that the SCDNN classifier not only performs better than backpropagation neural network (BPNN), support vector machine (SVM), random forest (RF) and Bayes tree models in detection accuracy and the types of abnormal attacks found. It also provides an effective tool of study and analysis of intrusion detection in large networks.

Hybrid computing using a neural network with dynamic external memory.

PubMed

Graves, Alex; Wayne, Greg; Reynolds, Malcolm; Harley, Tim; Danihelka, Ivo; Grabska-Barwińska, Agnieszka; Colmenarejo, Sergio Gómez; Grefenstette, Edward; Ramalho, Tiago; Agapiou, John; Badia, Adrià Puigdomènech; Hermann, Karl Moritz; Zwols, Yori; Ostrovski, Georg; Cain, Adam; King, Helen; Summerfield, Christopher; Blunsom, Phil; Kavukcuoglu, Koray; Hassabis, Demis

2016-10-27

Artificial neural networks are remarkably adept at sensory processing, sequence learning and reinforcement learning, but are limited in their ability to represent variables and data structures and to store data over long timescales, owing to the lack of an external memory. Here we introduce a machine learning model called a differentiable neural computer (DNC), which consists of a neural network that can read from and write to an external memory matrix, analogous to the random-access memory in a conventional computer. Like a conventional computer, it can use its memory to represent and manipulate complex data structures, but, like a neural network, it can learn to do so from data. When trained with supervised learning, we demonstrate that a DNC can successfully answer synthetic questions designed to emulate reasoning and inference problems in natural language. We show that it can learn tasks such as finding the shortest path between specified points and inferring the missing links in randomly generated graphs, and then generalize these tasks to specific graphs such as transport networks and family trees. When trained with reinforcement learning, a DNC can complete a moving blocks puzzle in which changing goals are specified by sequences of symbols. Taken together, our results demonstrate that DNCs have the capacity to solve complex, structured tasks that are inaccessible to neural networks without external read-write memory.

Collision Resolution Scheme with Offset for Improved Performance of Heterogeneous WLAN

NASA Astrophysics Data System (ADS)

Upadhyay, Raksha; Vyavahare, Prakash D.; Tokekar, Sanjiv

2016-03-01

CSMA/CA based DCF of 802.11 MAC layer employs best effort delivery model, in which all stations compete for channel access with same priority. Heterogeneous conditions result in unfairness among stations and degradation in throughput, therefore, providing different priorities to different applications for required quality of service in heterogeneous networks is challenging task. This paper proposes a collision resolution scheme with a novel concept of introducing offset, which is suitable for heterogeneous networks. Selection of random value by a station for its contention with offset results in reduced probability of collision. Expression for the optimum value of the offset is also derived. Results show that proposed scheme, when applied to heterogeneous networks, has improved throughput and fairness than conventional scheme. Results show that proposed scheme also exhibits higher throughput and fairness with reduced delay in homogeneous networks.

Anomalous Anticipatory Responses in Networked Random Data

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

Nelson, Roger D.; Bancel, Peter A.

2006-10-16

We examine an 8-year archive of synchronized, parallel time series of random data from a world spanning network of physical random event generators (REGs). The archive is a publicly accessible matrix of normally distributed 200-bit sums recorded at 1 Hz which extends from August 1998 to the present. The primary question is whether these data show non-random structure associated with major events such as natural or man-made disasters, terrible accidents, or grand celebrations. Secondarily, we examine the time course of apparently correlated responses. Statistical analyses of the data reveal consistent evidence that events which strongly affect people engender small butmore » significant effects. These include suggestions of anticipatory responses in some cases, leading to a series of specialized analyses to assess possible non-random structure preceding precisely timed events. A focused examination of data collected around the time of earthquakes with Richter magnitude 6 and greater reveals non-random structure with a number of intriguing, potentially important features. Anomalous effects in the REG data are seen only when the corresponding earthquakes occur in populated areas. No structure is found if they occur in the oceans. We infer that an important contributor to the effect is the relevance of the earthquake to humans. Epoch averaging reveals evidence for changes in the data some hours prior to the main temblor, suggestive of reverse causation.« less

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

NASA Astrophysics Data System (ADS)

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

2010-01-01

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

Deployment of 802.15.4 Sensor Networks for C4ISR Operations

DTIC Science & Technology

2006-06-01

43 Figure 20.MSP410CA Dense Grid Monitoring (Crossbow User’s Manual, 2005). ....................................44 Figure 21.(a)MICA2 without...Deployment of Sensor Grid (COASTS OPORD, 2006). ...56 Figure 27.Topology View of Two Nodes and Base Station .......57 Figure 28.Nodes Employing Multi...Random Access Memory TCP/IP Transmission Control Protocol/Internet Protocol TinyOS Tiny Micro Threading Operating System UARTs Universal

Non-Orthogonal Random Access in MIMO Cognitive Radio Networks: Beamforming, Power Allocation, and Opportunistic Transmission

PubMed Central

Lin, Huifa; Shin, Won-Yong

2017-01-01

We study secondary random access in multi-input multi-output cognitive radio networks, where a slotted ALOHA-type protocol and successive interference cancellation are used. We first introduce three types of transmit beamforming performed by secondary users, where multiple antennas are used to suppress the interference at the primary base station and/or to increase the received signal power at the secondary base station. Then, we show a simple decentralized power allocation along with the equivalent single-antenna conversion. To exploit the multiuser diversity gain, an opportunistic transmission protocol is proposed, where the secondary users generating less interference are opportunistically selected, resulting in a further reduction of the interference temperature. The proposed methods are validated via computer simulations. Numerical results show that increasing the number of transmit antennas can greatly reduce the interference temperature, while increasing the number of receive antennas leads to a reduction of the total transmit power. Optimal parameter values of the opportunistic transmission protocol are examined according to three types of beamforming and different antenna configurations, in terms of maximizing the cognitive transmission capacity. All the beamforming, decentralized power allocation, and opportunistic transmission protocol are performed by the secondary users in a decentralized manner, thus resulting in an easy implementation in practice. PMID:28076402

Non-Orthogonal Random Access in MIMO Cognitive Radio Networks: Beamforming, Power Allocation, and Opportunistic Transmission.

PubMed

Lin, Huifa; Shin, Won-Yong

2017-01-01

We study secondary random access in multi-input multi-output cognitive radio networks, where a slotted ALOHA-type protocol and successive interference cancellation are used. We first introduce three types of transmit beamforming performed by secondary users, where multiple antennas are used to suppress the interference at the primary base station and/or to increase the received signal power at the secondary base station. Then, we show a simple decentralized power allocation along with the equivalent single-antenna conversion. To exploit the multiuser diversity gain, an opportunistic transmission protocol is proposed, where the secondary users generating less interference are opportunistically selected, resulting in a further reduction of the interference temperature. The proposed methods are validated via computer simulations. Numerical results show that increasing the number of transmit antennas can greatly reduce the interference temperature, while increasing the number of receive antennas leads to a reduction of the total transmit power. Optimal parameter values of the opportunistic transmission protocol are examined according to three types of beamforming and different antenna configurations, in terms of maximizing the cognitive transmission capacity. All the beamforming, decentralized power allocation, and opportunistic transmission protocol are performed by the secondary users in a decentralized manner, thus resulting in an easy implementation in practice.

A GRASS GIS Semi-Stochastic Model for Evaluating the Probability of Landslides Impacting Road Networks in Collazzone, Central Italy

NASA Astrophysics Data System (ADS)

Taylor, Faith E.; Santangelo, Michele; Marchesini, Ivan; Malamud, Bruce D.

2013-04-01

During a landslide triggering event, the tens to thousands of landslides resulting from the trigger (e.g., earthquake, heavy rainfall) may block a number of sections of the road network, posing a risk to rescue efforts, logistics and accessibility to a region. Here, we present initial results from a semi-stochastic model we are developing to evaluate the probability of landslides intersecting a road network and the network-accessibility implications of this across a region. This was performed in the open source GRASS GIS software, where we took 'model' landslides and dropped them on a 79 km2 test area region in Collazzone, Umbria, Central Italy, with a given road network (major and minor roads, 404 km in length) and already determined landslide susceptibilities. Landslide areas (AL) were randomly selected from a three-parameter inverse gamma probability density function, consisting of a power-law decay of about -2.4 for medium and large values of AL and an exponential rollover for small values of AL; the rollover (maximum probability) occurs at about AL = 400 m.2 The number of landslide areas selected for each triggered event iteration was chosen to have an average density of 1 landslide km-2, i.e. 79 landslide areas chosen randomly for each iteration. Landslides were then 'dropped' over the region semi-stochastically: (i) random points were generated across the study region; (ii) based on the landslide susceptibility map, points were accepted/rejected based on the probability of a landslide occurring at that location. After a point was accepted, it was assigned a landslide area (AL) and length to width ratio. Landslide intersections with roads were then assessed and indices such as the location, number and size of road blockage recorded. The GRASS-GIS model was performed 1000 times in a Monte-Carlo type simulation. Initial results show that for a landslide triggering event of 1 landslide km-2 over a 79 km2 region with 404 km of road, the number of road blockages ranges from 6 to 17, resulting in one road blockage every 24-67 km of roads. The average length of road blocked was 33 m. As we progress with model development and more sophisticated network analysis, we believe this semi-stochastic modelling approach will aid civil protection agencies to get a rough idea for the probability of road network potential damage (road block number and extent) as the result of different magnitude landslide triggering event scenarios.

Mortality and operator experience with vascular access for percutaneous coronary intervention in patients with acute coronary syndromes: A pairwise and network meta-analysis of randomized controlled trials.

PubMed

Shah, Rahman; Askari, Reza; Haji, Showkat A; Rashid, Abdul

2017-12-01

Recently, several meta-analyses of randomized controlled trials (RCTs) have shown that transradial access (TRA) reduces mortality compared to transfemoral access (TFA). However, a critical appraisal of these RCTs suggests that the findings could have resulted from a greater incidence of adverse events in the TFA groups rather than a beneficial effect of TRA. Scientific databases and websites were searched for RCTs. Patients were divided into groups based on access type and whether the operator was a radial expert (RE) or non-radial expert (NRE). The groups were TFA-RE, TFA-NRE, TRA-RE, and TRA-NRE. Both a traditional meta-analysis and a network meta-analysis using mixed-treatment comparison models were performed. Data from 13 trials including 15,615 patients were analyzed. The mortality rate for TFA-RE (3.54%) was more than double compared to TFA-NRE (1.61%). In pairwise meta-analysis, TFA-RE was associated with increased risk of mortality (RR: 1.72, 95% CI: 1.13-2.62; p=0.011) compared to TFA-NRE. In subgroup analysis, TFA-RE was associated with increased mortality (RR: 1.70, 95% CI: 1.24-2.34; p=0.001) compared to TRA, but TRA-NRE was not. Similarly, in mixed comparison models, TFA-RE was associated with increased mortality compared to TRA-NRE, TRA-RE, and TFA-NRE, but TFA-NRE was not, compared to TRA-RE and TRA-NRE. Recently-reported survival differences between TRA and TFA may have been driven by adverse events in the TFA groups of the RCTs rather than a beneficial effect of TRA. This issue needs further investigation before labeling radial access a lifesaving procedure in invasively-managed patients with ACS. Published by Elsevier B.V.

Motivation for and use of social networking sites: Comparisons among college students with and without histories of non-suicidal self-injury.

PubMed

Jarvi, Stephanie M; Swenson, Lance P; Batejan, Kristen L

2017-07-01

This research examines potential differences in social network use and motivation for social network use by non-suicidal self-injury (NSSI) status. 367 (73% women; M age = 20.60) college students were recruited in November-December 2011. A random sample of 2,500 students was accessed through a university registrar to recruit students interested in an online survey assessing NSSI and various health-related behaviors. Social network use and motivations for social networks did not differ by NSSI status. Results suggest that it is not patterns of use or motivation to use social networks that could lead to concern about online behavior (i.e., behavior increasing risk of future NSSI) among those with NSSI history. Rather, future preventive and intervention efforts should address the NSSI-related content that is available online, since this is unregulated, often explicit, and commonly includes "pro-NSSI" content that may be problematic and increase risk among vulnerable individuals.

Distributed reservation control protocols for random access broadcasting channels

NASA Technical Reports Server (NTRS)

Greene, E. P.; Ephremides, A.

1981-01-01

Attention is given to a communication network consisting of an arbitrary number of nodes which can communicate with each other via a time-division multiple access (TDMA) broadcast channel. The reported investigation is concerned with the development of efficient distributed multiple access protocols for traffic consisting primarily of single packet messages in a datagram mode of operation. The motivation for the design of the protocols came from the consideration of efficient multiple access utilization of moderate to high bandwidth (4-40 Mbit/s capacity) communication satellite channels used for the transmission of short (1000-10,000 bits) fixed length packets. Under these circumstances, the ratio of roundtrip propagation time to packet transmission time is between 100 to 10,000. It is shown how a TDMA channel can be adaptively shared by datagram traffic and constant bandwidth users such as in digital voice applications. The distributed reservation control protocols described are a hybrid between contention and reservation protocols.

The ASCENT (Allocation System Changes for Equity in Kidney Transplantation) Study: a Randomized Effectiveness-Implementation Study to Improve Kidney Transplant Waitlisting and Reduce Racial Disparity.

PubMed

Patzer, Rachel E; Smith, Kayla; Basu, Mohua; Gander, Jennifer; Mohan, Sumit; Escoffery, Cam; Plantinga, Laura; Melanson, Taylor; Kalloo, Sean; Green, Gary; Berlin, Alex; Renville, Gary; Browne, Teri; Turgeon, Nicole; Caponi, Susan; Zhang, Rebecca; Pastan, Stephen

2017-05-01

The United Network for Organ Sharing (UNOS) implemented a new Kidney Allocation System (KAS) in December 2014 that is expected to substantially reduce racial disparities in kidney transplantation among waitlisted patients. However, not all dialysis facility clinical providers and end stage renal disease (ESRD) patients are aware of how the policy change could improve access to transplant. We describe the ASCENT (Allocation System Changes for Equity in KidNey Transplantation) study, a randomized controlled effectiveness-implementation study designed to test the effectiveness of a multicomponent intervention to improve access to the early steps of kidney transplantation among dialysis facilities across the United States. The multicomponent intervention consists of an educational webinar for dialysis medical directors, an educational video for patients and an educational video for dialysis staff, and a dialysis-facility specific transplant performance feedback report. Materials will be developed by a multidisciplinary dissemination advisory board and will undergo formative testing in dialysis facilities across the United States. This study is estimated to enroll ~600 U.S. dialysis facilities with low waitlisting in all 18 ESRD Networks. The co-primary outcomes include change in waitlisting, and waitlist disparity at 1 year; secondary outcomes include changes in facility medical director knowledge about KAS, staff training regarding KAS, patient education regarding transplant, and a medical director's intent to refer patients for transplant evaluation. The results from the ASCENT study will demonstrate the feasibility and effectiveness of a multicomponent intervention designed to increase access to the deceased-donor kidney waitlist and reduce racial disparities in waitlisting.

A Novel Design of Reconfigurable Wavelength-Time Optical Codes to Enhance Security in Optical CDMA Networks

NASA Astrophysics Data System (ADS)

Nasaruddin; Tsujioka, Tetsuo

An optical CDMA (OCDMA) system is a flexible technology for future broadband multiple access networks. A secure OCDMA network in broadband optical access technologies is also becoming an issue of great importance. In this paper, we propose novel reconfigurable wavelength-time (W-T) optical codes that lead to secure transmission in OCDMA networks. The proposed W-T optical codes are constructed by using quasigroups (QGs) for wavelength hopping and one-dimensional optical orthogonal codes (OOCs) for time spreading; we call them QGs/OOCs. Both QGs and OOCs are randomly generated by a computer search to ensure that an eavesdropper could not improve its interception performance by making use of the coding structure. Then, the proposed reconfigurable QGs/OOCs can provide more codewords, and many different code set patterns, which differ in both wavelength and time positions for given code parameters. Moreover, the bit error probability of the proposed codes is analyzed numerically. To realize the proposed codes, a secure system is proposed by employing reconfigurable encoders/decoders based on array waveguide gratings (AWGs), which allow the users to change their codeword patterns to protect against eavesdropping. Finally, the probability of breaking a certain codeword in the proposed system is evaluated analytically. The results show that the proposed codes and system can provide a large codeword pattern, and decrease the probability of breaking a certain codeword, to enhance OCDMA network security.

Counter-Based Broadcast Scheme Considering Reachability, Network Density, and Energy Efficiency for Wireless Sensor Networks.

PubMed

Jung, Ji-Young; Seo, Dong-Yoon; Lee, Jung-Ryun

2018-01-04

A wireless sensor network (WSN) is emerging as an innovative method for gathering information that will significantly improve the reliability and efficiency of infrastructure systems. Broadcast is a common method to disseminate information in WSNs. A variety of counter-based broadcast schemes have been proposed to mitigate the broadcast-storm problems, using the count threshold value and a random access delay. However, because of the limited propagation of the broadcast-message, there exists a trade-off in a sense that redundant retransmissions of the broadcast-message become low and energy efficiency of a node is enhanced, but reachability become low. Therefore, it is necessary to study an efficient counter-based broadcast scheme that can dynamically adjust the random access delay and count threshold value to ensure high reachability, low redundant of broadcast-messages, and low energy consumption of nodes. Thus, in this paper, we first measure the additional coverage provided by a node that receives the same broadcast-message from two neighbor nodes, in order to achieve high reachability with low redundant retransmissions of broadcast-messages. Second, we propose a new counter-based broadcast scheme considering the size of the additional coverage area, distance between the node and the broadcasting node, remaining battery of the node, and variations of the node density. Finally, we evaluate performance of the proposed scheme compared with the existing counter-based broadcast schemes. Simulation results show that the proposed scheme outperforms the existing schemes in terms of saved rebroadcasts, reachability, and total energy consumption.

47 CFR 51.311 - Nondiscriminatory access to unbundled network elements.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 47 Telecommunication 3 2011-10-01 2011-10-01 false Nondiscriminatory access to unbundled network... § 51.311 Nondiscriminatory access to unbundled network elements. (a) The quality of an unbundled network element, as well as the quality of the access to the unbundled network element, that an incumbent...

47 CFR 51.311 - Nondiscriminatory access to unbundled network elements.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 47 Telecommunication 3 2010-10-01 2010-10-01 false Nondiscriminatory access to unbundled network... § 51.311 Nondiscriminatory access to unbundled network elements. (a) The quality of an unbundled network element, as well as the quality of the access to the unbundled network element, that an incumbent...

Optical Access Networks

NASA Astrophysics Data System (ADS)

Zheng, Jun; Ansari, Nirwan

2005-06-01

Call for Papers: Optical Access Networks With the wide deployment of fiber-optic technology over the past two decades, we have witnessed a tremendous growth of bandwidth capacity in the backbone networks of today's telecommunications infrastructure. However, access networks, which cover the "last-mile" areas and serve numerous residential and small business users, have not been scaled up commensurately. The local subscriber lines for telephone and cable television are still using twisted pairs and coaxial cables. Most residential connections to the Internet are still through dial-up modems operating at a low speed on twisted pairs. As the demand for access bandwidth increases with emerging high-bandwidth applications, such as distance learning, high-definition television (HDTV), and video on demand (VoD), the last-mile access networks have become a bandwidth bottleneck in today's telecommunications infrastructure. To ease this bottleneck, it is imperative to provide sufficient bandwidth capacity in the access networks to open the bottleneck and thus present more opportunities for the provisioning of multiservices. Optical access solutions promise huge bandwidth to service providers and low-cost high-bandwidth services to end users and are therefore widely considered the technology of choice for next-generation access networks. To realize the vision of optical access networks, however, many key issues still need to be addressed, such as network architectures, signaling protocols, and implementation standards. The major challenges lie in the fact that an optical solution must be not only robust, scalable, and flexible, but also implemented at a low cost comparable to that of existing access solutions in order to increase the economic viability of many potential high-bandwidth applications. In recent years, optical access networks have been receiving tremendous attention from both academia and industry. A large number of research activities have been carried out or are now underway this hot area. The purpose of this feature issue is to expose the networking community to the latest research breakthroughs and progresses in the area of optical access networks. This feature issue aims to present a collection of papers that focus on the state-of-the-art research in various networking aspects of optical access networks. Original papers are solicited from all researchers involved in area of optical access networks. Topics of interest include but not limited to: Optical access network architectures and protocols Passive optical networks (BPON, EPON, GPON, etc.) Active optical networks Multiple access control Multiservices and QoS provisioning Network survivability Field trials and standards Performance modeling and analysis

Optical Access Networks

NASA Astrophysics Data System (ADS)

Zheng, Jun; Ansari, Nirwan; Jersey Inst Ansari, New; Jersey Inst, New

2005-04-01

Call for Papers: Optical Access Networks With the wide deployment of fiber-optic technology over the past two decades, we have witnessed a tremendous growth of bandwidth capacity in the backbone networks of today's telecommunications infrastructure. However, access networks, which cover the "last-mile" areas and serve numerous residential and small business users, have not been scaled up commensurately. The local subscriber lines for telephone and cable television are still using twisted pairs and coaxial cables. Most residential connections to the Internet are still through dial-up modems operating at a low speed on twisted pairs. As the demand for access bandwidth increases with emerging high-bandwidth applications, such as distance learning, high-definition television (HDTV), and video on demand (VoD), the last-mile access networks have become a bandwidth bottleneck in today's telecommunications infrastructure. To ease this bottleneck, it is imperative to provide sufficient bandwidth capacity in the access networks to open the bottleneck and thus present more opportunities for the provisioning of multiservices. Optical access solutions promise huge bandwidth to service providers and low-cost high-bandwidth services to end users and are therefore widely considered the technology of choice for next-generation access networks. To realize the vision of optical access networks, however, many key issues still need to be addressed, such as network architectures, signaling protocols, and implementation standards. The major challenges lie in the fact that an optical solution must be not only robust, scalable, and flexible, but also implemented at a low cost comparable to that of existing access solutions in order to increase the economic viability of many potential high-bandwidth applications. In recent years, optical access networks have been receiving tremendous attention from both academia and industry. A large number of research activities have been carried out or are now underway this hot area. The purpose of this feature issue is to expose the networking community to the latest research breakthroughs and progresses in the area of optical access networks. This feature issue aims to present a collection of papers that focus on the state-of-the-art research in various networking aspects of optical access networks. Original papers are solicited from all researchers involved in area of optical access networks. Topics of interest include but not limited to: Optical access network architectures and protocols Passive optical networks (BPON, EPON, GPON, etc.) Active optical networks Multiple access control Multiservices and QoS provisioning Network survivability Field trials and standards Performance modeling and analysis

Optical Access Networks

NASA Astrophysics Data System (ADS)

Zheng, Jun; Ansari, Nirwan

2005-05-01

Call for Papers: Optical Access Networks With the wide deployment of fiber-optic technology over the past two decades, we have witnessed a tremendous growth of bandwidth capacity in the backbone networks of today's telecommunications infrastructure. However, access networks, which cover the "last-mile" areas and serve numerous residential and small business users, have not been scaled up commensurately. The local subscriber lines for telephone and cable television are still using twisted pairs and coaxial cables. Most residential connections to the Internet are still through dial-up modems operating at a low speed on twisted pairs. As the demand for access bandwidth increases with emerging high-bandwidth applications, such as distance learning, high-definition television (HDTV), and video on demand (VoD), the last-mile access networks have become a bandwidth bottleneck in today's telecommunications infrastructure. To ease this bottleneck, it is imperative to provide sufficient bandwidth capacity in the access networks to open the bottleneck and thus present more opportunities for the provisioning of multiservices. Optical access solutions promise huge bandwidth to service providers and low-cost high-bandwidth services to end users and are therefore widely considered the technology of choice for next-generation access networks. To realize the vision of optical access networks, however, many key issues still need to be addressed, such as network architectures, signaling protocols, and implementation standards. The major challenges lie in the fact that an optical solution must be not only robust, scalable, and flexible, but also implemented at a low cost comparable to that of existing access solutions in order to increase the economic viability of many potential high-bandwidth applications. In recent years, optical access networks have been receiving tremendous attention from both academia and industry. A large number of research activities have been carried out or are now underway this hot area. The purpose of this feature issue is to expose the networking community to the latest research breakthroughs and progresses in the area of optical access networks. This feature issue aims to present a collection of papers that focus on the state-of-the-art research in various networking aspects of optical access networks. Original papers are solicited from all researchers involved in area of optical access networks. Topics of interest include but not limited to: Optical access network architectures and protocols Passive optical networks (BPON, EPON, GPON, etc.) Active optical networks Multiple access control Multiservices and QoS provisioning Network survivability Field trials and standards Performance modeling and analysis

Next Generation Access Network Deployment in Croatia: Optical Access Networks and Current IoT/5G Status

NASA Astrophysics Data System (ADS)

Breskovic, Damir; Sikirica, Mladen; Begusic, Dinko

2018-05-01

This paper gives an overview and background of optical access network deployment in Croatia. Optical access network development in Croatia has been put into a global as well as in the European Union context. All the challenges and the driving factors for optical access networks deployment are considered. Optical access network architectures that have been deployed by most of the investors in Croatian telecommunication market are presented, as well as the architectures that are in early phase of deployment. Finally, an overview on current status of mobile networks of the fifth generation and Internet of Things is given.

42 CFR 423.124 - Special rules for out-of-network access to covered Part D drugs at out-of-network pharmacies.

Code of Federal Regulations, 2014 CFR

2014-10-01

... Part D drugs at out-of-network pharmacies. 423.124 Section 423.124 Public Health CENTERS FOR MEDICARE... for out-of-network access to covered Part D drugs at out-of-network pharmacies. (a) Out-of-network access to covered part D drugs—(1) Out-of-network pharmacy access. A Part D sponsor must ensure that Part...

42 CFR 423.124 - Special rules for out-of-network access to covered Part D drugs at out-of-network pharmacies.

Code of Federal Regulations, 2013 CFR

2013-10-01

... Part D drugs at out-of-network pharmacies. 423.124 Section 423.124 Public Health CENTERS FOR MEDICARE... for out-of-network access to covered Part D drugs at out-of-network pharmacies. (a) Out-of-network access to covered part D drugs—(1) Out-of-network pharmacy access. A Part D sponsor must ensure that Part...

42 CFR 423.124 - Special rules for out-of-network access to covered Part D drugs at out-of-network pharmacies.

Code of Federal Regulations, 2012 CFR

2012-10-01

... Part D drugs at out-of-network pharmacies. 423.124 Section 423.124 Public Health CENTERS FOR MEDICARE... for out-of-network access to covered Part D drugs at out-of-network pharmacies. (a) Out-of-network access to covered part D drugs—(1) Out-of-network pharmacy access. A Part D sponsor must ensure that Part...

Case Study: An Ethics Case Study of HIV Prevention Research on Facebook: The Just/Us Study

PubMed Central

Breslin, Lindsey T.; Wright, Erin E.; Black, Sandra R.; Levine, Deborah; Santelli, John S.

2011-01-01

Objective To consider issues related to research with youth on social networking sites online. Methods Description of the data collection process from 1,588 participants in a randomized controlled trial testing the efficacy of HIV prevention education delivered on Facebook. Using respondent-driven sampling, staff-recruited participants are encouraged to recruit up to three friends to enroll in the study. Results Researchers should (a) consider whether an online social networking site is an appropriate place to implement a research study; (b) offer opportunities to review informed consent documents at multiple times and in multiple locations throughout the study; and (c) collect data outside the social networking site and store it behind secure firewalls to ensure it will not be accessible to any person on the social networking site. Conclusions Online social networks are growing in popularity. Conducting research on social media sites requires deliberate attention to consent, confidentiality, and security. PMID:21292724

Research on the effects of wind power grid to the distribution network of Henan province

NASA Astrophysics Data System (ADS)

Liu, Yunfeng; Zhang, Jian

2018-04-01

With the draining of traditional energy, all parts of nation implement policies to develop new energy to generate electricity under the favorable national policy. The wind has no pollution, Renewable and other advantages. It has become the most popular energy among the new energy power generation. The development of wind power in Henan province started relatively late, but the speed of the development is fast. The wind power of Henan province has broad development prospects. Wind power has the characteristics of volatility and randomness. The wind power access to power grids will cause much influence on the power stability and the power quality of distribution network, and some areas have appeared abandon the wind phenomenon. So the study of wind power access to power grids and find out improvement measures is very urgent. Energy storage has the properties of the space transfer energy can stabilize the operation of power grid and improve the power quality.

SiGe epitaxial memory for neuromorphic computing with reproducible high performance based on engineered dislocations

NASA Astrophysics Data System (ADS)

Choi, Shinhyun; Tan, Scott H.; Li, Zefan; Kim, Yunjo; Choi, Chanyeol; Chen, Pai-Yu; Yeon, Hanwool; Yu, Shimeng; Kim, Jeehwan

2018-01-01

Although several types of architecture combining memory cells and transistors have been used to demonstrate artificial synaptic arrays, they usually present limited scalability and high power consumption. Transistor-free analog switching devices may overcome these limitations, yet the typical switching process they rely on—formation of filaments in an amorphous medium—is not easily controlled and hence hampers the spatial and temporal reproducibility of the performance. Here, we demonstrate analog resistive switching devices that possess desired characteristics for neuromorphic computing networks with minimal performance variations using a single-crystalline SiGe layer epitaxially grown on Si as a switching medium. Such epitaxial random access memories utilize threading dislocations in SiGe to confine metal filaments in a defined, one-dimensional channel. This confinement results in drastically enhanced switching uniformity and long retention/high endurance with a high analog on/off ratio. Simulations using the MNIST handwritten recognition data set prove that epitaxial random access memories can operate with an online learning accuracy of 95.1%.

Recent Internet Use and Associations with Clinical Outcomes among Patients Entering Addiction Treatment Involved in a Web-Delivered Psychosocial Intervention Study.

PubMed

Tofighi, B; Campbell, A N C; Pavlicova, M; Hu, M C; Lee, J D; Nunes, E V

2016-10-01

The acceptability and clinical impact of a web-based intervention among patients entering addiction treatment who lack recent internet access are unclear. This secondary analysis of a national multisite treatment study (NIDA Clinical Trials Network-0044) assessed for acceptability and clinical impact of a web-based psychosocial intervention among participants enrolling in community-based, outpatient addiction treatment programs. Participants were randomly assigned to 12 weeks of a web-based therapeutic education system (TES) based on the community reinforcement approach plus contingency management versus treatment as usual (TAU). Demographic and clinical characteristics, and treatment outcomes were compared among participants with recent internet access in the 90 days preceding enrollment (N = 374) and without internet access (N = 133). Primary outcome variables included (1) acceptability of TES (i.e., module completion; acceptability of web-based intervention) and (2) clinical impact (i.e., self-reported abstinence confirmed by urine drug/breath alcohol tests; retention measured as time to dropout). Internet use was common (74 %) and was more likely among younger (18-49 years old) participants and those who completed high school (p < .001). Participants randomized to TES (n = 255) without baseline internet access rated the acceptability of TES modules significantly higher than those with internet access (t = 2.49, df = 218, p = .01). There was a near significant interaction between treatment, baseline abstinence, and internet access on time to dropout (χ 2 (1) = 3.8089, p = .051). TES was associated with better retention among participants not abstinent at baseline who had internet access (X 2 (1) = 6.69, p = .01). These findings demonstrate high acceptability of this web-based intervention among participants that lacked recent internet access.

Cluster-Based Multipolling Sequencing Algorithm for Collecting RFID Data in Wireless LANs

NASA Astrophysics Data System (ADS)

Choi, Woo-Yong; Chatterjee, Mainak

2015-03-01

With the growing use of RFID (Radio Frequency Identification), it is becoming important to devise ways to read RFID tags in real time. Access points (APs) of IEEE 802.11-based wireless Local Area Networks (LANs) are being integrated with RFID networks that can efficiently collect real-time RFID data. Several schemes, such as multipolling methods based on the dynamic search algorithm and random sequencing, have been proposed. However, as the number of RFID readers associated with an AP increases, it becomes difficult for the dynamic search algorithm to derive the multipolling sequence in real time. Though multipolling methods can eliminate the polling overhead, we still need to enhance the performance of the multipolling methods based on random sequencing. To that extent, we propose a real-time cluster-based multipolling sequencing algorithm that drastically eliminates more than 90% of the polling overhead, particularly so when the dynamic search algorithm fails to derive the multipolling sequence in real time.

Search for Directed Networks by Different Random Walk Strategies

NASA Astrophysics Data System (ADS)

Zhu, Zi-Qi; Jin, Xiao-Ling; Huang, Zhi-Long

2012-03-01

A comparative study is carried out on the efficiency of five different random walk strategies searching on directed networks constructed based on several typical complex networks. Due to the difference in search efficiency of the strategies rooted in network clustering, the clustering coefficient in a random walker's eye on directed networks is defined and computed to be half of the corresponding undirected networks. The search processes are performed on the directed networks based on Erdös—Rényi model, Watts—Strogatz model, Barabási—Albert model and clustered scale-free network model. It is found that self-avoiding random walk strategy is the best search strategy for such directed networks. Compared to unrestricted random walk strategy, path-iteration-avoiding random walks can also make the search process much more efficient. However, no-triangle-loop and no-quadrangle-loop random walks do not improve the search efficiency as expected, which is different from those on undirected networks since the clustering coefficient of directed networks are smaller than that of undirected networks.

Optical Access Networks

NASA Astrophysics Data System (ADS)

Zheng, Jun; Ansari, Nirwan

2005-03-01

Call for Papers: Optical Access Networks With the wide deployment of fiber-optic technology over the past two decades, we have witnessed a tremendous growth of bandwidth capacity in the backbone networks of today's telecommunications infrastructure. However, access networks, which cover the "last-mile" areas and serve numerous residential and small business users, have not been scaled up commensurately. The local subscriber lines for telephone and cable television are still using twisted pairs and coaxial cables. Most residential connections to the Internet are still through dial-up modems operating at a low speed on twisted pairs. As the demand for access bandwidth increases with emerging high-bandwidth applications, such as distance learning, high-definition television (HDTV), and video on demand (VoD), the last-mile access networks have become a bandwidth bottleneck in today's telecommunications infrastructure. To ease this bottleneck, it is imperative to provide sufficient bandwidth capacity in the access networks to open the bottleneck and thus present more opportunities for the provisioning of multiservices. Optical access solutions promise huge bandwidth to service providers and low-cost high-bandwidth services to end users and are therefore widely considered the technology of choice for next-generation access networks. To realize the vision of optical access networks, however, many key issues still need to be addressed, such as network architectures, signaling protocols, and implementation standards. The major challenges lie in the fact that an optical solution must be not only robust, scalable, and flexible, but also implemented at a low cost comparable to that of existing access solutions in order to increase the economic viability of many potential high-bandwidth applications. In recent years, optical access networks have been receiving tremendous attention from both academia and industry. A large number of research activities have been carried out or are now underway this hot area. The purpose of this feature issue is to expose the networking community to the latest research breakthroughs and progresses in the area of optical access networks. This feature issue aims to present a collection of papers that focus on the state-of-the-art research in various networking aspects of optical access networks. Original papers are solicited from all researchers involved in area of optical access networks. Topics of interest include but not limited to:

RACOON: a multiuser QoS design for mobile wireless body area networks.

PubMed

Cheng, Shihheng; Huang, Chingyao; Tu, Chun Chen

2011-10-01

In this study, Random Contention-based Resource Allocation (RACOON) medium access control (MAC) protocol is proposed to support the quality of service (QoS) for multi-user mobile wireless body area networks (WBANs). Different from existing QoS designs that focus on a single WBAN, a multiuser WBAN QoS should further consider both inter-WBAN interference and inter-WBAN priorities. Similar problems have been studied in both overlapped wireless local area networks (WLANs) and Bluetooth piconets that need QoS supports. However, these solutions are designed for non-medical transmissions that do not consider any priority scheme for medical applications. Most importantly, these studies focus on only static or low mobility networks. Network mobility of WBANs will introduce unnecessary inter-network collisions and energy waste, which are not considered by these solutions. The proposed multiuser-QoS protocol, RACOON, simultaneously satisfies the inter WBAN QoS requirements and overcomes the performance degradation caused by WBAN mobility. Simulation results verify that RACOON provides better latency and energy control, as compared with WBAN QoS protocols without considering the inter-WBAN requirements.

Optical Access Networks

NASA Astrophysics Data System (ADS)

Zheng, Jun; Ansari, Nirwan

2005-01-01

Call for Papers: Optical Access Networks

Guest Editors Jun Zheng, University of Ottawa Nirwan Ansari, New Jersey Institute of Technology

Submission Deadline: 1 June 2005

Background

Scope of Contributions

• Optical access network architectures and protocols
• Passive optical networks (BPON, EPON, GPON, etc.)
• Active optical networks
• Multiple access control
• Multiservices and QoS provisioning
• Network survivability
• Field trials and standards
• Performance modeling and analysis

Manuscript Submission

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.

76 FR 73676 - Certain Dynamic Random Access Memory Devices, and Products Containing Same; Receipt of Complaint...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-11-29

... INTERNATIONAL TRADE COMMISSION [DN 2859] Certain Dynamic Random Access Memory Devices, and.... International Trade Commission has received a complaint entitled In Re Certain Dynamic Random Access Memory... certain dynamic random access memory devices, and products containing same. The complaint names Elpida...

75 FR 16507 - In the Matter of Certain Semiconductor Chips Having Synchronous Dynamic Random Access Memory...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-04-01

... Semiconductor Chips Having Synchronous Dynamic Random Access Memory Controllers and Products Containing Same... synchronous dynamic random access memory controllers and products containing same by reason of infringement of... semiconductor chips having synchronous dynamic random access memory controllers and products containing same...

Optical Access Networks

NASA Astrophysics Data System (ADS)

Zheng, Jun; Ansari, Nirwan

2005-02-01

Call for Papers: Optical Access Networks With the wide deployment of fiber-optic technology over the past two decades, we have witnessed a tremendous growth of bandwidth capacity in the backbone networks of today's telecommunications infrastructure. However, access networks, which cover the "last-mile" areas and serve numerous residential and small business users, have not been scaled up commensurately. The local subscriber lines for telephone and cable television are still using twisted pairs and coaxial cables. Most residential connections to the Internet are still through dial-up modems operating at a low speed on twisted pairs. As the demand for access bandwidth increases with emerging high-bandwidth applications, such as distance learning, high-definition television (HDTV), and video on demand (VoD), the last-mile access networks have become a bandwidth bottleneck in today's telecommunications infrastructure. To ease this bottleneck, it is imperative to provide sufficient bandwidth capacity in the access networks to open the bottleneck and thus present more opportunities for the provisioning of multiservices. Optical access solutions promise huge bandwidth to service providers and low-cost high-bandwidth services to end users and are therefore widely considered the technology of choice for next-generation access networks. To realize the vision of optical access networks, however, many key issues still need to be addressed, such as network architectures, signaling protocols, and implementation standards. The major challenges lie in the fact that an optical solution must be not only robust, scalable, and flexible, but also implemented at a low cost comparable to that of existing access solutions in order to increase the economic viability of many potential high-bandwidth applications. In recent years, optical access networks have been receiving tremendous attention from both academia and industry. A large number of research activities have been carried out or are now underway this hot area. The purpose of this feature issue is to expose the networking community to the latest research breakthroughs and progresses in the area of optical access networks.

An All-Optical Access Metro Interface for Hybrid WDM/TDM PON Based on OBS

NASA Astrophysics Data System (ADS)

Segarra, Josep; Sales, Vicent; Prat, Josep

2007-04-01

A new all-optical access metro network interface based on optical burst switching (OBS) is proposed. A hybrid wavelength-division multiplexing/time-division multiplexing (WDM/TDM) access architecture with reflective optical network units (ONUs), an arrayed-waveguide-grating outside plant, and a tunable laser stack at the optical line terminal (OLT) is presented as a solution for the passive optical network. By means of OBS and a dynamic bandwidth allocation (DBA) protocol, which polls the ONUs, the available access bandwidth is managed. All the network intelligence and costly equipment is located at the OLT, where the DBA module is centrally implemented, providing quality of service (QoS). To scale this access network, an optical cross connect (OXC) is then used to attain a large number of ONUs by the same OLT. The hybrid WDM/TDM structure is also extended toward the metropolitan area network (MAN) by introducing the concept of OBS multiplexer (OBS-M). The network element OBS-M bridges the MAN and access networks by offering all-optical cross connection, wavelength conversion, and data signaling. The proposed innovative OBS-M node yields a full optical data network, interfacing access and metro with a geographically distributed access control. The resulting novel access metro architectures are nonblocking and, with an improved signaling, provide QoS, scalability, and very low latency. Finally, numerical analysis and simulations demonstrate the traffic performance of the proposed access scheme and all-optical access metro interface and architectures.

Scalable Lunar Surface Networks and Adaptive Orbit Access

NASA Technical Reports Server (NTRS)

Wang, Xudong

2015-01-01

Teranovi Technologies, Inc., has developed innovative network architecture, protocols, and algorithms for both lunar surface and orbit access networks. A key component of the overall architecture is a medium access control (MAC) protocol that includes a novel mechanism of overlaying time division multiple access (TDMA) and carrier sense multiple access with collision avoidance (CSMA/CA), ensuring scalable throughput and quality of service. The new MAC protocol is compatible with legacy Institute of Electrical and Electronics Engineers (IEEE) 802.11 networks. Advanced features include efficiency power management, adaptive channel width adjustment, and error control capability. A hybrid routing protocol combines the advantages of ad hoc on-demand distance vector (AODV) routing and disruption/delay-tolerant network (DTN) routing. Performance is significantly better than AODV or DTN and will be particularly effective for wireless networks with intermittent links, such as lunar and planetary surface networks and orbit access networks.

Evaluating IAIMS at Yale: information access.

PubMed

Grajek, S E; Calarco, P; Frawley, S J; McKay, J; Miller, P L; Paton, J A; Roderer, N K; Sullivan, J E

1997-01-01

To evaluate use of information resources during the first year of IAIMS implementation at the Yale-New Haven Medical Center. The evaluation asked: (1) Which information resources are being used? (2) Who uses information resources? (3) Where are information resources used? (4) Are multiple sources of information being integrated? Measures included monthly usage data for resources delivered network-wide, in the Medical Library, and in the Hospital; online surveys of library workstation users; an annual survey of a random, stratified sample of Medical Center faculty, postdoctoral trainees, students, nurses, residents, and managerial and professional staff; and user comments. Eighty-three percent of the Medical Center community use networked information resources, and use of resources is increasing. Both status (faculty, student, nurse, etc.) and mission (teaching, research, patient care) affect use of individual resources. Eighty-eight percent of people use computers in more than one location, and increases in usage of traditional library resources such as MEDLINE are due to increased access from outside the Library. Both survey and usage data suggest that people are using multiple resources during the same information seeking session. Almost all of the Medical Center community is using networked information resources in more settings. It is necessary to support increased demand for information access from remote locations and to specific populations, such as nurses. People are integrating information from multiple sources, but true integration within information systems is just beginning. Other institutions are advised to incorporate pragmatic evaluation into their IAIMS activities and to share evaluation results with decision-makers.

Adaptive random walks on the class of Web graphs

NASA Astrophysics Data System (ADS)

Tadić, B.

2001-09-01

We study random walk with adaptive move strategies on a class of directed graphs with variable wiring diagram. The graphs are grown from the evolution rules compatible with the dynamics of the world-wide Web [B. Tadić, Physica A 293, 273 (2001)], and are characterized by a pair of power-law distributions of out- and in-degree for each value of the parameter β, which measures the degree of rewiring in the graph. The walker adapts its move strategy according to locally available information both on out-degree of the visited node and in-degree of target node. A standard random walk, on the other hand, uses the out-degree only. We compute the distribution of connected subgraphs visited by an ensemble of walkers, the average access time and survival probability of the walks. We discuss these properties of the walk dynamics relative to the changes in the global graph structure when the control parameter β is varied. For β≥ 3, corresponding to the world-wide Web, the access time of the walk to a given level of hierarchy on the graph is much shorter compared to the standard random walk on the same graph. By reducing the amount of rewiring towards rigidity limit β↦βc≲ 0.1, corresponding to the range of naturally occurring biochemical networks, the survival probability of adaptive and standard random walk become increasingly similar. The adaptive random walk can be used as an efficient message-passing algorithm on this class of graphs for large degree of rewiring.

IEEE International Symposium Information Theory, held at Santa Monica California, February 9-12, 1981.

DTIC Science & Technology

1981-01-01

Channel and study permutation codes as a special case. ,uch a code is generated by an initial vector x, a group G of orthogonal n by n matrices, and a...random-access components, is introduced and studied . Under this scheme, the network stations are divided into groups , each of which is assigned a...IEEE INFORMATION THEORY GROUP CO-SPONSORED BY: UNION RADIO SCIENTIFIQUE INTERNATIONALE IEEE Catalog Number 81 CH 1609-7 IT 𔃻. 81 ~20 04Q SECURITY

76 FR 80964 - Certain Dynamic Random Access Memory Devices, and Products Containing Same; Institution of...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-12-27

... INTERNATIONAL TRADE COMMISSION [Investigation No. 337-TA-821] Certain Dynamic Random Access Memory... importation, and the sale within the United States after importation of certain dynamic random access memory... certain dynamic random access memory devices, and products containing same that infringe one or more of...

Packet communications in satellites with multiple-beam antennas and signal processing

NASA Technical Reports Server (NTRS)

Davies, R.; Chethik, F.; Penick, M.

1980-01-01

A communication satellite with a multiple-beam antenna and onboard signal processing is considered for use in a 'message-switched' data relay system. The signal processor may incorporate demodulation, routing, storage, and remodulation of the data. A system user model is established and key functional elements for the signal processing are identified. With the throughput and delay requirements as the controlled variables, the hardware complexity, operational discipline, occupied bandwidth, and overall user end-to-end cost are estimated for (1) random-access packet switching; and (2) reservation-access packet switching. Other aspects of this network (eg, the adaptability to channel switched traffic requirements) are examined. For the given requirements and constraints, the reservation system appears to be the most attractive protocol.

Implementation of a Cross-Layer Sensing Medium-Access Control Scheme.

PubMed

Su, Yishan; Fu, Xiaomei; Han, Guangyao; Xu, Naishen; Jin, Zhigang

2017-04-10

In this paper, compressed sensing (CS) theory is utilized in a medium-access control (MAC) scheme for wireless sensor networks (WSNs). We propose a new, cross-layer compressed sensing medium-access control (CL CS-MAC) scheme, combining the physical layer and data link layer, where the wireless transmission in physical layer is considered as a compress process of requested packets in a data link layer according to compressed sensing (CS) theory. We first introduced using compressive complex requests to identify the exact active sensor nodes, which makes the scheme more efficient. Moreover, because the reconstruction process is executed in a complex field of a physical layer, where no bit and frame synchronizations are needed, the asynchronous and random requests scheme can be implemented without synchronization payload. We set up a testbed based on software-defined radio (SDR) to implement the proposed CL CS-MAC scheme practically and to demonstrate the validation. For large-scale WSNs, the simulation results show that the proposed CL CS-MAC scheme provides higher throughput and robustness than the carrier sense multiple access (CSMA) and compressed sensing medium-access control (CS-MAC) schemes.

Untangling complex networks: risk minimization in financial markets through accessible spin glass ground states

PubMed Central

Lisewski, Andreas Martin; Lichtarge, Olivier

2010-01-01

Recurrent international financial crises inflict significant damage to societies and stress the need for mechanisms or strategies to control risk and tamper market uncertainties. Unfortunately, the complex network of market interactions often confounds rational approaches to optimize financial risks. Here we show that investors can overcome this complexity and globally minimize risk in portfolio models for any given expected return, provided the relative margin requirement remains below a critical, empirically measurable value. In practice, for markets with centrally regulated margin requirements, a rational stabilization strategy would be keeping margins small enough. This result follows from ground states of the random field spin glass Ising model that can be calculated exactly through convex optimization when relative spin coupling is limited by the norm of the network's Laplacian matrix. In that regime, this novel approach is robust to noise in empirical data and may be also broadly relevant to complex networks with frustrated interactions that are studied throughout scientific fields. PMID:20625477

Mass storage technology in networks

NASA Astrophysics Data System (ADS)

Ishii, Katsunori; Takeda, Toru; Itao, Kiyoshi; Kaneko, Reizo

1990-08-01

Trends and features of mass storage subsystems in network are surveyed and their key technologies spotlighted. Storage subsystems are becoming increasingly important in new network systems in which communications and data processing are systematically combined. These systems require a new class of high-performance mass-information storage in order to effectively utilize their processing power. The requirements of high transfer rates, high transactional rates and large storage capacities, coupled with high functionality, fault tolerance and flexibility in configuration, are major challenges in storage subsystems. Recent progress in optical disk technology has resulted in improved performance of on-line external memories to optical disk drives, which are competing with mid-range magnetic disks. Optical disks are more effective than magnetic disks in using low-traffic random-access file storing multimedia data that requires large capacity, such as in archive use and in information distribution use by ROM disks. Finally, it demonstrates image coded document file servers for local area network use that employ 130mm rewritable magneto-optical disk subsystems.

Untangling complex networks: risk minimization in financial markets through accessible spin glass ground states.

PubMed

Lisewski, Andreas Martin; Lichtarge, Olivier

2010-08-15

Recurrent international financial crises inflict significant damage to societies and stress the need for mechanisms or strategies to control risk and tamper market uncertainties. Unfortunately, the complex network of market interactions often confounds rational approaches to optimize financial risks. Here we show that investors can overcome this complexity and globally minimize risk in portfolio models for any given expected return, provided the relative margin requirement remains below a critical, empirically measurable value. In practice, for markets with centrally regulated margin requirements, a rational stabilization strategy would be keeping margins small enough. This result follows from ground states of the random field spin glass Ising model that can be calculated exactly through convex optimization when relative spin coupling is limited by the norm of the network's Laplacian matrix. In that regime, this novel approach is robust to noise in empirical data and may be also broadly relevant to complex networks with frustrated interactions that are studied throughout scientific fields.

Percolation of localized attack on isolated and interdependent random networks

NASA Astrophysics Data System (ADS)

Shao, Shuai; Huang, Xuqing; Stanley, H. Eugene; Havlin, Shlomo

2014-03-01

Percolation properties of isolated and interdependent random networks have been investigated extensively. The focus of these studies has been on random attacks where each node in network is attacked with the same probability or targeted attack where each node is attacked with a probability being a function of its centrality, such as degree. Here we discuss a new type of realistic attacks which we call a localized attack where a group of neighboring nodes in the networks are attacked. We attack a randomly chosen node, its neighbors, and its neighbor of neighbors and so on, until removing a fraction (1 - p) of the network. This type of attack reflects damages due to localized disasters, such as earthquakes, floods and war zones in real-world networks. We study, both analytically and by simulations the impact of localized attack on percolation properties of random networks with arbitrary degree distributions and discuss in detail random regular (RR) networks, Erdős-Rényi (ER) networks and scale-free (SF) networks. We extend and generalize our theoretical and simulation results of single isolated networks to networks formed of interdependent networks.

LTER network data access policy revision: report and recommendations.

Treesearch

James Brunt; Peter McCartney; Stuart Gage; Don Henshaw

2004-01-01

This document is a report on work carried out to update the LTER Network Data Access Policy. The current LTER Network Data Access Policy, approved by the coordinating committee in 1997, has been in use since 1990. An analysis of the current policies related to the release, access, and use of LTER data has been undertaken by a sub-committee of the LTER Network...

Quantifying randomness in real networks

NASA Astrophysics Data System (ADS)

Orsini, Chiara; Dankulov, Marija M.; Colomer-de-Simón, Pol; Jamakovic, Almerima; Mahadevan, Priya; Vahdat, Amin; Bassler, Kevin E.; Toroczkai, Zoltán; Boguñá, Marián; Caldarelli, Guido; Fortunato, Santo; Krioukov, Dmitri

2015-10-01

Represented as graphs, real networks are intricate combinations of order and disorder. Fixing some of the structural properties of network models to their values observed in real networks, many other properties appear as statistical consequences of these fixed observables, plus randomness in other respects. Here we employ the dk-series, a complete set of basic characteristics of the network structure, to study the statistical dependencies between different network properties. We consider six real networks--the Internet, US airport network, human protein interactions, technosocial web of trust, English word network, and an fMRI map of the human brain--and find that many important local and global structural properties of these networks are closely reproduced by dk-random graphs whose degree distributions, degree correlations and clustering are as in the corresponding real network. We discuss important conceptual, methodological, and practical implications of this evaluation of network randomness, and release software to generate dk-random graphs.

User Access Management Based on Network Pricing for Social Network Applications

PubMed Central

Ma, Xingmin; Gu, Qing

2018-01-01

Social applications play a very important role in people’s lives, as users communicate with each other through social networks on a daily basis. This presents a challenge: How does one receive high-quality service from social networks at a low cost? Users can access different kinds of wireless networks from various locations. This paper proposes a user access management strategy based on network pricing such that networks can increase its income and improve service quality. Firstly, network price is treated as an optimizing access parameter, and an unascertained membership algorithm is used to make pricing decisions. Secondly, network price is adjusted dynamically in real time according to network load. Finally, selecting a network is managed and controlled in terms of the market economy. Simulation results show that the proposed scheme can effectively balance network load, reduce network congestion, improve the user's quality of service (QoS) requirements, and increase the network’s income. PMID:29495252

Synchronization in Random Pulse Oscillator Networks

NASA Astrophysics Data System (ADS)

Brown, Kevin; Hermundstad, Ann

Motivated by synchronization phenomena in neural systems, we study synchronization of random networks of coupled pulse oscillators. We begin by considering binomial random networks whose nodes have intrinsic linear dynamics. We quantify order in the network spiking dynamics using a new measure: the normalized Lev-Zimpel complexity (LZC) of the nodes' spike trains. Starting from a globally-synchronized state, we see two broad classes of behaviors. In one (''temporally random''), the LZC is high and nodes spike independently with no coherent pattern. In another (''temporally regular''), the network does not globally synchronize but instead forms coherent, repeating population firing patterns with low LZC. No topological feature of the network reliably predicts whether an individual network will show temporally random or regular behavior; however, we find evidence that degree heterogeneity in binomial networks has a strong effect on the resulting state. To confirm these findings, we generate random networks with independently-adjustable degree mean and variance. We find that the likelihood of temporally-random behavior increases as degree variance increases. Our results indicate the subtle and complex relationship between network structure and dynamics.

47 CFR 51.311 - Nondiscriminatory access to unbundled network elements.

Code of Federal Regulations, 2013 CFR

2013-10-01

... elements. 51.311 Section 51.311 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) COMMON... § 51.311 Nondiscriminatory access to unbundled network elements. (a) The quality of an unbundled network element, as well as the quality of the access to the unbundled network element, that an incumbent...

47 CFR 51.311 - Nondiscriminatory access to unbundled network elements.

Code of Federal Regulations, 2012 CFR

2012-10-01

... elements. 51.311 Section 51.311 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) COMMON... § 51.311 Nondiscriminatory access to unbundled network elements. (a) The quality of an unbundled network element, as well as the quality of the access to the unbundled network element, that an incumbent...

47 CFR 51.311 - Nondiscriminatory access to unbundled network elements.

Code of Federal Regulations, 2014 CFR

2014-10-01

... elements. 51.311 Section 51.311 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) COMMON... § 51.311 Nondiscriminatory access to unbundled network elements. (a) The quality of an unbundled network element, as well as the quality of the access to the unbundled network element, that an incumbent...

Solution-Processed Carbon Nanotube True Random Number Generator.

PubMed

Gaviria Rojas, William A; McMorrow, Julian J; Geier, Michael L; Tang, Qianying; Kim, Chris H; Marks, Tobin J; Hersam, Mark C

2017-08-09

With the growing adoption of interconnected electronic devices in consumer and industrial applications, there is an increasing demand for robust security protocols when transmitting and receiving sensitive data. Toward this end, hardware true random number generators (TRNGs), commonly used to create encryption keys, offer significant advantages over software pseudorandom number generators. However, the vast network of devices and sensors envisioned for the "Internet of Things" will require small, low-cost, and mechanically flexible TRNGs with low computational complexity. These rigorous constraints position solution-processed semiconducting single-walled carbon nanotubes (SWCNTs) as leading candidates for next-generation security devices. Here, we demonstrate the first TRNG using static random access memory (SRAM) cells based on solution-processed SWCNTs that digitize thermal noise to generate random bits. This bit generation strategy can be readily implemented in hardware with minimal transistor and computational overhead, resulting in an output stream that passes standardized statistical tests for randomness. By using solution-processed semiconducting SWCNTs in a low-power, complementary architecture to achieve TRNG, we demonstrate a promising approach for improving the security of printable and flexible electronics.

Graph Theoretic and Motif Analyses of the Hippocampal Neuron Type Potential Connectome.

PubMed

Rees, Christopher L; Wheeler, Diek W; Hamilton, David J; White, Charise M; Komendantov, Alexander O; Ascoli, Giorgio A

2016-01-01

We computed the potential connectivity map of all known neuron types in the rodent hippocampal formation by supplementing scantly available synaptic data with spatial distributions of axons and dendrites from the open-access knowledge base Hippocampome.org. The network that results from this endeavor, the broadest and most complete for a mammalian cortical region at the neuron-type level to date, contains more than 3200 connections among 122 neuron types across six subregions. Analyses of these data using graph theory metrics unveil the fundamental architectural principles of the hippocampal circuit. Globally, we identify a highly specialized topology minimizing communication cost; a modular structure underscoring the prominence of the trisynaptic loop; a core set of neuron types serving as information-processing hubs as well as a distinct group of particular antihub neurons; a nested, two-tier rich club managing much of the network traffic; and an innate resilience to random perturbations. At the local level, we uncover the basic building blocks, or connectivity patterns, that combine to produce complex global functionality, and we benchmark their utilization in the circuit relative to random networks. Taken together, these results provide a comprehensive connectivity profile of the hippocampus, yielding novel insights on its functional operations at the computationally crucial level of neuron types.

Evolutionary-Optimized Photonic Network Structure in White Beetle Wing Scales.

PubMed

Wilts, Bodo D; Sheng, Xiaoyuan; Holler, Mirko; Diaz, Ana; Guizar-Sicairos, Manuel; Raabe, Jörg; Hoppe, Robert; Liu, Shu-Hao; Langford, Richard; Onelli, Olimpia D; Chen, Duyu; Torquato, Salvatore; Steiner, Ullrich; Schroer, Christian G; Vignolini, Silvia; Sepe, Alessandro

2018-05-01

Most studies of structural color in nature concern periodic arrays, which through the interference of light create color. The "color" white however relies on the multiple scattering of light within a randomly structured medium, which randomizes the direction and phase of incident light. Opaque white materials therefore must be much thicker than periodic structures. It is known that flying insects create "white" in extremely thin layers. This raises the question, whether evolution has optimized the wing scale morphology for white reflection at a minimum material use. This hypothesis is difficult to prove, since this requires the detailed knowledge of the scattering morphology combined with a suitable theoretical model. Here, a cryoptychographic X-ray tomography method is employed to obtain a full 3D structural dataset of the network morphology within a white beetle wing scale. By digitally manipulating this 3D representation, this study demonstrates that this morphology indeed provides the highest white retroreflection at the minimum use of material, and hence weight for the organism. Changing any of the network parameters (within the parameter space accessible by biological materials) either increases the weight, increases the thickness, or reduces reflectivity, providing clear evidence for the evolutionary optimization of this morphology. © 2017 The Authors. Published by WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Design mobile satellite system architecture as an integral part of the cellular access digital network

NASA Technical Reports Server (NTRS)

Chien, E. S. K.; Marinho, J. A.; Russell, J. E., Sr.

1988-01-01

The Cellular Access Digital Network (CADN) is the access vehicle through which cellular technology is brought into the mainstream of the evolving integrated telecommunications network. Beyond the integrated end-to-end digital access and per call network services provisioning of the Integrated Services Digital Network (ISDN), the CADN engenders the added capability of mobility freedom via wireless access. One key element of the CADN network architecture is the standard user to network interface that is independent of RF transmission technology. Since the Mobile Satellite System (MSS) is envisioned to not only complement but also enhance the capabilities of the terrestrial cellular telecommunications network, compatibility and interoperability between terrestrial cellular and mobile satellite systems are vitally important to provide an integrated moving telecommunications network of the future. From a network standpoint, there exist very strong commonalities between the terrestrial cellular system and the mobile satellite system. Therefore, the MSS architecture should be designed as an integral part of the CADN. This paper describes the concept of the CADN, the functional architecture of the MSS, and the user-network interface signaling protocols.

Relation between random walks and quantum walks

NASA Astrophysics Data System (ADS)

Boettcher, Stefan; Falkner, Stefan; Portugal, Renato

2015-05-01

Based on studies of four specific networks, we conjecture a general relation between the walk dimensions dw of discrete-time random walks and quantum walks with the (self-inverse) Grover coin. In each case, we find that dw of the quantum walk takes on exactly half the value found for the classical random walk on the same geometry. Since walks on homogeneous lattices satisfy this relation trivially, our results for heterogeneous networks suggest that such a relation holds irrespective of whether translational invariance is maintained or not. To develop our results, we extend the renormalization-group analysis (RG) of the stochastic master equation to one with a unitary propagator. As in the classical case, the solution ρ (x ,t ) in space and time of this quantum-walk equation exhibits a scaling collapse for a variable xdw/t in the weak limit, which defines dw and illuminates fundamental aspects of the walk dynamics, e.g., its mean-square displacement. We confirm the collapse for ρ (x ,t ) in each case with extensive numerical simulation. The exact values for dw themselves demonstrate that RG is a powerful complementary approach to study the asymptotics of quantum walks that weak-limit theorems have not been able to access, such as for systems lacking translational symmetries beyond simple trees.

A study of topologies and protocols for fiber optic local area network

NASA Technical Reports Server (NTRS)

Yeh, C.; Gerla, M.; Rodrigues, P.

1985-01-01

The emergence of new applications requiring high data traffic necessitates the development of high speed local area networks. Optical fiber is selected as the transmission medium due to its inherent advantages over other possible media and the dual optical bus architecture is shown to be the most suitable topology. Asynchronous access protocols, including token, random, hybrid random/token, and virtual token schemes, are developed and analyzed. Exact expressions for insertion delay and utilization at light and heavy load are derived, and intermediate load behavior is investigated by simulation. A new tokenless adaptive scheme whose control depends only on the detection of activity on the channel is shown to outperform round-robin schemes under uneven loads and multipacket traffic and to perform optimally at light load. An approximate solution to the queueing delay for an oscillating polling scheme under chaining is obtained and results are compared with simulation. Solutions to the problem of building systems with a large number of stations are presented, including maximization of the number of optical couplers, and the use of passive star/bus topologies, bridges and gateways.

47 CFR 51.307 - Duty to provide access on an unbundled basis to network elements.

Code of Federal Regulations, 2010 CFR

2010-10-01

... network elements. 51.307 Section 51.307 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED... Carriers § 51.307 Duty to provide access on an unbundled basis to network elements. (a) An incumbent LEC... service, nondiscriminatory access to network elements on an unbundled basis at any technically feasible...

47 CFR 51.307 - Duty to provide access on an unbundled basis to network elements.

Code of Federal Regulations, 2011 CFR

2011-10-01

... network elements. 51.307 Section 51.307 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED... Carriers § 51.307 Duty to provide access on an unbundled basis to network elements. (a) An incumbent LEC... service, nondiscriminatory access to network elements on an unbundled basis at any technically feasible...

Cross over of recurrence networks to random graphs and random geometric graphs

NASA Astrophysics Data System (ADS)

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

2017-02-01

Recurrence networks are complex networks constructed from the time series of chaotic dynamical systems where the connection between two nodes is limited by the recurrence threshold. This condition makes the topology of every recurrence network unique with the degree distribution determined by the probability density variations of the representative attractor from which it is constructed. Here we numerically investigate the properties of recurrence networks from standard low-dimensional chaotic attractors using some basic network measures and show how the recurrence networks are different from random and scale-free networks. In particular, we show that all recurrence networks can cross over to random geometric graphs by adding sufficient amount of noise to the time series and into the classical random graphs by increasing the range of interaction to the system size. We also highlight the effectiveness of a combined plot of characteristic path length and clustering coefficient in capturing the small changes in the network characteristics.

Testing the structure of earthquake networks from multivariate time series of successive main shocks in Greece

NASA Astrophysics Data System (ADS)

Chorozoglou, D.; Kugiumtzis, D.; Papadimitriou, E.

2018-06-01

The seismic hazard assessment in the area of Greece is attempted by studying the earthquake network structure, such as small-world and random. In this network, a node represents a seismic zone in the study area and a connection between two nodes is given by the correlation of the seismic activity of two zones. To investigate the network structure, and particularly the small-world property, the earthquake correlation network is compared with randomized ones. Simulations on multivariate time series of different length and number of variables show that for the construction of randomized networks the method randomizing the time series performs better than methods randomizing directly the original network connections. Based on the appropriate randomization method, the network approach is applied to time series of earthquakes that occurred between main shocks in the territory of Greece spanning the period 1999-2015. The characterization of networks on sliding time windows revealed that small-world structure emerges in the last time interval, shortly before the main shock.

Constraints of nonresponding flows based on cross layers in the networks

NASA Astrophysics Data System (ADS)

Zhou, Zhi-Chao; Xiao, Yang; Wang, Dong

2016-02-01

In the active queue management (AQM) scheme, core routers cannot manage and constrain user datagram protocol (UDP) data flows by the sliding window control mechanism in the transport layer due to the nonresponsive nature of such traffic flows. However, the UDP traffics occupy a large part of the network service nowadays which brings a great challenge to the stability of the more and more complex networks. To solve the uncontrollable problem, this paper proposes a cross layers random early detection (CLRED) scheme, which can control the nonresponding UDP-like flows rate effectively when congestion occurs in the access point (AP). The CLRED makes use of the MAC frame acknowledgement (ACK) transmitting congestion information to the sources nodes and utilizes the back-off windows of the MAC layer throttling data rate. Consequently, the UDP-like flows data rate can be restrained timely by the sources nodes in order to alleviate congestion in the complex networks. The proposed CLRED can constrain the nonresponsive flows availably and make the communication expedite, so that the network can sustain stable. The simulation results of network simulator-2 (NS2) verify the proposed CLRED scheme.

Hierarchy Bayesian model based services awareness of high-speed optical access networks

NASA Astrophysics Data System (ADS)

Bai, Hui-feng

2018-03-01

As the speed of optical access networks soars with ever increasing multiple services, the service-supporting ability of optical access networks suffers greatly from the shortage of service awareness. Aiming to solve this problem, a hierarchy Bayesian model based services awareness mechanism is proposed for high-speed optical access networks. This approach builds a so-called hierarchy Bayesian model, according to the structure of typical optical access networks. Moreover, the proposed scheme is able to conduct simple services awareness operation in each optical network unit (ONU) and to perform complex services awareness from the whole view of system in optical line terminal (OLT). Simulation results show that the proposed scheme is able to achieve better quality of services (QoS), in terms of packet loss rate and time delay.

A random spatial network model based on elementary postulates

USGS Publications Warehouse

Karlinger, Michael R.; Troutman, Brent M.

1989-01-01

A model for generating random spatial networks that is based on elementary postulates comparable to those of the random topology model is proposed. In contrast to the random topology model, this model ascribes a unique spatial specification to generated drainage networks, a distinguishing property of some network growth models. The simplicity of the postulates creates an opportunity for potential analytic investigations of the probabilistic structure of the drainage networks, while the spatial specification enables analyses of spatially dependent network properties. In the random topology model all drainage networks, conditioned on magnitude (number of first-order streams), are equally likely, whereas in this model all spanning trees of a grid, conditioned on area and drainage density, are equally likely. As a result, link lengths in the generated networks are not independent, as usually assumed in the random topology model. For a preliminary model evaluation, scale-dependent network characteristics, such as geometric diameter and link length properties, and topologic characteristics, such as bifurcation ratio, are computed for sets of drainage networks generated on square and rectangular grids. Statistics of the bifurcation and length ratios fall within the range of values reported for natural drainage networks, but geometric diameters tend to be relatively longer than those for natural networks.

Impacts on the Voltage Profile of DC Distribution Network with DG Access

NASA Astrophysics Data System (ADS)

Tu, J. J.; Yin, Z. D.

2017-07-01

With the development of electronic, more and more distributed generations (DGs) access into grid and cause the research fever of direct current (DC) distribution network. Considering distributed generation (DG) location and capacity have great impacts on voltage profile, so use IEEE9 and IEEE33 typical circuit as examples, with DGs access in centralized and decentralized mode, to compare voltage profile in alternating and direct current (AC/DC) distribution network. Introducing the voltage change ratio as an evaluation index, so gets the general results on voltage profile of DC distributed network with DG access. Simulation shows that, in the premise of reasonable location and capacity, DC distribution network is more suitable for DG access.

Rural women and violence situation: access and accessibility limits to the healthcare network.

PubMed

Costa, Marta Cocco da; Silva, Ethel Bastos da; Soares, Joannie Dos Santos Fachinelli; Borth, Luana Cristina; Honnef, Fernanda

2017-07-13

To analyze the access and accessibility to the healthcare network of women dwelling in rural contexts undergoing violence situation, as seen from the professionals' speeches. A qualitative, exploratory, descriptive study with professionals from the healthcare network services about coping with violence in four municipalities in the northern region of Rio Grande do Sul. The information derived from interviews, which have been analyzed by thematic modality. (Lack of) information of women, distance, restricted access to transportation, dependence on the partner and (lack of) attention by professionals to welcome women undergoing violence situation and (non)-articulation of the network are factors that limit the access and, as a consequence, they result in the lack of confrontation of this problem. To bring closer the services which integrate the confrontation network of violence against women and to qualify professionals to welcome these situations are factors that can facilitate the access and adhesion of rural women to the services.

Broadband Optical Access Technologies to Converge towards a Broadband Society in Europe

NASA Astrophysics Data System (ADS)

Coudreuse, Jean-Pierre; Pautonnier, Sophie; Lavillonnière, Eric; Didierjean, Sylvain; Hilt, Benoît; Kida, Toshimichi; Oshima, Kazuyoshi

This paper provides insights on the status of broadband optical access market and technologies in Europe and on the expected trends for the next generation optical access networks. The final target for most operators, cities or any other player is of course FTTH (Fibre To The Home) deployment although we can expect intermediate steps with copper or wireless technologies. Among the two candidate architectures for FTTH, PON (Passive Optical Network) is by far the most attractive and cost effective solution. We also demonstrate that Ethernet based optical access network is very adequate to all-IP networks without any incidence on the level of quality of service. Finally, we provide feedback from a FTTH pilot network in Colmar (France) based on Gigabit Ethernet PON technology. The interest of this pilot lies on the level of functionality required for broadband optical access networks but also on the development of new home network configurations.

Feasibility study from a randomized controlled trial of standard closure of a stoma site vs biological mesh reinforcement.

PubMed

2016-09-01

Hernia formation occurs at closed stoma sites in up to 30% of patients. The Reinforcement of Closure of Stoma Site (ROCSS) randomized controlled trial is evaluating whether placement of biological mesh during stoma closure safely reduces hernia rates compared with closure without mesh, without increasing surgical or wound complications. This paper aims to report recruitment, deliverability and safety from the internal feasibility study. A multicentre, patient and assessor blinded, randomized controlled trial, delivered through surgical trainee research networks. A 90-patient internal feasibility study assessed recruitment, randomization, deliverability and early (30 day) safety of the novel surgical technique (ClinicalTrials.gov registration number NCT02238964). The feasibility study recruited 90 patients from the 104 considered for entry (45 to mesh, 45 to no mesh). Seven of eight participating centres randomized patients within 30 days of opening. Overall, 41% of stomas were created for malignant disease and 73% were ileostomies. No mesh-specific complications occurred. Thirty-one postoperative adverse events were experienced by 31 patients, including surgical site infection (9%) and postoperative ileus (6%). One mesh was removed for re-access to the abdominal cavity, for reasons unrelated to the mesh. Independent review by the Data Monitoring and Ethics Committee of adverse event data by treatment allocation found no safety concerns. Multicentre randomization to this trial of biological mesh is feasible, with no early safety concerns. Progression to the full Phase III trial has continued. ROCSS shows that trainee research networks can efficiently develop and deliver complex interventional surgical trials. Colorectal Disease © 2016 The Association of Coloproctology of Great Britain and Ireland.

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.

Fiber Access Networks: Reliability Analysis and Swedish Broadband Market

NASA Astrophysics Data System (ADS)

Wosinska, Lena; Chen, Jiajia; Larsen, Claus Popp

Fiber access network architectures such as active optical networks (AONs) and passive optical networks (PONs) have been developed to support the growing bandwidth demand. Whereas particularly Swedish operators prefer AON, this may not be the case for operators in other countries. The choice depends on a combination of technical requirements, practical constraints, business models, and cost. Due to the increasing importance of reliable access to the network services, connection availability is becoming one of the most crucial issues for access networks, which should be reflected in the network owner's architecture decision. In many cases protection against failures is realized by adding backup resources. However, there is a trade off between the cost of protection and the level of service reliability since improving reliability performance by duplication of network resources (and capital expenditures CAPEX) may be too expensive. In this paper we present the evolution of fiber access networks and compare reliability performance in relation to investment and management cost for some representative cases. We consider both standard and novel architectures for deployment in both sparsely and densely populated areas. While some recent works focused on PON protection schemes with reduced CAPEX the current and future effort should be put on minimizing the operational expenditures (OPEX) during the access network lifetime.

Policies for implementing network firewalls

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

Brown, C.D.

1994-05-01

Corporate networks are frequently protected by {open_quotes}firewalls{close_quotes} or gateway systems that control access to/from other networks, e.g., the Internet, in order to reduce the network`s vulnerability to hackers and other unauthorized access. Firewalls typically limit access to particular network nodes and application protocols, and they often perform special authentication and authorization functions. One of the difficult issues associated with network firewalls is determining which applications should be permitted through the firewall. For example, many networks permit the exchange of electronic mail with the outside but do not permit file access to be initiated by outside users, as this might allowmore » outside users to access sensitive data or to surreptitiously modify data or programs (e.g., to intall Trojan Horse software). However, if access through firewalls is severely restricted, legitimate network users may find it difficult or impossible to collaborate with outside users and to share data. Some of the most serious issues regarding firewalls involve setting policies for firewalls with the goal of achieving an acceptable balance between the need for greater functionality and the associated risks. Two common firewall implementation techniques, screening routers and application gateways, are discussed below, followed by some common policies implemented by network firewalls.« less

Logical optical line terminal technologies towards flexible and highly reliable metro- and access-integrated networks

NASA Astrophysics Data System (ADS)

Okamoto, Satoru; Sato, Takehiro; Yamanaka, Naoaki

2017-01-01

In this paper, flexible and highly reliable metro and access integrated networks with network virtualization and software defined networking technologies will be presented. Logical optical line terminal (L-OLT) technologies and active optical distribution networks (ODNs) are the key to introduce flexibility and high reliability into the metro and access integrated networks. In the Elastic Lambda Aggregation Network (EλAN) project which was started in 2012, a concept of the programmable optical line terminal (P-OLT) has been proposed. A role of the P-OLT is providing multiple network services that have different protocols and quality of service requirements by single OLT box. Accommodated services will be Internet access, mobile front-haul/back-haul, data-center access, and leased line. L-OLTs are configured within the P-OLT box to support the functions required for each network service. Multiple P-OLTs and programmable optical network units (P-ONUs) are connected by the active ODN. Optical access paths which have flexible capacity are set on the ODN to provide network services from L-OLT to logical ONUs (L-ONUs). The L-OLT to L-ONU path on the active ODN provides a logical connection. Therefore, introducing virtualization technologies becomes possible. One example is moving an L-OLT from one P-OLT to another P-OLT like a virtual machine. This movement is called L-OLT migration. The L-OLT migration provides flexible and reliable network functions such as energy saving by aggregating L-OLTs to a limited number of P-OLTs, and network wide optical access path restoration. Other L-OLT virtualization technologies and experimental results will be also discussed in the paper.

Randomizing Genome-Scale Metabolic Networks

PubMed Central

Samal, Areejit; Martin, Olivier C.

2011-01-01

Networks coming from protein-protein interactions, transcriptional regulation, signaling, or metabolism may appear to have “unusual” properties. To quantify this, it is appropriate to randomize the network and test the hypothesis that the network is not statistically different from expected in a motivated ensemble. However, when dealing with metabolic networks, the randomization of the network using edge exchange generates fictitious reactions that are biochemically meaningless. Here we provide several natural ensembles of randomized metabolic networks. A first constraint is to use valid biochemical reactions. Further constraints correspond to imposing appropriate functional constraints. We explain how to perform these randomizations with the help of Markov Chain Monte Carlo (MCMC) and show that they allow one to approach the properties of biological metabolic networks. The implication of the present work is that the observed global structural properties of real metabolic networks are likely to be the consequence of simple biochemical and functional constraints. PMID:21779409

Experimental realization of an entanglement access network and secure multi-party computation

NASA Astrophysics Data System (ADS)

Chang, X.-Y.; Deng, D.-L.; Yuan, X.-X.; Hou, P.-Y.; Huang, Y.-Y.; Duan, L.-M.

2016-07-01

To construct a quantum network with many end users, it is critical to have a cost-efficient way to distribute entanglement over different network ends. We demonstrate an entanglement access network, where the expensive resource, the entangled photon source at the telecom wavelength and the core communication channel, is shared by many end users. Using this cost-efficient entanglement access network, we report experimental demonstration of a secure multiparty computation protocol, the privacy-preserving secure sum problem, based on the network quantum cryptography.

Experimental realization of an entanglement access network and secure multi-party computation

NASA Astrophysics Data System (ADS)

Chang, Xiuying; Deng, Donglin; Yuan, Xinxing; Hou, Panyu; Huang, Yuanyuan; Duan, Luming; Department of Physics, University of Michigan Collaboration; CenterQuantum Information in Tsinghua University Team

2017-04-01

To construct a quantum network with many end users, it is critical to have a cost-efficient way to distribute entanglement over different network ends. We demonstrate an entanglement access network, where the expensive resource, the entangled photon source at the telecom wavelength and the core communication channel, is shared by many end users. Using this cost-efficient entanglement access network, we report experimental demonstration of a secure multiparty computation protocol, the privacy-preserving secure sum problem, based on the network quantum cryptography.

47 CFR 36.213 - Network access services revenues.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 47 Telecommunication 2 2010-10-01 2010-10-01 false Network access services revenues. 36.213 Section 36.213 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) COMMON CARRIER SERVICES... Income Accounts Operating Revenues § 36.213 Network access services revenues. (a) End User Revenue...

47 CFR 36.213 - Network access services revenues.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 47 Telecommunication 2 2011-10-01 2011-10-01 false Network access services revenues. 36.213 Section 36.213 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) COMMON CARRIER SERVICES... Income Accounts Operating Revenues § 36.213 Network access services revenues. (a) End User Revenue...

Robust-yet-fragile nature of interdependent networks

NASA Astrophysics Data System (ADS)

Tan, Fei; Xia, Yongxiang; Wei, Zhi

2015-05-01

Interdependent networks have been shown to be extremely vulnerable based on the percolation model. Parshani et al. [Europhys. Lett. 92, 68002 (2010), 10.1209/0295-5075/92/68002] further indicated that the more intersimilar networks are, the more robust they are to random failures. When traffic load is considered, how do the coupling patterns impact cascading failures in interdependent networks? This question has been largely unexplored until now. In this paper, we address this question by investigating the robustness of interdependent Erdös-Rényi random graphs and Barabási-Albert scale-free networks under either random failures or intentional attacks. It is found that interdependent Erdös-Rényi random graphs are robust yet fragile under either random failures or intentional attacks. Interdependent Barabási-Albert scale-free networks, however, are only robust yet fragile under random failures but fragile under intentional attacks. We further analyze the interdependent communication network and power grid and achieve similar results. These results advance our understanding of how interdependency shapes network robustness.

Evolving bipartite authentication graph partitions

DOE PAGES

Pope, Aaron Scott; Tauritz, Daniel Remy; Kent, Alexander D.

2017-01-16

As large scale enterprise computer networks become more ubiquitous, finding the appropriate balance between user convenience and user access control is an increasingly challenging proposition. Suboptimal partitioning of users’ access and available services contributes to the vulnerability of enterprise networks. Previous edge-cut partitioning methods unduly restrict users’ access to network resources. This paper introduces a novel method of network partitioning superior to the current state-of-the-art which minimizes user impact by providing alternate avenues for access that reduce vulnerability. Networks are modeled as bipartite authentication access graphs and a multi-objective evolutionary algorithm is used to simultaneously minimize the size of largemore » connected components while minimizing overall restrictions on network users. Lastly, results are presented on a real world data set that demonstrate the effectiveness of the introduced method compared to previous naive methods.« less

Metro-access integrated network based on optical OFDMA with dynamic sub-carrier allocation and power distribution.

PubMed

Zhang, Chongfu; Zhang, Qiongli; Chen, Chen; Jiang, Ning; Liu, Deming; Qiu, Kun; Liu, Shuang; Wu, Baojian

2013-01-28

We propose and demonstrate a novel optical orthogonal frequency-division multiple access (OFDMA)-based metro-access integrated network with dynamic resource allocation. It consists of a single fiber OFDMA ring and many single fiber OFDMA trees, which transparently integrates metropolitan area networks with optical access networks. The single fiber OFDMA ring connects the core network and the central nodes (CNs), the CNs are on demand reconfigurable and use multiple orthogonal sub-carriers to realize parallel data transmission and dynamic resource allocation, meanwhile, they can also implement flexible power distribution. The remote nodes (RNs) distributed in the user side are connected by the single fiber OFDMA trees with the corresponding CN. The obtained results indicate that our proposed metro-access integrated network is feasible and the power distribution is agile.

Evolving bipartite authentication graph partitions

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

Pope, Aaron Scott; Tauritz, Daniel Remy; Kent, Alexander D.

As large scale enterprise computer networks become more ubiquitous, finding the appropriate balance between user convenience and user access control is an increasingly challenging proposition. Suboptimal partitioning of users’ access and available services contributes to the vulnerability of enterprise networks. Previous edge-cut partitioning methods unduly restrict users’ access to network resources. This paper introduces a novel method of network partitioning superior to the current state-of-the-art which minimizes user impact by providing alternate avenues for access that reduce vulnerability. Networks are modeled as bipartite authentication access graphs and a multi-objective evolutionary algorithm is used to simultaneously minimize the size of largemore » connected components while minimizing overall restrictions on network users. Lastly, results are presented on a real world data set that demonstrate the effectiveness of the introduced method compared to previous naive methods.« less

Source Localization in Wireless Sensor Networks with Randomly Distributed Elements under Multipath Propagation Conditions

DTIC Science & Technology

2009-03-01

IN WIRELESS SENSOR NETWORKS WITH RANDOMLY DISTRIBUTED ELEMENTS UNDER MULTIPATH PROPAGATION CONDITIONS by Georgios Tsivgoulis March 2009...COVERED Engineer’s Thesis 4. TITLE Source Localization in Wireless Sensor Networks with Randomly Distributed Elements under Multipath Propagation...the non-line-of-sight information. 15. NUMBER OF PAGES 111 14. SUBJECT TERMS Wireless Sensor Network , Direction of Arrival, DOA, Random

Quantum cryptography and applications in the optical fiber network

NASA Astrophysics Data System (ADS)

Luo, Yuhui

2005-09-01

Quantum cryptography, as part of quantum information and communications, can provide absolute security for information transmission because it is established on the fundamental laws of quantum theory, such as the principle of uncertainty, No-cloning theorem and quantum entanglement. In this thesis research, a novel scheme to implement quantum key distribution based on multiphoton entanglement with a new protocol is proposed. Its advantages are: a larger information capacity can be obtained with a longer transmission distance and the detection of multiple photons is easier than that of a single photon. The security and attacks pertaining to such a system are also studied. Next, a quantum key distribution over wavelength division multiplexed (WDM) optical fiber networks is realized. Quantum key distribution in networks is a long-standing problem for practical applications. Here we combine quantum cryptography and WDM to solve this problem because WDM technology is universally deployed in the current and next generation fiber networks. The ultimate target is to deploy quantum key distribution over commercial networks. The problems arising from the networks are also studied in this part. Then quantum key distribution in multi-access networks using wavelength routing technology is investigated in this research. For the first time, quantum cryptography for multiple individually targeted users has been successfully implemented in sharp contrast to that using the indiscriminating broadcasting structure. It overcomes the shortcoming that every user in the network can acquire the quantum key signals intended to be exchanged between only two users. Furthermore, a more efficient scheme of quantum key distribution is adopted, hence resulting in a higher key rate. Lastly, a quantum random number generator based on quantum optics has been experimentally demonstrated. This device is a key component for quantum key distribution as it can create truly random numbers, which is an essential requirement to perform quantum key distribution. This new generator is composed of a single optical fiber coupler with fiber pigtails, which can be easily used in optical fiber communications.

Bridges in complex networks

NASA Astrophysics Data System (ADS)

Wu, Ang-Kun; Tian, Liang; Liu, Yang-Yu

2018-01-01

A bridge in a graph is an edge whose removal disconnects the graph and increases the number of connected components. We calculate the fraction of bridges in a wide range of real-world networks and their randomized counterparts. We find that real networks typically have more bridges than their completely randomized counterparts, but they have a fraction of bridges that is very similar to their degree-preserving randomizations. We define an edge centrality measure, called bridgeness, to quantify the importance of a bridge in damaging a network. We find that certain real networks have a very large average and variance of bridgeness compared to their degree-preserving randomizations and other real networks. Finally, we offer an analytical framework to calculate the bridge fraction and the average and variance of bridgeness for uncorrelated random networks with arbitrary degree distributions.

47 CFR 27.16 - Network access requirements for Block C in the 746-757 and 776-787 MHz bands.

Code of Federal Regulations, 2013 CFR

2013-10-01

... jeopardizing network security. The potential for excessive bandwidth demand alone shall not constitute grounds... 47 Telecommunication 2 2013-10-01 2013-10-01 false Network access requirements for Block C in the... § 27.16 Network access requirements for Block C in the 746-757 and 776-787 MHz bands. (a) Applicability...

47 CFR 27.16 - Network access requirements for Block C in the 746-757 and 776-787 MHz bands.

Code of Federal Regulations, 2014 CFR

2014-10-01

... jeopardizing network security. The potential for excessive bandwidth demand alone shall not constitute grounds... 47 Telecommunication 2 2014-10-01 2014-10-01 false Network access requirements for Block C in the... § 27.16 Network access requirements for Block C in the 746-757 and 776-787 MHz bands. (a) Applicability...

47 CFR 27.16 - Network access requirements for Block C in the 746-757 and 776-787 MHz bands.

Code of Federal Regulations, 2012 CFR

2012-10-01

... jeopardizing network security. The potential for excessive bandwidth demand alone shall not constitute grounds... 47 Telecommunication 2 2012-10-01 2012-10-01 false Network access requirements for Block C in the... § 27.16 Network access requirements for Block C in the 746-757 and 776-787 MHz bands. (a) Applicability...

Percolation and epidemics in random clustered networks

NASA Astrophysics Data System (ADS)

Miller, Joel C.

2009-08-01

The social networks that infectious diseases spread along are typically clustered. Because of the close relation between percolation and epidemic spread, the behavior of percolation in such networks gives insight into infectious disease dynamics. A number of authors have studied percolation or epidemics in clustered networks, but the networks often contain preferential contacts in high degree nodes. We introduce a class of random clustered networks and a class of random unclustered networks with the same preferential mixing. Percolation in the clustered networks reduces the component sizes and increases the epidemic threshold compared to the unclustered networks.

Building a School District's Wide Area Network.

ERIC Educational Resources Information Center

Mastel, Vern L.

1996-01-01

Describes the development of a wide area network (WAN) in the Bismarck Public School District (North Dakota). Topics include design goals, network infrastructure, implementing library access, sharing resources across platforms, electronic mail, dial-in access, Internet access, adhering to software licenses, shareware and freeware, and monitoring…

Random walks and diffusion on networks

NASA Astrophysics Data System (ADS)

Masuda, Naoki; Porter, Mason A.; Lambiotte, Renaud

2017-11-01

Random walks are ubiquitous in the sciences, and they are interesting from both theoretical and practical perspectives. They are one of the most fundamental types of stochastic processes; can be used to model numerous phenomena, including diffusion, interactions, and opinions among humans and animals; and can be used to extract information about important entities or dense groups of entities in a network. Random walks have been studied for many decades on both regular lattices and (especially in the last couple of decades) on networks with a variety of structures. In the present article, we survey the theory and applications of random walks on networks, restricting ourselves to simple cases of single and non-adaptive random walkers. We distinguish three main types of random walks: discrete-time random walks, node-centric continuous-time random walks, and edge-centric continuous-time random walks. We first briefly survey random walks on a line, and then we consider random walks on various types of networks. We extensively discuss applications of random walks, including ranking of nodes (e.g., PageRank), community detection, respondent-driven sampling, and opinion models such as voter models.

An Effective Massive Sensor Network Data Access Scheme Based on Topology Control for the Internet of Things.

PubMed

Yi, Meng; Chen, Qingkui; Xiong, Neal N

2016-11-03

This paper considers the distributed access and control problem of massive wireless sensor networks' data access center for the Internet of Things, which is an extension of wireless sensor networks and an element of its topology structure. In the context of the arrival of massive service access requests at a virtual data center, this paper designs a massive sensing data access and control mechanism to improve the access efficiency of service requests and makes full use of the available resources at the data access center for the Internet of things. Firstly, this paper proposes a synergistically distributed buffer access model, which separates the information of resource and location. Secondly, the paper divides the service access requests into multiple virtual groups based on their characteristics and locations using an optimized self-organizing feature map neural network. Furthermore, this paper designs an optimal scheduling algorithm of group migration based on the combination scheme between the artificial bee colony algorithm and chaos searching theory. Finally, the experimental results demonstrate that this mechanism outperforms the existing schemes in terms of enhancing the accessibility of service requests effectively, reducing network delay, and has higher load balancing capacity and higher resource utility rate.

Cross-Layer Scheme to Control Contention Window for Per-Flow in Asymmetric Multi-Hop Networks

NASA Astrophysics Data System (ADS)

Giang, Pham Thanh; Nakagawa, Kenji

The IEEE 802.11 MAC standard for wireless ad hoc networks adopts Binary Exponential Back-off (BEB) mechanism to resolve bandwidth contention between stations. BEB mechanism controls the bandwidth allocation for each station by choosing a back-off value from one to CW according to the uniform random distribution, where CW is the contention window size. However, in asymmetric multi-hop networks, some stations are disadvantaged in opportunity of access to the shared channel and may suffer severe throughput degradation when the traffic load is large. Then, the network performance is degraded in terms of throughput and fairness. In this paper, we propose a new cross-layer scheme aiming to solve the per-flow unfairness problem and achieve good throughput performance in IEEE 802.11 multi-hop ad hoc networks. Our cross-layer scheme collects useful information from the physical, MAC and link layers of own station. This information is used to determine the optimal Contention Window (CW) size for per-station fairness. We also use this information to adjust CW size for each flow in the station in order to achieve per-flow fairness. Performance of our cross-layer scheme is examined on various asymmetric multi-hop network topologies by using Network Simulator (NS-2).

NeAT: a toolbox for the analysis of biological networks, clusters, classes and pathways.

PubMed

Brohée, Sylvain; Faust, Karoline; Lima-Mendez, Gipsi; Sand, Olivier; Janky, Rekin's; Vanderstocken, Gilles; Deville, Yves; van Helden, Jacques

2008-07-01

The network analysis tools (NeAT) (http://rsat.ulb.ac.be/neat/) provide a user-friendly web access to a collection of modular tools for the analysis of networks (graphs) and clusters (e.g. microarray clusters, functional classes, etc.). A first set of tools supports basic operations on graphs (comparison between two graphs, neighborhood of a set of input nodes, path finding and graph randomization). Another set of programs makes the connection between networks and clusters (graph-based clustering, cliques discovery and mapping of clusters onto a network). The toolbox also includes programs for detecting significant intersections between clusters/classes (e.g. clusters of co-expression versus functional classes of genes). NeAT are designed to cope with large datasets and provide a flexible toolbox for analyzing biological networks stored in various databases (protein interactions, regulation and metabolism) or obtained from high-throughput experiments (two-hybrid, mass-spectrometry and microarrays). The web interface interconnects the programs in predefined analysis flows, enabling to address a series of questions about networks of interest. Each tool can also be used separately by entering custom data for a specific analysis. NeAT can also be used as web services (SOAP/WSDL interface), in order to design programmatic workflows and integrate them with other available resources.

Network Access Control List Situation Awareness

ERIC Educational Resources Information Center

Reifers, Andrew

2010-01-01

Network security is a large and complex problem being addressed by multiple communities. Nevertheless, current theories in networking security appear to overestimate network administrators' ability to understand network access control lists (NACLs), providing few context specific user analyses. Consequently, the current research generally seems to…

Research of Ad Hoc Networks Access Algorithm

NASA Astrophysics Data System (ADS)

Xiang, Ma

With the continuous development of mobile communication technology, Ad Hoc access network has become a hot research, Ad Hoc access network nodes can be used to expand capacity of multi-hop communication range of mobile communication system, even business adjacent to the community, improve edge data rates. When the ad hoc network is the access network of the internet, the gateway discovery protocol is very important to choose the most appropriate gateway to guarantee the connectivity between ad hoc network and IP based fixed networks. The paper proposes a QoS gateway discovery protocol which uses the time delay and stable route to the gateway selection conditions. And according to the gateway discovery protocol, it also proposes a fast handover scheme which can decrease the handover time and improve the handover efficiency.

Dynamic defense and network randomization for computer systems

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

Chavez, Adrian R.; Stout, William M. S.; Hamlet, Jason R.

The various technologies presented herein relate to determining a network attack is taking place, and further to adjust one or more network parameters such that the network becomes dynamically configured. A plurality of machine learning algorithms are configured to recognize an active attack pattern. Notification of the attack can be generated, and knowledge gained from the detected attack pattern can be utilized to improve the knowledge of the algorithms to detect a subsequent attack vector(s). Further, network settings and application communications can be dynamically randomized, wherein artificial diversity converts control systems into moving targets that help mitigate the early reconnaissancemore » stages of an attack. An attack(s) based upon a known static address(es) of a critical infrastructure network device(s) can be mitigated by the dynamic randomization. Network parameters that can be randomized include IP addresses, application port numbers, paths data packets navigate through the network, application randomization, etc.« less

Next generation communications satellites: Multiple access and network studies

NASA Technical Reports Server (NTRS)

Stern, T. E.; Schwartz, M.; Meadows, H. E.; Ahmadi, H. K.; Gadre, J. G.; Gopal, I. S.; Matsmo, K.

1980-01-01

Following an overview of issues involved in the choice of promising system architectures for efficient communication with multiple small inexpensive Earth stations serving hetergeneous user populations, performance evaluation via analysis and simulation for six SS/TDMA (satellite-switched/time-division multiple access) system architectures is discussed. These configurations are chosen to exemplify the essential alternatives available in system design. Although the performance evaluation analyses are of fairly general applicability, whenever possible they are considered in the context of NASA's 30/20 GHz studies. Packet switched systems are considered, with the assumption that only a part of transponder capacit is devoted to packets, the integration of circuit and packet switched traffic being reserved for further study. Three types of station access are distinguished: fixed (FA), demand (DA), and random access (RA). Similarly, switching in the satellite can be assigned on a fixed (FS) or demand (DS) basis, or replaced by a buffered store-and-forward system (SF) onboard the satellite. Since not all access/switching combinations are practical, six systems are analyzed in detail: three FS SYSTEMS, FA/FS, DA/ES, RA/FS; one DS system, DA/DS; and two SF systems, FA/SF, DA/SF. Results are presented primarily in terms of delay-throughput characteristics.

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...

Experimental realization of an entanglement access network and secure multi-party computation

PubMed Central

Chang, X.-Y.; Deng, D.-L.; Yuan, X.-X.; Hou, P.-Y.; Huang, Y.-Y.; Duan, L.-M.

2016-01-01

To construct a quantum network with many end users, it is critical to have a cost-efficient way to distribute entanglement over different network ends. We demonstrate an entanglement access network, where the expensive resource, the entangled photon source at the telecom wavelength and the core communication channel, is shared by many end users. Using this cost-efficient entanglement access network, we report experimental demonstration of a secure multiparty computation protocol, the privacy-preserving secure sum problem, based on the network quantum cryptography. PMID:27404561

Optical fiber cable and wiring techniques for fiber to the home (FTTH)

NASA Astrophysics Data System (ADS)

Takai, Hirofumi; Yamauchi, Osamu

2009-08-01

NTT group's new medium-term management strategy calls for 20 million optical subscribers by 2010, and NTT Laboratories is pushing forward to meet this goal. Before that date, an efficient optical access network must be constructed, and afterwards, when the era of mass optical communications finally arrives, the facilities and equipment supporting the network will have to be effectively operated and maintained. At NTT Access Network Service Systems Laboratories, we are developing various technologies to correspond to the massive deployment of optical broadband services. We are also developing various new technologies for efficiently operating optical access network systems that will continue to expand in the future, and to supply our customers with good services. This paper provides an overview of the new optical access network system technologies that are being developed at NTT Access Network Service Systems Laboratories to address these issues.

47 CFR 27.16 - Network access requirements for Block C in the 746-757 and 776-787 MHz bands.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 47 Telecommunication 2 2010-10-01 2010-10-01 false Network access requirements for Block C in the... § 27.16 Network access requirements for Block C in the 746-757 and 776-787 MHz bands. (a) Applicability... the devices and applications of their choice on the licensee's C Block network, except: (1) Insofar as...

47 CFR 27.16 - Network access requirements for Block C in the 746-757 and 776-787 MHz bands.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 47 Telecommunication 2 2011-10-01 2011-10-01 false Network access requirements for Block C in the... § 27.16 Network access requirements for Block C in the 746-757 and 776-787 MHz bands. (a) Applicability... the devices and applications of their choice on the licensee's C Block network, except: (1) Insofar as...

Damage spreading in spatial and small-world random Boolean networks

NASA Astrophysics Data System (ADS)

Lu, Qiming; Teuscher, Christof

2014-02-01

The study of the response of complex dynamical social, biological, or technological networks to external perturbations has numerous applications. Random Boolean networks (RBNs) are commonly used as a simple generic model for certain dynamics of complex systems. Traditionally, RBNs are interconnected randomly and without considering any spatial extension and arrangement of the links and nodes. However, most real-world networks are spatially extended and arranged with regular, power-law, small-world, or other nonrandom connections. Here we explore the RBN network topology between extreme local connections, random small-world, and pure random networks, and study the damage spreading with small perturbations. We find that spatially local connections change the scaling of the Hamming distance at very low connectivities (K¯≪1) and that the critical connectivity of stability Ks changes compared to random networks. At higher K¯, this scaling remains unchanged. We also show that the Hamming distance of spatially local networks scales with a power law as the system size N increases, but with a different exponent for local and small-world networks. The scaling arguments for small-world networks are obtained with respect to the system sizes and strength of spatially local connections. We further investigate the wiring cost of the networks. From an engineering perspective, our new findings provide the key design trade-offs between damage spreading (robustness), the network's wiring cost, and the network's communication characteristics.

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.

A hybrid MAC protocol design for energy-efficient very-high-throughput millimeter wave, wireless sensor communication networks

NASA Astrophysics Data System (ADS)

Jian, Wei; Estevez, Claudio; Chowdhury, Arshad; Jia, Zhensheng; Wang, Jianxin; Yu, Jianguo; Chang, Gee-Kung

2010-12-01

This paper presents an energy-efficient Medium Access Control (MAC) protocol for very-high-throughput millimeter-wave (mm-wave) wireless sensor communication networks (VHT-MSCNs) based on hybrid multiple access techniques of frequency division multiplexing access (FDMA) and time division multiplexing access (TDMA). An energy-efficient Superframe for wireless sensor communication network employing directional mm-wave wireless access technologies is proposed for systems that require very high throughput, such as high definition video signals, for sensing, processing, transmitting, and actuating functions. Energy consumption modeling for each network element and comparisons among various multi-access technologies in term of power and MAC layer operations are investigated for evaluating the energy-efficient improvement of proposed MAC protocol.

Closer to Guns: the Role of Street Gangs in Facilitating Access to Illegal Firearms.

PubMed

Roberto, Elizabeth; Braga, Anthony A; Papachristos, Andrew V

2018-05-09

Criminal offenders often turn to social networks to gain access to firearms, yet we know little about how networks facilitate access to firearms. This study conducts a network analysis of a co-offending network for the City of Chicago to determine how close any offender may be to a firearm. We use arrest data to recreate the co-offending network of all individuals who were arrested with at least one other person over an eight-year period. We then use data on guns recovered by the police to measure potential network pathways of any individual to known firearms. We test the hypothesis that gangs facilitate access to firearms and the extent to which such access relates to gunshot injury among gang members. Findings reveal that gang membership reduces the potential network distance (how close someone is) to known firearms by 20% or more, and regression results indicate that the closer gang members are to guns, the greater their risk of gunshot victimization.

Communication technology access, use, and preferences among primary care patients: from the Residency Research Network of Texas (RRNeT).

PubMed

Hill, Jason H; Burge, Sandra; Haring, Anna; Young, Richard A

2012-01-01

The digital revolution is changing the manner in which patients communicate with their health care providers, yet many patients still lack access to communication technology. We conducted this study to evaluate access to, use of, and preferences for using communication technology among a predominantly low-income patient population. We determined whether access, use, and preferences were associated with type of health insurance, sex, age, and ethnicity. In 2011, medical student researchers administered questionnaires to patients of randomly selected physicians within 9 primary care clinics in the Residency Research Network of Texas. Surveys addressed access to and use of cell phones and home computers and preferences for communicating with health care providers. In this sample of 533 patients (77% response rate), 448 (84%) owned a cell phone and 325 (62%) owned computers. Only 48% reported conducting Internet searches, sending and receiving E-mails, and looking up health information on the Internet. Older individuals, those in government sponsored insurance programs, and individuals from racial/ethnic minority groups had the lowest levels of technology adoption. In addition, more than 60% of patients preferred not to send and receive health information over the Internet, by instant messaging, or by text messaging. Many patients in this sample did not seek health information electronically nor did they want to communicate electronically with their physicians. This finding raises concerns about the vision of the patient-centered medical home to enhance the doctor-patient relationship through communication technology. Our patients represent some of the more vulnerable populations in the United States and, as such, deserve attention from health care policymakers who are promoting widespread use of communication technology.

Editorial: Next Generation Access Networks

NASA Astrophysics Data System (ADS)

Ruffini, Marco; Cincotti, Gabriella; Pizzinat, Anna; Vetter, Peter

2015-12-01

Over the past decade we have seen an increasing number of operators deploying Fibre-to-the-home (FTTH) solutions in access networks, in order to provide home users with a much needed network access upgrade, to support higher peak rates, higher sustained rates and a better and more uniform broadband coverage of the territory.

Network access to PCDS (SPAN, ESN, SESNET, ARPANET)

NASA Technical Reports Server (NTRS)

Green, J.

1986-01-01

One of the major goals of the National Space Science Data Center is to increase access to NASA data systems by enhancing networking activities. The activities are centered around three basic networking systems: the Space Physics Analysis Network (SPAN); the Earth Science Network (ESN); and the NASA Packet Switched System (NPSS). Each system is described, linkages among systems are explained, and future plans are announced. The inclusion of several new climate nodes on SPAN or ESN are also mentioned. Presently, the Pilot Climate Data System is accessible through SPAN and will be accessible through NPSS by summer and ESN by the end of 1986. Ambitious plans for implementation are underway. The implementation of these plans will represent a major advance in the utilization and accessibility of data worldwide.

IP access networks with QoS support

NASA Astrophysics Data System (ADS)

Sargento, Susana; Valadas, Rui J. M. T.; Goncalves, Jorge; Sousa, Henrique

2001-07-01

The increasing demand of new services and applications is pushing for drastic changes on the design of access networks targeted mainly for residential and SOHO users. Future access networks will provide full service integration (including multimedia), resource sharing at the packet level and QoS support. It is expected that using IP as the base technology, the ideal plug-and-play scenario, where the management actions of the access network operator are kept to a minimum, will be achieved easily. This paper proposes an architecture for access networks based on layer 2 or layer 3 multiplexers that allows a number of simplifications in the network elements and protocols (e.g. in the routing and addressing functions). We discuss two possible steps in the evolution of access networks towards a more efficient support of IP based services. The first one still provides no QoS support and was designed with the goal of reusing as much as possible current technologies; it is based on tunneling to transport PPP sessions. The second one introduces QoS support through the use of emerging technologies and protocols. We illustrate the different phases of a multimedia Internet access session, when using SIP for session initiation, COPS for the management of QoS policies including the AAA functions and RSVP for resource reservation.

Analysis of access to hypertensive and diabetic drugs in the Family Health Strategy, State of Pernambuco, Brazil.

PubMed

Barreto, Maria Nelly Sobreira de Carvalho; Cesse, Eduarda Ângela Pessoa; Lima, Rodrigo Fonseca; Marinho, Michelly Geórgia da Silva; Specht, Yuri da Silva; de Carvalho, Eduardo Maia Freese; Fontbonne, Annick

2015-01-01

To evaluate the access to drugs for hypertension and diabetes and the direct cost of buying them among users of the Family Health Strategy (FHS) in the state of Pernambuco, Brazil. Population-based, cross-sectional study of a systematic random sample of 785 patients with hypertension and 823 patients with diabetes mellitus who were registered in 208 randomly selected FHS teams in 35 municipalities of the state of Pernambuco. The selected municipalities were classified into three levels with probability proportional to municipality size (LS, large-sized; MS, medium-sized; SS, small-sized). To verify differences between the cities, we used the χ2 test. Pharmacological treatment was used by 91.2% patients with hypertension whereas 85.6% patients with diabetes mellitus used oral antidiabetic drugs (OADs), and 15.4% used insulin. The FHS team itself provided antihypertensive medications to 69.0% patients with hypertension, OADs to 75.0% patients with diabetes mellitus, and insulin treatment to 65.4%. The 36.9% patients with hypertension and 29.8% with diabetes mellitus that had to buy all or part of their medications reported median monthly cost of R$ 18.30, R$ 14.00, and R$ 27.61 for antihypertensive drugs, OADs, and insulin, respectively. It is necessary to increase efforts to ensure access to these drugs in the primary health care network.

47 CFR 51.318 - Eligibility criteria for access to certain unbundled network elements.

Code of Federal Regulations, 2010 CFR

2010-10-01

... unbundled network elements. 51.318 Section 51.318 Telecommunication FEDERAL COMMUNICATIONS COMMISSION... Exchange Carriers § 51.318 Eligibility criteria for access to certain unbundled network elements. (a... network elements and combinations of unbundled network elements without regard to whether the requesting...

47 CFR 51.318 - Eligibility criteria for access to certain unbundled network elements.

Code of Federal Regulations, 2011 CFR

2011-10-01

... unbundled network elements. 51.318 Section 51.318 Telecommunication FEDERAL COMMUNICATIONS COMMISSION... Exchange Carriers § 51.318 Eligibility criteria for access to certain unbundled network elements. (a... network elements and combinations of unbundled network elements without regard to whether the requesting...

Collective relaxation dynamics of small-world networks

NASA Astrophysics Data System (ADS)

Grabow, Carsten; Grosskinsky, Stefan; Kurths, Jürgen; Timme, Marc

2015-05-01

Complex networks exhibit a wide range of collective dynamic phenomena, including synchronization, diffusion, relaxation, and coordination processes. Their asymptotic dynamics is generically characterized by the local Jacobian, graph Laplacian, or a similar linear operator. The structure of networks with regular, small-world, and random connectivities are reasonably well understood, but their collective dynamical properties remain largely unknown. Here we present a two-stage mean-field theory to derive analytic expressions for network spectra. A single formula covers the spectrum from regular via small-world to strongly randomized topologies in Watts-Strogatz networks, explaining the simultaneous dependencies on network size N , average degree k , and topological randomness q . We present simplified analytic predictions for the second-largest and smallest eigenvalue, and numerical checks confirm our theoretical predictions for zero, small, and moderate topological randomness q , including the entire small-world regime. For large q of the order of one, we apply standard random matrix theory, thereby overarching the full range from regular to randomized network topologies. These results may contribute to our analytic and mechanistic understanding of collective relaxation phenomena of network dynamical systems.

Collective relaxation dynamics of small-world networks.

PubMed

Grabow, Carsten; Grosskinsky, Stefan; Kurths, Jürgen; Timme, Marc

2015-05-01

Complex networks exhibit a wide range of collective dynamic phenomena, including synchronization, diffusion, relaxation, and coordination processes. Their asymptotic dynamics is generically characterized by the local Jacobian, graph Laplacian, or a similar linear operator. The structure of networks with regular, small-world, and random connectivities are reasonably well understood, but their collective dynamical properties remain largely unknown. Here we present a two-stage mean-field theory to derive analytic expressions for network spectra. A single formula covers the spectrum from regular via small-world to strongly randomized topologies in Watts-Strogatz networks, explaining the simultaneous dependencies on network size N, average degree k, and topological randomness q. We present simplified analytic predictions for the second-largest and smallest eigenvalue, and numerical checks confirm our theoretical predictions for zero, small, and moderate topological randomness q, including the entire small-world regime. For large q of the order of one, we apply standard random matrix theory, thereby overarching the full range from regular to randomized network topologies. These results may contribute to our analytic and mechanistic understanding of collective relaxation phenomena of network dynamical systems.

An Open-Access Modeled Passenger Flow Matrix for the Global Air Network in 2010

PubMed Central

Huang, Zhuojie; Wu, Xiao; Garcia, Andres J.; Fik, Timothy J.; Tatem, Andrew J.

2013-01-01

The expanding global air network provides rapid and wide-reaching connections accelerating both domestic and international travel. To understand human movement patterns on the network and their socioeconomic, environmental and epidemiological implications, information on passenger flow is required. However, comprehensive data on global passenger flow remain difficult and expensive to obtain, prompting researchers to rely on scheduled flight seat capacity data or simple models of flow. This study describes the construction of an open-access modeled passenger flow matrix for all airports with a host city-population of more than 100,000 and within two transfers of air travel from various publicly available air travel datasets. Data on network characteristics, city population, and local area GDP amongst others are utilized as covariates in a spatial interaction framework to predict the air transportation flows between airports. Training datasets based on information from various transportation organizations in the United States, Canada and the European Union were assembled. A log-linear model controlling the random effects on origin, destination and the airport hierarchy was then built to predict passenger flows on the network, and compared to the results produced using previously published models. Validation analyses showed that the model presented here produced improved predictive power and accuracy compared to previously published models, yielding the highest successful prediction rate at the global scale. Based on this model, passenger flows between 1,491 airports on 644,406 unique routes were estimated in the prediction dataset. The airport node characteristics and estimated passenger flows are freely available as part of the Vector-Borne Disease Airline Importation Risk (VBD-Air) project at: www.vbd-air.com/data. PMID:23691194

Data Gathering and Energy Transfer Dilemma in UAV-Assisted Flying Access Network for IoT.

PubMed

Arabi, Sara; Sabir, Essaid; Elbiaze, Halima; Sadik, Mohamed

2018-05-11

Recently, Unmanned Aerial Vehicles (UAVs) have emerged as an alternative solution to assist wireless networks, thanks to numerous advantages they offer in comparison to terrestrial fixed base stations. For instance, a UAV can be used to embed a flying base station providing an on-demand nomadic access to network services. A UAV can also be used to wirelessly recharge out-of-battery ground devices. In this paper, we aim to deal with both data collection and recharging depleted ground Internet-of-Things (IoT) devices through a UAV station used as a flying base station. To extend the network lifetime, we present a novel use of UAV with energy harvesting module and wireless recharging capabilities. However, the UAV is used as an energy source to empower depleted IoT devices. On one hand, the UAV charges depleted ground IoT devices under three policies: (1) low-battery first scheme; (2) high-battery first scheme; and (3) random scheme. On the other hand, the UAV station collects data from IoT devices that have sufficient energy to transmit their packets, and in the same phase, the UAV exploits the Radio Frequency (RF) signals transmitted by IoT devices to extract and harvest energy. Furthermore, and as the UAV station has a limited coverage time due to its energy constraints, we propose and investigate an efficient trade-off between ground users recharging time and data gathering time. Furthermore, we suggest to control and optimize the UAV trajectory in order to complete its travel within a minimum time, while minimizing the energy spent and/or enhancing the network lifetime. Extensive numerical results and simulations show how the system behaves under different scenarios and using various metrics in which we examine the added value of UAV with energy harvesting module.

An open-access modeled passenger flow matrix for the global air network in 2010.

PubMed

Huang, Zhuojie; Wu, Xiao; Garcia, Andres J; Fik, Timothy J; Tatem, Andrew J

2013-01-01

The expanding global air network provides rapid and wide-reaching connections accelerating both domestic and international travel. To understand human movement patterns on the network and their socioeconomic, environmental and epidemiological implications, information on passenger flow is required. However, comprehensive data on global passenger flow remain difficult and expensive to obtain, prompting researchers to rely on scheduled flight seat capacity data or simple models of flow. This study describes the construction of an open-access modeled passenger flow matrix for all airports with a host city-population of more than 100,000 and within two transfers of air travel from various publicly available air travel datasets. Data on network characteristics, city population, and local area GDP amongst others are utilized as covariates in a spatial interaction framework to predict the air transportation flows between airports. Training datasets based on information from various transportation organizations in the United States, Canada and the European Union were assembled. A log-linear model controlling the random effects on origin, destination and the airport hierarchy was then built to predict passenger flows on the network, and compared to the results produced using previously published models. Validation analyses showed that the model presented here produced improved predictive power and accuracy compared to previously published models, yielding the highest successful prediction rate at the global scale. Based on this model, passenger flows between 1,491 airports on 644,406 unique routes were estimated in the prediction dataset. The airport node characteristics and estimated passenger flows are freely available as part of the Vector-Borne Disease Airline Importation Risk (VBD-Air) project at: www.vbd-air.com/data.

Feedback topology and XOR-dynamics in Boolean networks with varying input structure

NASA Astrophysics Data System (ADS)

Ciandrini, L.; Maffi, C.; Motta, A.; Bassetti, B.; Cosentino Lagomarsino, M.

2009-08-01

We analyze a model of fixed in-degree random Boolean networks in which the fraction of input-receiving nodes is controlled by the parameter γ . We investigate analytically and numerically the dynamics of graphs under a parallel XOR updating scheme. This scheme is interesting because it is accessible analytically and its phenomenology is at the same time under control and as rich as the one of general Boolean networks. We give analytical formulas for the dynamics on general graphs, showing that with a XOR-type evolution rule, dynamic features are direct consequences of the topological feedback structure, in analogy with the role of relevant components in Kauffman networks. Considering graphs with fixed in-degree, we characterize analytically and numerically the feedback regions using graph decimation algorithms (Leaf Removal). With varying γ , this graph ensemble shows a phase transition that separates a treelike graph region from one in which feedback components emerge. Networks near the transition point have feedback components made of disjoint loops, in which each node has exactly one incoming and one outgoing link. Using this fact, we provide analytical estimates of the maximum period starting from topological considerations.

Feedback topology and XOR-dynamics in Boolean networks with varying input structure.

PubMed

Ciandrini, L; Maffi, C; Motta, A; Bassetti, B; Cosentino Lagomarsino, M

2009-08-01

We analyze a model of fixed in-degree random Boolean networks in which the fraction of input-receiving nodes is controlled by the parameter gamma. We investigate analytically and numerically the dynamics of graphs under a parallel XOR updating scheme. This scheme is interesting because it is accessible analytically and its phenomenology is at the same time under control and as rich as the one of general Boolean networks. We give analytical formulas for the dynamics on general graphs, showing that with a XOR-type evolution rule, dynamic features are direct consequences of the topological feedback structure, in analogy with the role of relevant components in Kauffman networks. Considering graphs with fixed in-degree, we characterize analytically and numerically the feedback regions using graph decimation algorithms (Leaf Removal). With varying gamma , this graph ensemble shows a phase transition that separates a treelike graph region from one in which feedback components emerge. Networks near the transition point have feedback components made of disjoint loops, in which each node has exactly one incoming and one outgoing link. Using this fact, we provide analytical estimates of the maximum period starting from topological considerations.

78 FR 35645 - Certain Static Random Access Memories and Products Containing Same; Commission Determination...

Federal Register 2010, 2011, 2012, 2013, 2014

2013-06-13

... INTERNATIONAL TRADE COMMISSION [Investigation No. 337-TA-792] Certain Static Random Access Memories and Products Containing Same; Commission Determination Affirming a Final Initial Determination..., and the sale within the United States after importation of certain static random access memories and...

Communicative social capital and collective efficacy as determinants of access to health-enhancing resources in residential communities.

PubMed

Matsaganis, Matthew D; Wilkin, Holley A

2015-04-01

This article contributes to the burgeoning literature on the social determinants of health disparities. The authors investigate how communication resources and collective efficacy, independently and in combination, shape residents' access to health enhancing resources (including healthcare services, sources of healthier food options, and public recreation spaces) in their communities. Using random digit dial telephone survey data from 833 residents of South Los Angeles communities the authors show that communicative social capital-that is, an information and problem-solving resource that accrues to residents as they become more integrated into their local communication network of neighbors, community organizations, and local media-plays a significant role in access to health resources. This relationship is complicated by individuals' health insurance and health status, as communicative social capital magnifies the sense of absence of resources for those who are in worse health and lack insurance. Communicative social capital builds collective efficacy, which is positively related to access to health-enhancing resources, but it also mediates the negative relationship between communicative social capital and access to health resources. Residents with richer stores of communicative social capital and collective efficacy report better access to health resources. The authors conclude with a discussion of implications of these findings and suggestions for future research.

NASA/DOD Aerospace Knowledge Diffusion Research Project. Report 35: The use of computer networks in aerospace engineering

NASA Technical Reports Server (NTRS)

Bishop, Ann P.; Pinelli, Thomas E.

1995-01-01

This research used survey research to explore and describe the use of computer networks by aerospace engineers. The study population included 2000 randomly selected U.S. aerospace engineers and scientists who subscribed to Aerospace Engineering. A total of 950 usable questionnaires were received by the cutoff date of July 1994. Study results contribute to existing knowledge about both computer network use and the nature of engineering work and communication. We found that 74 percent of mail survey respondents personally used computer networks. Electronic mail, file transfer, and remote login were the most widely used applications. Networks were used less often than face-to-face interactions in performing work tasks, but about equally with reading and telephone conversations, and more often than mail or fax. Network use was associated with a range of technical, organizational, and personal factors: lack of compatibility across systems, cost, inadequate access and training, and unwillingness to embrace new technologies and modes of work appear to discourage network use. The greatest positive impacts from networking appear to be increases in the amount of accurate and timely information available, better exchange of ideas across organizational boundaries, and enhanced work flexibility, efficiency, and quality. Involvement with classified or proprietary data and type of organizational structure did not distinguish network users from nonusers. The findings can be used by people involved in the design and implementation of networks in engineering communities to inform the development of more effective networking systems, services, and policies.

Secret Shoppers Find Access To Providers And Network Accuracy Lacking For Those In Marketplace And Commercial Plans.

PubMed

Haeder, Simon F; Weimer, David L; Mukamel, Dana B

2016-07-01

The adequacy of provider networks for plans sold through insurance Marketplaces established under the Affordable Care Act has received much scrutiny recently. Various studies have established that networks are generally narrow. To learn more about network adequacy and access to care, we investigated two questions. First, no matter the nominal size of a network, can patients gain access to primary care services from providers of their choice in a timely manner? Second, how does access compare to plans sold outside insurance Marketplaces? We conducted a "secret shopper" survey of 743 primary care providers from five of California's nineteen insurance Marketplace pricing regions in the summer of 2015. Our findings indicate that obtaining access to primary care providers was generally equally challenging both inside and outside insurance Marketplaces. In less than 30 percent of cases were consumers able to schedule an appointment with an initially selected physician provider. Information about provider networks was often inaccurate. Problems accessing services for patients with acute conditions were particularly troubling. Effectively addressing issues of network adequacy requires more accurate provider information. Project HOPE—The People-to-People Health Foundation, Inc.

Untangling complex networks: Risk minimization in financial markets through accessible spin glass ground states

NASA Astrophysics Data System (ADS)

Lisewski, Andreas Martin; Lichtarge, Olivier

2010-08-01

Recurrent international financial crises inflict significant damage to societies and stress the need for mechanisms or strategies to control risk and tamper market uncertainties. Unfortunately, the complex network of market interactions often confounds rational approaches to optimize financial risks. Here we show that investors can overcome this complexity and globally minimize risk in portfolio models for any given expected return, provided the margin requirement remains below a critical, empirically measurable value. In practice, for markets with centrally regulated margin requirements, a rational stabilization strategy would be keeping margins small enough. This result follows from ground states of the random field spin glass Ising model that can be calculated exactly through convex optimization when relative spin coupling is limited by the norm of the network’s Laplacian matrix. In that regime, this novel approach is robust to noise in empirical data and may be also broadly relevant to complex networks with frustrated interactions that are studied throughout scientific fields.

Impact of the Carbon and Nitrogen Supply on Relationships and Connectivity between Metabolism and Biomass in a Broad Panel of Arabidopsis Accessions1[W][OA

PubMed Central

Sulpice, Ronan; Nikoloski, Zoran; Tschoep, Hendrik; Antonio, Carla; Kleessen, Sabrina; Larhlimi, Abdelhalim; Selbig, Joachim; Ishihara, Hirofumi; Gibon, Yves; Fernie, Alisdair R.; Stitt, Mark

2013-01-01

Natural genetic diversity provides a powerful tool to study the complex interrelationship between metabolism and growth. Profiling of metabolic traits combined with network-based and statistical analyses allow the comparison of conditions and identification of sets of traits that predict biomass. However, it often remains unclear why a particular set of metabolites is linked with biomass and to what extent the predictive model is applicable beyond a particular growth condition. A panel of 97 genetically diverse Arabidopsis (Arabidopsis thaliana) accessions was grown in near-optimal carbon and nitrogen supply, restricted carbon supply, and restricted nitrogen supply and analyzed for biomass and 54 metabolic traits. Correlation-based metabolic networks were generated from the genotype-dependent variation in each condition to reveal sets of metabolites that show coordinated changes across accessions. The networks were largely specific for a single growth condition. Partial least squares regression from metabolic traits allowed prediction of biomass within and, slightly more weakly, across conditions (cross-validated Pearson correlations in the range of 0.27–0.58 and 0.21–0.51 and P values in the range of <0.001–<0.13 and <0.001–<0.023, respectively). Metabolic traits that correlate with growth or have a high weighting in the partial least squares regression were mainly condition specific and often related to the resource that restricts growth under that condition. Linear mixed-model analysis using the combined metabolic traits from all growth conditions as an input indicated that inclusion of random effects for the conditions improves predictions of biomass. Thus, robust prediction of biomass across a range of conditions requires condition-specific measurement of metabolic traits to take account of environment-dependent changes of the underlying networks. PMID:23515278

Stability and dynamical properties of material flow systems on random networks

NASA Astrophysics Data System (ADS)

Anand, K.; Galla, T.

2009-04-01

The theory of complex networks and of disordered systems is used to study the stability and dynamical properties of a simple model of material flow networks defined on random graphs. In particular we address instabilities that are characteristic of flow networks in economic, ecological and biological systems. Based on results from random matrix theory, we work out the phase diagram of such systems defined on extensively connected random graphs, and study in detail how the choice of control policies and the network structure affects stability. We also present results for more complex topologies of the underlying graph, focussing on finitely connected Erdös-Réyni graphs, Small-World Networks and Barabási-Albert scale-free networks. Results indicate that variability of input-output matrix elements, and random structures of the underlying graph tend to make the system less stable, while fast price dynamics or strong responsiveness to stock accumulation promote stability.

Improved Writing-Conductor Designs For Magnetic Memory

NASA Technical Reports Server (NTRS)

Wu, Jiin-Chuan; Stadler, Henry L.; Katti, Romney R.

1994-01-01

Writing currents reduced to practical levels. Improved conceptual designs for writing conductors in micromagnet/Hall-effect random-access integrated-circuit memory reduces electrical current needed to magnetize micromagnet in each memory cell. Basic concept of micromagnet/Hall-effect random-access memory presented in "Magnetic Analog Random-Access Memory" (NPO-17999).

78 FR 25767 - Certain Static Random Access Memories and Products Containing Same; Commission Determination To...

Federal Register 2010, 2011, 2012, 2013, 2014

2013-05-02

... INTERNATIONAL TRADE COMMISSION [Investigation No. 337-TA-792] Certain Static Random Access Memories and Products Containing Same; Commission Determination To Review in Part a Final Initial... States after importation of certain static random access memories and products containing the same by...

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.

Hubless satellite communications networks

NASA Technical Reports Server (NTRS)

Robinson, Peter Alan

1994-01-01

Frequency Comb Multiple Access (FCMA) is a new combined modulation and multiple access method which will allow cheap hubless Very Small Aperture Terminal (VSAT) networks to be constructed. Theoretical results show bandwidth efficiency and power efficiency improvements over other modulation and multiple access methods. Costs of the VSAT network are reduced dramatically since a hub station is not required.

Alternatives for Monitoring and Limiting Network Access to Students in Network-Connected Classrooms

ERIC Educational Resources Information Center

Almeroth, Kevin; Zhang, Hangjin

2013-01-01

With the advent of laptop computers and network technology, many classrooms are now being equipped with Internet connections, either through wired connections or wireless infrastructure. Internet access provides students an additional source from which to obtain course-related information. However, constant access to the Internet can be a…

Multi-agent coordination in directed moving neighbourhood random networks

NASA Astrophysics Data System (ADS)

Shang, Yi-Lun

2010-07-01

This paper considers the consensus problem of dynamical multiple agents that communicate via a directed moving neighbourhood random network. Each agent performs random walk on a weighted directed network. Agents interact with each other through random unidirectional information flow when they coincide in the underlying network at a given instant. For such a framework, we present sufficient conditions for almost sure asymptotic consensus. Numerical examples are taken to show the effectiveness of the obtained results.

Random graph models of social networks.

PubMed

Newman, M E J; Watts, D J; Strogatz, S H

2002-02-19

We describe some new exactly solvable models of the structure of social networks, based on random graphs with arbitrary degree distributions. We give models both for simple unipartite networks, such as acquaintance networks, and bipartite networks, such as affiliation networks. We compare the predictions of our models to data for a number of real-world social networks and find that in some cases, the models are in remarkable agreement with the data, whereas in others the agreement is poorer, perhaps indicating the presence of additional social structure in the network that is not captured by the random graph.

AccessMod 3.0: computing geographic coverage and accessibility to health care services using anisotropic movement of patients

PubMed Central

Ray, Nicolas; Ebener, Steeve

2008-01-01

Background Access to health care can be described along four dimensions: geographic accessibility, availability, financial accessibility and acceptability. Geographic accessibility measures how physically accessible resources are for the population, while availability reflects what resources are available and in what amount. Combining these two types of measure into a single index provides a measure of geographic (or spatial) coverage, which is an important measure for assessing the degree of accessibility of a health care network. Results This paper describes the latest version of AccessMod, an extension to the Geographical Information System ArcView 3.×, and provides an example of application of this tool. AccessMod 3 allows one to compute geographic coverage to health care using terrain information and population distribution. Four major types of analysis are available in AccessMod: (1) modeling the coverage of catchment areas linked to an existing health facility network based on travel time, to provide a measure of physical accessibility to health care; (2) modeling geographic coverage according to the availability of services; (3) projecting the coverage of a scaling-up of an existing network; (4) providing information for cost effectiveness analysis when little information about the existing network is available. In addition to integrating travelling time, population distribution and the population coverage capacity specific to each health facility in the network, AccessMod can incorporate the influence of landscape components (e.g. topography, river and road networks, vegetation) that impact travelling time to and from facilities. Topographical constraints can be taken into account through an anisotropic analysis that considers the direction of movement. We provide an example of the application of AccessMod in the southern part of Malawi that shows the influences of the landscape constraints and of the modes of transportation on geographic coverage. Conclusion By incorporating the demand (population) and the supply (capacities of heath care centers), AccessMod provides a unifying tool to efficiently assess the geographic coverage of a network of health care facilities. This tool should be of particular interest to developing countries that have a relatively good geographic information on population distribution, terrain, and health facility locations. PMID:19087277

On the impact of fiber-delay-lines (FDL) in an all-optical network (AON) bottleneck without wavelength conversion

NASA Astrophysics Data System (ADS)

Argibay-Losada, Pablo Jesus; Sahin, Gokhan

2014-08-01

Random access memories (RAM) are fundamental in conventional electronic switches and routers to manage short-term congestion and to decrease data loss probabilities. Switches in all-optical networks (AONs), however, do not have access to optical RAM, and therefore are prone to much higher loss levels than their electronic counterparts. Fiber-delay-lines (FDLs), able to delay an optical data packet a fixed amount of time, have been proposed in the literature as a means to alleviate those high loss levels. However, they are extremely bulky to manage, so their usage introduces a trade-off between practicality and performance in the design and operation of the AON. In this paper we study the influence that FDLs have in the performance of flows crossing an all-optical switch that acts as their bottleneck. We show how extremely low numbers of FDLs (e.g., 1 or 2) can help in reducing losses by several orders of magnitude in several illustrative scenarios with high aggregation levels. Our results therefore suggest that FDLs can be a practical means of dealing with congestion in AONs in the absence of optical RAM buffers or of suitable data interchange protocols specifically designed for AONs.

Asynchronous State Estimation for Discrete-Time Switched Complex Networks With Communication Constraints.

PubMed

Zhang, Dan; Wang, Qing-Guo; Srinivasan, Dipti; Li, Hongyi; Yu, Li

2018-05-01

This paper is concerned with the asynchronous state estimation for a class of discrete-time switched complex networks with communication constraints. An asynchronous estimator is designed to overcome the difficulty that each node cannot access to the topology/coupling information. Also, the event-based communication, signal quantization, and the random packet dropout problems are studied due to the limited communication resource. With the help of switched system theory and by resorting to some stochastic system analysis method, a sufficient condition is proposed to guarantee the exponential stability of estimation error system in the mean-square sense and a prescribed performance level is also ensured. The characterization of the desired estimator gains is derived in terms of the solution to a convex optimization problem. Finally, the effectiveness of the proposed design approach is demonstrated by a simulation example.

The investigation of social networks based on multi-component random graphs

NASA Astrophysics Data System (ADS)

Zadorozhnyi, V. N.; Yudin, E. B.

2018-01-01

The methods of non-homogeneous random graphs calibration are developed for social networks simulation. The graphs are calibrated by the degree distributions of the vertices and the edges. The mathematical foundation of the methods is formed by the theory of random graphs with the nonlinear preferential attachment rule and the theory of Erdôs-Rényi random graphs. In fact, well-calibrated network graph models and computer experiments with these models would help developers (owners) of the networks to predict their development correctly and to choose effective strategies for controlling network projects.

Characterizing and modeling the dynamics of activity and popularity.

PubMed

Zhang, Peng; Li, Menghui; Gao, Liang; Fan, Ying; Di, Zengru

2014-01-01

Social media, regarded as two-layer networks consisting of users and items, turn out to be the most important channels for access to massive information in the era of Web 2.0. The dynamics of human activity and item popularity is a crucial issue in social media networks. In this paper, by analyzing the growth of user activity and item popularity in four empirical social media networks, i.e., Amazon, Flickr, Delicious and Wikipedia, it is found that cross links between users and items are more likely to be created by active users and to be acquired by popular items, where user activity and item popularity are measured by the number of cross links associated with users and items. This indicates that users generally trace popular items, overall. However, it is found that the inactive users more severely trace popular items than the active users. Inspired by empirical analysis, we propose an evolving model for such networks, in which the evolution is driven only by two-step random walk. Numerical experiments verified that the model can qualitatively reproduce the distributions of user activity and item popularity observed in empirical networks. These results might shed light on the understandings of micro dynamics of activity and popularity in social media networks.

Characterizing and Modeling the Dynamics of Activity and Popularity

PubMed Central

Zhang, Peng; Li, Menghui; Gao, Liang; Fan, Ying; Di, Zengru

2014-01-01

Social media, regarded as two-layer networks consisting of users and items, turn out to be the most important channels for access to massive information in the era of Web 2.0. The dynamics of human activity and item popularity is a crucial issue in social media networks. In this paper, by analyzing the growth of user activity and item popularity in four empirical social media networks, i.e., Amazon, Flickr, Delicious and Wikipedia, it is found that cross links between users and items are more likely to be created by active users and to be acquired by popular items, where user activity and item popularity are measured by the number of cross links associated with users and items. This indicates that users generally trace popular items, overall. However, it is found that the inactive users more severely trace popular items than the active users. Inspired by empirical analysis, we propose an evolving model for such networks, in which the evolution is driven only by two-step random walk. Numerical experiments verified that the model can qualitatively reproduce the distributions of user activity and item popularity observed in empirical networks. These results might shed light on the understandings of micro dynamics of activity and popularity in social media networks. PMID:24586586

Differences in Field Effectiveness and Adoption between a Novel Automated Chlorination System and Household Manual Chlorination of Drinking Water in Dhaka, Bangladesh: A Randomized Controlled Trial

PubMed Central

Pickering, Amy J.; Crider, Yoshika; Amin, Nuhu; Bauza, Valerie; Unicomb, Leanne; Davis, Jennifer; Luby, Stephen P.

2015-01-01

The number of people served by networked systems that supply intermittent and contaminated drinking water is increasing. In these settings, centralized water treatment is ineffective, while household-level water treatment technologies have not been brought to scale. This study compares a novel low-cost technology designed to passively (automatically) dispense chlorine at shared handpumps with a household-level intervention providing water disinfection tablets (Aquatab), safe water storage containers, and behavior promotion. Twenty compounds were enrolled in Dhaka, Bangladesh, and randomly assigned to one of three groups: passive chlorinator, Aquatabs, or control. Over a 10-month intervention period, the mean percentage of households whose stored drinking water had detectable total chlorine was 75% in compounds with access to the passive chlorinator, 72% in compounds receiving Aquatabs, and 6% in control compounds. Both interventions also significantly improved microbial water quality. Aquatabs usage fell by 50% after behavioral promotion visits concluded, suggesting intensive promotion is necessary for sustained uptake. The study findings suggest high potential for an automated decentralized water treatment system to increase consistent access to clean water in low-income urban communities. PMID:25734448

Differences in field effectiveness and adoption between a novel automated chlorination system and household manual chlorination of drinking water in Dhaka, Bangladesh: a randomized controlled trial.

PubMed

Pickering, Amy J; Crider, Yoshika; Amin, Nuhu; Bauza, Valerie; Unicomb, Leanne; Davis, Jennifer; Luby, Stephen P

2015-01-01

The number of people served by networked systems that supply intermittent and contaminated drinking water is increasing. In these settings, centralized water treatment is ineffective, while household-level water treatment technologies have not been brought to scale. This study compares a novel low-cost technology designed to passively (automatically) dispense chlorine at shared handpumps with a household-level intervention providing water disinfection tablets (Aquatab), safe water storage containers, and behavior promotion. Twenty compounds were enrolled in Dhaka, Bangladesh, and randomly assigned to one of three groups: passive chlorinator, Aquatabs, or control. Over a 10-month intervention period, the mean percentage of households whose stored drinking water had detectable total chlorine was 75% in compounds with access to the passive chlorinator, 72% in compounds receiving Aquatabs, and 6% in control compounds. Both interventions also significantly improved microbial water quality. Aquatabs usage fell by 50% after behavioral promotion visits concluded, suggesting intensive promotion is necessary for sustained uptake. The study findings suggest high potential for an automated decentralized water treatment system to increase consistent access to clean water in low-income urban communities.

Random access with adaptive packet aggregation in LTE/LTE-A.

PubMed

Zhou, Kaijie; Nikaein, Navid

While random access presents a promising solution for efficient uplink channel access, the preamble collision rate can significantly increase when massive number of devices simultaneously access the channel. To address this issue and improve the reliability of the random access, an adaptive packet aggregation method is proposed. With the proposed method, a device does not trigger a random access for every single packet. Instead, it starts a random access when the number of aggregated packets reaches a given threshold. This method reduces the packet collision rate at the expense of an extra latency, which is used to accumulate multiple packets into a single transmission unit. Therefore, the tradeoff between packet loss rate and channel access latency has to be carefully selected. We use semi-Markov model to derive the packet loss rate and channel access latency as functions of packet aggregation number. Hence, the optimal amount of aggregated packets can be found, which keeps the loss rate below the desired value while minimizing the access latency. We also apply for the idea of packet aggregation for power saving, where a device aggregates as many packets as possible until the latency constraint is reached. Simulations are carried out to evaluate our methods. We find that the packet loss rate and/or power consumption are significantly reduced with the proposed method.

The Near Future Trend: Combining Web Access and Local CD Networks. Experience and a Few Suggestions.

ERIC Educational Resources Information Center

Ma, Wei

1998-01-01

Focuses on the trend to combine Web access and CD networks, benefits of considering the community network environment as a whole, and need for flexibility in considering new technologies. Describes the Occidental College Library (California) experience of building and sharing a network and network file server. (PEN)

A Network Access Control Framework for 6LoWPAN Networks

PubMed Central

Oliveira, Luís M. L.; Rodrigues, Joel J. P. C.; de Sousa, Amaro F.; Lloret, Jaime

2013-01-01

Low power over wireless personal area networks (LoWPAN), in particular wireless sensor networks, represent an emerging technology with high potential to be employed in critical situations like security surveillance, battlefields, smart-grids, and in e-health applications. The support of security services in LoWPAN is considered a challenge. First, this type of networks is usually deployed in unattended environments, making them vulnerable to security attacks. Second, the constraints inherent to LoWPAN, such as scarce resources and limited battery capacity, impose a careful planning on how and where the security services should be deployed. Besides protecting the network from some well-known threats, it is important that security mechanisms be able to withstand attacks that have not been identified before. One way of reaching this goal is to control, at the network access level, which nodes can be attached to the network and to enforce their security compliance. This paper presents a network access security framework that can be used to control the nodes that have access to the network, based on administrative approval, and to enforce security compliance to the authorized nodes. PMID:23334610

Ad Hoc Access Gateway Selection Algorithm

NASA Astrophysics Data System (ADS)

Jie, Liu

With the continuous development of mobile communication technology, Ad Hoc access network has become a hot research, Ad Hoc access network nodes can be used to expand capacity of multi-hop communication range of mobile communication system, even business adjacent to the community, improve edge data rates. For mobile nodes in Ad Hoc network to internet, internet communications in the peer nodes must be achieved through the gateway. Therefore, the key Ad Hoc Access Networks will focus on the discovery gateway, as well as gateway selection in the case of multi-gateway and handover problems between different gateways. This paper considers the mobile node and the gateway, based on the average number of hops from an average access time and the stability of routes, improved gateway selection algorithm were proposed. An improved gateway selection algorithm, which mainly considers the algorithm can improve the access time of Ad Hoc nodes and the continuity of communication between the gateways, were proposed. This can improve the quality of communication across the network.

Random matrix approach to plasmon resonances in the random impedance network model of disordered nanocomposites

NASA Astrophysics Data System (ADS)

Olekhno, N. A.; Beltukov, Y. M.

2018-05-01

Random impedance networks are widely used as a model to describe plasmon resonances in disordered metal-dielectric and other two-component nanocomposites. In the present work, the spectral properties of resonances in random networks are studied within the framework of the random matrix theory. We have shown that the appropriate ensemble of random matrices for the considered problem is the Jacobi ensemble (the MANOVA ensemble). The obtained analytical expressions for the density of states in such resonant networks show a good agreement with the results of numerical simulations in a wide range of metal filling fractions 0

Variable disparity estimation based intermediate view reconstruction in dynamic flow allocation over EPON-based access networks

NASA Astrophysics Data System (ADS)

Bae, Kyung-Hoon; Lee, Jungjoon; Kim, Eun-Soo

2008-06-01

In this paper, a variable disparity estimation (VDE)-based intermediate view reconstruction (IVR) in dynamic flow allocation (DFA) over an Ethernet passive optical network (EPON)-based access network is proposed. In the proposed system, the stereoscopic images are estimated by a variable block-matching algorithm (VBMA), and they are transmitted to the receiver through DFA over EPON. This scheme improves a priority-based access network by converting it to a flow-based access network with a new access mechanism and scheduling algorithm, and then 16-view images are synthesized by the IVR using VDE. Some experimental results indicate that the proposed system improves the peak-signal-to-noise ratio (PSNR) to as high as 4.86 dB and reduces the processing time to 3.52 s. Additionally, the network service provider can provide upper limits of transmission delays by the flow. The modeling and simulation results, including mathematical analyses, from this scheme are also provided.

76 FR 2336 - Dynamic Random Access Memory Semiconductors From the Republic of Korea: Final Results of...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-01-13

... DEPARTMENT OF COMMERCE International Trade Administration [C-580-851] Dynamic Random Access Memory... administrative review of the countervailing duty order on dynamic random access memory semiconductors from the... following events have occurred since the publication of the preliminary results of this review. See Dynamic...

ATLAS, an integrated structural analysis and design system. Volume 4: Random access file catalog

NASA Technical Reports Server (NTRS)

Gray, F. P., Jr. (Editor)

1979-01-01

A complete catalog is presented for the random access files used by the ATLAS integrated structural analysis and design system. ATLAS consists of several technical computation modules which output data matrices to corresponding random access file. A description of the matrices written on these files is contained herein.

Examining Perceptions of Networking among African American Women in Student Affairs

ERIC Educational Resources Information Center

Burke, Monica G.; Carter, Joelle D.

2015-01-01

Since career networks offer access to upper level positions, being a part of one can offer opportunities and access to information, knowledge and referrals for career mobility. However, the duality of race and gender can create a distinctive challenge to gaining access to career networks, which are crucial components to rise to the upper level of…

Social Capital for College: Network Composition and Access to Selective Institutions among Urban High School Students

ERIC Educational Resources Information Center

Hill, Lori Diane; Bregman, Allyson; Andrade, Fernando

2015-01-01

This study examines the relationship between networks that provide high school students with "social capital for college" (SCFC) and their access to selective institutions. It also explores the link between racial disparities in access to selective colleges and the composition of students' SCFC networks. Findings indicate that while…

Modeling MAC layer for powerline communications networks

NASA Astrophysics Data System (ADS)

Hrasnica, Halid; Haidine, Abdelfatteh

2001-02-01

The usage of electrical power distribution networks for voice and data transmission, called Powerline Communications, becomes nowadays more and more attractive, particularly in the telecommunication access area. The most important reasons for that are the deregulation of the telecommunication market and a fact that the access networks are still property of former monopolistic companies. In this work, first we analyze a PLC network and system structure as well as a disturbance scenario in powerline networks. After that, we define a logical structure of the powerline MAC layer and propose the reservation MAC protocols for the usage in the PLC network which provides collision free data transmission. This makes possible better network utilization and realization of QoS guarantees which can make PLC networks competitive to other access technologies.

Stability Analysis of Interconnected Random-Access Networks.

DTIC Science & Technology

1986-04-01

NERAKOS ET AL. APR 6 UCLRSSIFIED UCT/ DEECS /TR-116-6 RFOSR-TR-86-0552 FIG 07/2 M WII, 1j08 1225 11111 .g.02 MICROCOPY RESOLUTION TEST CHART NATIONAL BUREAU...SCH4EDULE Unlimited NA 4. PERFORMING ORGANIZATION REPORT NUMBERIS) S. MONITORING ORGANIZATION REPORT NUMEER(S) UCT/ DEECS /TR-86-6 A’FOSR.TR. 8 6 - 0 Ga...theorem 2 in [71, as in (10), we have that - - . - - --i -- - - -- * ,,, * ..J - -...... -18- f n E(- U-1 A.. Ee) P Ia a.e. (14) nin i n-11 lrn n1 l -i n1

Magnetic Thin Films for Perpendicular Magnetic Recording Systems

NASA Astrophysics Data System (ADS)

Sugiyama, Atsushi; Hachisu, Takuma; Osaka, Tetsuya

In the advanced information society of today, information storage technology, which helps to store a mass of electronic data and offers high-speed random access to the data, is indispensable. Against this background, hard disk drives (HDD), which are magnetic recording devices, have gained in importance because of their advantages in capacity, speed, reliability, and production cost. These days, the uses of HDD extend not only to personal computers and network servers but also to consumer electronics products such as personal video recorders, portable music players, car navigation systems, video games, video cameras, and personal digital assistances.

Leveraging Technology and Social Media for Information Sharing

DTIC Science & Technology

2009-04-01

praised as a "gift to humanity the benefits of social networking sites such as Facebook and MySpace in forging friendships and understanding.2” The...is relatively easy to sign-up to and access. It should be noted that many DoD installations and agencies restrict access to social networking sites for...to sign-up to and access. As with facebook, many DoD installations and agencies restrict access to social networking sites . Users of Twitter are

Investigation of mode partition noise in Fabry-Perot laser diode

NASA Astrophysics Data System (ADS)

Guo, Qingyi; Deng, Lanxin; Mu, Jianwei; Li, Xun; Huang, Wei-Ping

2014-09-01

Passive optical network (PON) is considered as the most appealing access network architecture in terms of cost-effectiveness, bandwidth management flexibility, scalability and durability. And to further reduce the cost per subscriber, a Fabry-Perot (FP) laser diode is preferred as the transmitter at the optical network units (ONUs) because of its lower cost compared to distributed feedback (DFB) laser diode. However, the mode partition noise (MPN) associated with the multi-longitudinal-mode FP laser diode becomes the limiting factor in the network. This paper studies the MPN characteristics of the FP laser diode using the time-domain simulation of noise-driven multi-mode laser rate equation. The probability density functions are calculated for each longitudinal mode. The paper focuses on the investigation of the k-factor, which is a simple yet important measure of the noise power, but is usually taken as a fitted or assumed value in the penalty calculations. In this paper, the sources of the k-factor are studied with simulation, including the intrinsic source of the laser Langevin noise, and the extrinsic source of the bit pattern. The photon waveforms are shown under four simulation conditions for regular or random bit pattern, and with or without Langevin noise. The k-factors contributed by those sources are studied with a variety of bias current and modulation current. Simulation results are illustrated in figures, and show that the contribution of Langevin noise to the k-factor is larger than that of the random bit pattern, and is more dominant at lower bias current or higher modulation current.

Microcomputer Applications with PC LAN (Local Area Network) in Battleships.

DTIC Science & Technology

1988-12-01

NETWORKS 5 C. TRANSMISSION TECHNIQUES 6 D. MEDIUM ACCESS CONTROL METHODS 6 1. CSMA CD 6 2. Control Token 7 3. Slotted Ring 7 E...network model in the Turkish Battleships will employ the broadband technique. D. MEDIUM ACCESS CONTROL METHODS The access method is one of the most...better performance at heavier loads. 3. Slotted Ring This method is used with a ring network. The ring is initialized to contain a fixed number of

Social Networks and Health: Understanding the Nuances of Healthcare Access between Urban and Rural Populations.

PubMed

Amoah, Padmore Adusei; Edusei, Joseph; Amuzu, David

2018-05-13

Communities and individuals in many sub-Saharan African countries often face limited access to healthcare. Hence, many rely on social networks to enhance their chances for adequate health care. While this knowledge is well-established, little is known about the nuances of how different population groups activate these networks to improve access to healthcare. This paper examines how rural and urban dwellers in the Ashanti Region in Ghana distinctively and systematically activate their social networks to enhance access to healthcare. It uses a qualitative cross-sectional design, with in-depth interviews of 79 primary participants (28 urban and 51 rural residents) in addition to the views of eight community leaders and eight health personnel. It was discovered that both intimate and distanced social networks for healthcare are activated at different periods by rural and urban residents. Four main stages of social networks activation, comprising different individuals and groups were observed among rural and urban dwellers. Among both groups, physical proximity, privacy, trust and sense of fairness, socio-cultural meaning attached to health problems, and perceived knowledge and other resources (mainly money) held in specific networks inherently influenced social network activation. The paper posits that a critical analysis of social networks may help to tailor policy contents to individuals and groups with limited access to healthcare.

Walkability for Different Urban Granularities

NASA Astrophysics Data System (ADS)

Hollenstein, D.; Bleisch, S.

2016-06-01

The positive effects of low-intensity physical activity are widely acknowledged and in this context walking is often promoted as an active form of transport. Under the concept of walkability the role of the built environment in encouraging walking is investigated. For that purpose, walkability is quantified area-wise by measuring a varying set of built environment attributes. In purely GIS-based approaches to studying walkability, indices are generally built using existing and easily accessible data. These include street network design, population density, land use mix, and access to destinations. Access to destinations is usually estimated using either a fixed radius, or distances in the street network. In this paper, two approaches to approximate a footpath network are presented. The two footpath networks were built making different assumptions regarding the walkability of different street types with respect to more or less restrictive safety preferences. Information on sidewalk presence, pedestrian crossings, and traffic restrictions were used to build both networks. The first network comprises car traffic free areas only. The second network includes streets with low speed limits that have no sidewalks. Both networks are compared to the more commonly used street network in an access-to-distance analysis. The results suggest that for the generally highly walkable study area, access to destination mostly depends on destination density within the defined walkable distance. However, on single street segments access to destinations is diminished when only car traffic free spaces are assumed to be walkable.

75 FR 44283 - In the Matter of Certain Dynamic Random Access Memory Semiconductors and Products Containing Same...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-07-28

... Random Access Memory Semiconductors and Products Containing Same, Including Memory Modules; Notice of a... importation of certain dynamic random access memory semiconductors and products containing same, including memory modules, by reason of infringement of certain claims of U.S. Patent Nos. 5,480,051; 5,422,309; 5...

10 CFR 2.1007 - Access.

Code of Federal Regulations, 2014 CFR

2014-01-01

... Licenses for the Receipt of High-Level Radioactive Waste at a Geologic Repository § 2.1007 Access. (a)(1) A system to provide electronic access to the Licensing Support Network shall be provided at the... provide electronic access to the Licensing Support Network shall be provided at the NRC Web site, http...

10 CFR 2.1007 - Access.

Code of Federal Regulations, 2013 CFR

2013-01-01

... Licenses for the Receipt of High-Level Radioactive Waste at a Geologic Repository § 2.1007 Access. (a)(1) A system to provide electronic access to the Licensing Support Network shall be provided at the... provide electronic access to the Licensing Support Network shall be provided at the NRC Web site, http...

Peer Relations and Access to Capital in the Mathematics Classroom: A Bourdieusian Social Network Analysis

ERIC Educational Resources Information Center

Choudry, Sophina; Williams, Julian; Black, Laura

2017-01-01

The aim of this article is to explore the structure of social capital in peer networks and its relation to the unequal access of educational resources within mathematics classrooms. We hypothesise that learners can gain access to mathematics through friendship networks which provide more or less help from peers that might sustain (or curtail)…

New scaling relation for information transfer in biological networks

PubMed Central

Kim, Hyunju; Davies, Paul; Walker, Sara Imari

2015-01-01

We quantify characteristics of the informational architecture of two representative biological networks: the Boolean network model for the cell-cycle regulatory network of the fission yeast Schizosaccharomyces pombe (Davidich et al. 2008 PLoS ONE 3, e1672 (doi:10.1371/journal.pone.0001672)) and that of the budding yeast Saccharomyces cerevisiae (Li et al. 2004 Proc. Natl Acad. Sci. USA 101, 4781–4786 (doi:10.1073/pnas.0305937101)). We compare our results for these biological networks with the same analysis performed on ensembles of two different types of random networks: Erdös–Rényi and scale-free. We show that both biological networks share features in common that are not shared by either random network ensemble. In particular, the biological networks in our study process more information than the random networks on average. Both biological networks also exhibit a scaling relation in information transferred between nodes that distinguishes them from random, where the biological networks stand out as distinct even when compared with random networks that share important topological properties, such as degree distribution, with the biological network. We show that the most biologically distinct regime of this scaling relation is associated with a subset of control nodes that regulate the dynamics and function of each respective biological network. Information processing in biological networks is therefore interpreted as an emergent property of topology (causal structure) and dynamics (function). Our results demonstrate quantitatively how the informational architecture of biologically evolved networks can distinguish them from other classes of network architecture that do not share the same informational properties. PMID:26701883

A metro-access integrated network with all-optical virtual private network function using DPSK/ASK modulation format

NASA Astrophysics Data System (ADS)

Tian, Yue; Leng, Lufeng; Su, Yikai

2008-11-01

All-optical virtual private network (VPN), which offers dedicated optical channels to connect users within a VPN group, is considered a promising approach to efficient internetworking with low latency and enhanced security implemented in the physical layer. On the other hand, time-division multiplexed (TDM) / wavelength-division multiplexed (WDM) network architecture based on a feeder-ring with access-tree topology, is considered a pragmatic migration scenario from current TDM-PONs to future WDM-PONs and a potential convergence scheme for access and metropolitan networks, due to its efficiently shared hardware and bandwidth resources. All-optical VPN internetworking in such a metro-access integrated structure is expected to cover a wider service area and therefore is highly desirable. In this paper, we present a TDM/WDM metro-access integrated network supporting all-optical VPN internetworking among ONUs in different sub- PONs based on orthogonal differential-phase-shift keying (DPSK) / amplitude-shift keying (ASK) modulation format. In each ONU, no laser but a single Mach-Zehnder modulator (MZM) is needed for the upstream and VPN signal generation, which is cost-effective. Experiments and simulations are performed to verify its feasibility as a potential solution to the future access service.

Hodge Decomposition of Information Flow on Small-World Networks.

PubMed

Haruna, Taichi; Fujiki, Yuuya

2016-01-01

We investigate the influence of the small-world topology on the composition of information flow on networks. By appealing to the combinatorial Hodge theory, we decompose information flow generated by random threshold networks on the Watts-Strogatz model into three components: gradient, harmonic and curl flows. The harmonic and curl flows represent globally circular and locally circular components, respectively. The Watts-Strogatz model bridges the two extreme network topologies, a lattice network and a random network, by a single parameter that is the probability of random rewiring. The small-world topology is realized within a certain range between them. By numerical simulation we found that as networks become more random the ratio of harmonic flow to the total magnitude of information flow increases whereas the ratio of curl flow decreases. Furthermore, both quantities are significantly enhanced from the level when only network structure is considered for the network close to a random network and a lattice network, respectively. Finally, the sum of these two ratios takes its maximum value within the small-world region. These findings suggest that the dynamical information counterpart of global integration and that of local segregation are the harmonic flow and the curl flow, respectively, and that a part of the small-world region is dominated by internal circulation of information flow.

Networking the Light Fantastic--CD-ROMs on LANs.

ERIC Educational Resources Information Center

Kittle, Paul W.

1992-01-01

Describes the development of a local area network (LAN) at Loma Linda University that allows remote access for both IBM and Macintosh microcomputers to CD-ROMs. Topics discussed include types of networks; fiber optic technology; networking CD-ROM drives; remote access; modems; CD-ROM databases; memory management; interface software; and future…

Creating, generating and comparing random network models with NetworkRandomizer.

PubMed

Tosadori, Gabriele; Bestvina, Ivan; Spoto, Fausto; Laudanna, Carlo; Scardoni, Giovanni

2016-01-01

Biological networks are becoming a fundamental tool for the investigation of high-throughput data in several fields of biology and biotechnology. With the increasing amount of information, network-based models are gaining more and more interest and new techniques are required in order to mine the information and to validate the results. To fill the validation gap we present an app, for the Cytoscape platform, which aims at creating randomised networks and randomising existing, real networks. Since there is a lack of tools that allow performing such operations, our app aims at enabling researchers to exploit different, well known random network models that could be used as a benchmark for validating real, biological datasets. We also propose a novel methodology for creating random weighted networks, i.e. the multiplication algorithm, starting from real, quantitative data. Finally, the app provides a statistical tool that compares real versus randomly computed attributes, in order to validate the numerical findings. In summary, our app aims at creating a standardised methodology for the validation of the results in the context of the Cytoscape platform.

Network planning study of the metro-optical-network-oriented 3G application

NASA Astrophysics Data System (ADS)

Gong, Qian; Xu, Rong; Lin, Jin Tong

2005-02-01

To compare with the 2G mobile communication, 3G technologies can supply the perfect service scope and performance. 3G is the trend of the mobile communication. So now to build the transmission network, it is needed to consider how the transmission network to support the 3G applications. For the 3G network architecture, it include the 2 part: Utran access network and core network. So the metro optical network should consider how to build the network to adapt the 3G applications. Include the metro core and access layer. In the metro core, we should consider the network should evolved towards the Mesh architecture with ASON function to realize the fast protection and restoration, quick end-to-end service provision, and high capacity cross-connect matrix etc. In the access layer, the network should have the ability to access the 3G services such as ATM interface with IMA function. In addition, the traffic grooming should be provided to improve the bandwidth utility. In this paper, first we present the MCC network situation, the network planning model will be introduced. Then we present the topology architecture, node capacity and traffic forecast. At last, based on our analysis, we will give a total solution to MCC to build their metro optical network toward to the mesh network with the consideration of 3G services.

Access Selection Algorithm of Heterogeneous Wireless Networks for Smart Distribution Grid Based on Entropy-Weight and Rough Set

NASA Astrophysics Data System (ADS)

Xiang, Min; Qu, Qinqin; Chen, Cheng; Tian, Li; Zeng, Lingkang

2017-11-01

To improve the reliability of communication service in smart distribution grid (SDG), an access selection algorithm based on dynamic network status and different service types for heterogeneous wireless networks was proposed. The network performance index values were obtained in real time by multimode terminal and the variation trend of index values was analyzed by the growth matrix. The index weights were calculated by entropy-weight and then modified by rough set to get the final weights. Combining the grey relational analysis to sort the candidate networks, and the optimum communication network is selected. Simulation results show that the proposed algorithm can implement dynamically access selection in heterogeneous wireless networks of SDG effectively and reduce the network blocking probability.

A subjective scheduler for subjective dedicated networks

NASA Astrophysics Data System (ADS)

Suherman; Fakhrizal, Said Reza; Al-Akaidi, Marwan

2017-09-01

Multiple access technique is one of important techniques within medium access layer in TCP/IP protocol stack. Each network technology implements the selected access method. Priority can be implemented in those methods to differentiate services. Some internet networks are dedicated for specific purpose. Education browsing or tutorial video accesses are preferred in a library hotspot, while entertainment and sport contents could be subjects of limitation. Current solution may use IP address filter or access list. This paper proposes subjective properties of users or applications are used for priority determination in multiple access techniques. The NS-2 simulator is employed to evaluate the method. A video surveillance network using WiMAX is chosen as the object. Subjective priority is implemented on WiMAX scheduler based on traffic properties. Three different traffic sources from monitoring video: palace, park, and market are evaluated. The proposed subjective scheduler prioritizes palace monitoring video that results better quality, xx dB than the later monitoring spots.

Systemic risk on different interbank network topologies

NASA Astrophysics Data System (ADS)

Lenzu, Simone; Tedeschi, Gabriele

2012-09-01

In this paper we develop an interbank market with heterogeneous financial institutions that enter into lending agreements on different network structures. Credit relationships (links) evolve endogenously via a fitness mechanism based on agents' performance. By changing the agent's trust on its neighbor's performance, interbank linkages self-organize themselves into very different network architectures, ranging from random to scale-free topologies. We study which network architecture can make the financial system more resilient to random attacks and how systemic risk spreads over the network. To perturb the system, we generate a random attack via a liquidity shock. The hit bank is not automatically eliminated, but its failure is endogenously driven by its incapacity to raise liquidity in the interbank network. Our analysis shows that a random financial network can be more resilient than a scale free one in case of agents' heterogeneity.

Information Systems at Enterprise. Design of Secure Network of Enterprise

NASA Astrophysics Data System (ADS)

Saigushev, N. Y.; Mikhailova, U. V.; Vedeneeva, O. A.; Tsaran, A. A.

2018-05-01

No enterprise and company can do without designing its own corporate network in today's information society. It accelerates and facilitates the work of employees at any level, but contains a big threat to confidential information of the company. In addition to the data theft attackers, there are plenty of information threats posed by modern malware effects. In this regard, the computational security of corporate networks is an important component of modern information technologies of computer security for any enterprise. This article says about the design of the protected corporate network of the enterprise that provides the computers on the network access to the Internet, as well interoperability with the branch. The access speed to the Internet at a high level is provided through the use of high-speed access channels and load balancing between devices. The security of the designed network is performed through the use of VLAN technology as well as access lists and AAA server.

Traffic Adaptive Energy Efficient and Low Latency Medium Access Control for Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Yadav, Rajesh; Varma, Shirshu; Malaviya, N.

2008-05-01

Medium access control for wireless sensor networks has been a very active research area in the recent years. The traditional wireless medium access control protocol such as IEEE 802.11 is not suitable for the sensor network application because these are battery powered. The recharging of these sensor nodes is expensive and also not possible. The most of the literature in the medium access for the sensor network focuses on the energy efficiency. The proposed MAC protocol solves the energy inefficiency caused by idle listening, control packet overhead and overhearing taking nodes latency into consideration based on the network traffic. Simulation experiments have been performed to demonstrate the effectiveness of the proposed approach. The validation of the simulation results of the proposed MAC has been done by comparing it with the analytical model. This protocol has been simulated in Network Simulator ns-2.

On Using Home Networks and Cloud Computing for a Future Internet of Things

NASA Astrophysics Data System (ADS)

Niedermayer, Heiko; Holz, Ralph; Pahl, Marc-Oliver; Carle, Georg

In this position paper we state four requirements for a Future Internet and sketch our initial concept. The requirements: (1) more comfort, (2) integration of home networks, (3) resources like service clouds in the network, and (4) access anywhere on any machine. Future Internet needs future quality and future comfort. There need to be new possiblities for everyone. Our focus is on higher layers and related to the many overlay proposals. We consider them to run on top of a basic Future Internet core. A new user experience means to include all user devices. Home networks and services should be a fundamental part of the Future Internet. Home networks extend access and allow interaction with the environment. Cloud Computing can provide reliable resources beyond local boundaries. For access anywhere, we also need secure storage for data and profiles in the network, in particular for access with non-personal devices (Internet terminal, ticket machine, ...).

An optimization framework for measuring spatial access over healthcare networks.

PubMed

Li, Zihao; Serban, Nicoleta; Swann, Julie L

2015-07-17

Measurement of healthcare spatial access over a network involves accounting for demand, supply, and network structure. Popular approaches are based on floating catchment areas; however the methods can overestimate demand over the network and fail to capture cascading effects across the system. Optimization is presented as a framework to measure spatial access. Questions related to when and why optimization should be used are addressed. The accuracy of the optimization models compared to the two-step floating catchment area method and its variations is analytically demonstrated, and a case study of specialty care for Cystic Fibrosis over the continental United States is used to compare these approaches. The optimization models capture a patient's experience rather than their opportunities and avoid overestimating patient demand. They can also capture system effects due to change based on congestion. Furthermore, the optimization models provide more elements of access than traditional catchment methods. Optimization models can incorporate user choice and other variations, and they can be useful towards targeting interventions to improve access. They can be easily adapted to measure access for different types of patients, over different provider types, or with capacity constraints in the network. Moreover, optimization models allow differences in access in rural and urban areas.

Effects of topology on network evolution

NASA Astrophysics Data System (ADS)

Oikonomou, Panos; Cluzel, Philippe

2006-08-01

The ubiquity of scale-free topology in nature raises the question of whether this particular network design confers an evolutionary advantage. A series of studies has identified key principles controlling the growth and the dynamics of scale-free networks. Here, we use neuron-based networks of boolean components as a framework for modelling a large class of dynamical behaviours in both natural and artificial systems. Applying a training algorithm, we characterize how networks with distinct topologies evolve towards a pre-established target function through a process of random mutations and selection. We find that homogeneous random networks and scale-free networks exhibit drastically different evolutionary paths. Whereas homogeneous random networks accumulate neutral mutations and evolve by sparse punctuated steps, scale-free networks evolve rapidly and continuously. Remarkably, this latter property is robust to variations of the degree exponent. In contrast, homogeneous random networks require a specific tuning of their connectivity to optimize their ability to evolve. These results highlight an organizing principle that governs the evolution of complex networks and that can improve the design of engineered systems.

Modeling Training Site Vegetation Coverage Probability with a Random Optimizing Procedure: An Artificial Neural Network Approach.

DTIC Science & Technology

1998-05-01

Coverage Probability with a Random Optimization Procedure: An Artificial Neural Network Approach by Biing T. Guan, George Z. Gertner, and Alan B...Modeling Training Site Vegetation Coverage Probability with a Random Optimizing Procedure: An Artificial Neural Network Approach 6. AUTHOR(S) Biing...coverage based on past coverage. Approach A literature survey was conducted to identify artificial neural network analysis techniques applicable for

Distributed Detection with Collisions in a Random, Single-Hop Wireless Sensor Network

DTIC Science & Technology

2013-05-26

public release; distribution is unlimited. Distributed detection with collisions in a random, single-hop wireless sensor network The views, opinions...1274 2 ABSTRACT Distributed detection with collisions in a random, single-hop wireless sensor network Report Title We consider the problem of... WIRELESS SENSOR NETWORK Gene T. Whipps?† Emre Ertin† Randolph L. Moses† ?U.S. Army Research Laboratory, Adelphi, MD 20783 †The Ohio State University

Analysis of physical layer performance of hybrid optical-wireless access network

NASA Astrophysics Data System (ADS)

Shaddad, R. Q.; Mohammad, A. B.; Al-hetar, A. M.

2011-09-01

The hybrid optical-wireless access network (HOWAN) is a favorable architecture for next generation access network. It is an optimal combination of an optical backhaul and a wireless front-end for an efficient access network. In this paper, the HOWAN architecture is designed based on a wavelengths division multiplexing/time division multiplexing passive optical network (WDM/TDM PON) at the optical backhaul and a wireless fidelity (WiFi) technology at the wireless front-end. The HOWAN is proposed that can provide blanket coverage of broadband and flexible connection for end-users. Most of the existing works, based on performance evaluation are concerned on network layer aspects. This paper reports physical layer performance in terms of the bit error rate (BER), eye diagram, and signal-to-noise ratio (SNR) of the communication system. It accommodates 8 wavelength channels with 32 optical network unit/wireless access points (ONU/APs). It is demonstrated that downstream and upstream of 2 Gb/s can be achieved by optical backhaul for each wavelength channel along optical fiber length of 20 km and a data rate of 54 Mb/s per ONU/AP along a 50 m outdoor wireless link.

Fixed Access Network Sharing

NASA Astrophysics Data System (ADS)

Cornaglia, Bruno; Young, Gavin; Marchetta, Antonio

2015-12-01

Fixed broadband network deployments are moving inexorably to the use of Next Generation Access (NGA) technologies and architectures. These NGA deployments involve building fiber infrastructure increasingly closer to the customer in order to increase the proportion of fiber on the customer's access connection (Fibre-To-The-Home/Building/Door/Cabinet… i.e. FTTx). This increases the speed of services that can be sold and will be increasingly required to meet the demands of new generations of video services as we evolve from HDTV to "Ultra-HD TV" with 4k and 8k lines of video resolution. However, building fiber access networks is a costly endeavor. It requires significant capital in order to cover any significant geographic coverage. Hence many companies are forming partnerships and joint-ventures in order to share the NGA network construction costs. One form of such a partnership involves two companies agreeing to each build to cover a certain geographic area and then "cross-selling" NGA products to each other in order to access customers within their partner's footprint (NGA coverage area). This is tantamount to a bi-lateral wholesale partnership. The concept of Fixed Access Network Sharing (FANS) is to address the possibility of sharing infrastructure with a high degree of flexibility for all network operators involved. By providing greater configuration control over the NGA network infrastructure, the service provider has a greater ability to define the network and hence to define their product capabilities at the active layer. This gives the service provider partners greater product development autonomy plus the ability to differentiate from each other at the active network layer.

Effective comparative analysis of protein-protein interaction networks by measuring the steady-state network flow using a Markov model.

PubMed

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

2016-10-06

Comparative analysis of protein-protein interaction (PPI) networks provides an effective means of detecting conserved functional network modules across different species. Such modules typically consist of orthologous proteins with conserved interactions, which can be exploited to computationally predict the modules through network comparison. In this work, we propose a novel probabilistic framework for comparing PPI networks and effectively predicting the correspondence between proteins, represented as network nodes, that belong to conserved functional modules across the given PPI networks. The basic idea is to estimate the steady-state network flow between nodes that belong to different PPI networks based on a Markov random walk model. The random walker is designed to make random moves to adjacent nodes within a PPI network as well as cross-network moves between potential orthologous nodes with high sequence similarity. Based on this Markov random walk model, we estimate the steady-state network flow - or the long-term relative frequency of the transitions that the random walker makes - between nodes in different PPI networks, which can be used as a probabilistic score measuring their potential correspondence. Subsequently, the estimated scores can be used for detecting orthologous proteins in conserved functional modules through network alignment. Through evaluations based on multiple real PPI networks, we demonstrate that the proposed scheme leads to improved alignment results that are biologically more meaningful at reduced computational cost, outperforming the current state-of-the-art algorithms. The source code and datasets can be downloaded from http://www.ece.tamu.edu/~bjyoon/CUFID .

Do HMO market level factors lead to racial/ethnic disparities in colorectal cancer screening? A comparison between high-risk Asian and Pacific Islander Americans and high-risk whites.

PubMed

Ponce, Ninez A; Huh, Soonim; Bastani, Roshan

2005-11-01

Few studies have explored health care market structure and colorectal cancer (CRC) screening test use, and little is known whether market factors contribute to racial/ethnic screening disparities. We investigated whether HMO market level factors, controlling for individual covariates, differentially impact Asian American and Pacific Islander (AAPI) subjects' access to CRC screening compared with white subjects. We used random intercept hierarchical models to predict CRC test use. Individual-level survey data was linked to market data by metropolitan statistical areas from InterStudy. Insured first-degree relatives, ages 40-80, of a random sample of colorectal cancer cases identified from the California Cancer Registry: 515 white subjects and 396 AAPI subjects residing in 36 metropolitan statistical areas (MSAs). Dependent variables were receipt of (1) annual fecal occult blood test only; (2) sigmoidoscopy in the past 5 years; (3) colonoscopy in the past 10 years; and (4) any of these tests over the recommended time interval. Market characteristics were HMO penetration, HMO competition, and proportion of staff/group/network HMOs. Market characteristics were as important as individual-level characteristics for AAPI but not for white subjects. Among AAPI subjects, a 10% increase in the percent of group/staff/network model HMO was associated with a reduction in colonoscopy use (28.9% to 20.5%) and in receipt of any of the CRC tests (53.2% to 45.4%). The prevailing organizational structure of a health care market confers a penalty on access to CRC test use among high-risk AAPI subjects but not among high-risk white subjects. Identifying the differential effect of market structure on race/ethnicity can potentially reduce the cancer burden among disadvantaged racial groups.

Wireless Computing Architecture III

DTIC Science & Technology

2013-09-01

MIMO Multiple-Input and Multiple-Output MIMO /CON MIMO with concurrent hannel access and estimation MU- MIMO Multiuser MIMO OFDM Orthogonal...compressive sensing \\; a design for concurrent channel estimation in scalable multiuser MIMO networking; and novel networking protocols based on machine...Network, Antenna Arrays, UAV networking, Angle of Arrival, Localization MIMO , Access Point, Channel State Information, Compressive Sensing 16

Randomization and resilience of brain functional networks as systems-level endophenotypes of schizophrenia.

PubMed

Lo, Chun-Yi Zac; Su, Tsung-Wei; Huang, Chu-Chung; Hung, Chia-Chun; Chen, Wei-Ling; Lan, Tsuo-Hung; Lin, Ching-Po; Bullmore, Edward T

2015-07-21

Schizophrenia is increasingly conceived as a disorder of brain network organization or dysconnectivity syndrome. Functional MRI (fMRI) networks in schizophrenia have been characterized by abnormally random topology. We tested the hypothesis that network randomization is an endophenotype of schizophrenia and therefore evident also in nonpsychotic relatives of patients. Head movement-corrected, resting-state fMRI data were acquired from 25 patients with schizophrenia, 25 first-degree relatives of patients, and 29 healthy volunteers. Graphs were used to model functional connectivity as a set of edges between regional nodes. We estimated the topological efficiency, clustering, degree distribution, resilience, and connection distance (in millimeters) of each functional network. The schizophrenic group demonstrated significant randomization of global network metrics (reduced clustering, greater efficiency), a shift in the degree distribution to a more homogeneous form (fewer hubs), a shift in the distance distribution (proportionally more long-distance edges), and greater resilience to targeted attack on network hubs. The networks of the relatives also demonstrated abnormal randomization and resilience compared with healthy volunteers, but they were typically less topologically abnormal than the patients' networks and did not have abnormal connection distances. We conclude that schizophrenia is associated with replicable and convergent evidence for functional network randomization, and a similar topological profile was evident also in nonpsychotic relatives, suggesting that this is a systems-level endophenotype or marker of familial risk. We speculate that the greater resilience of brain networks may confer some fitness advantages on nonpsychotic relatives that could explain persistence of this endophenotype in the population.

An advanced temporal credential-based security scheme with mutual authentication and key agreement for wireless sensor networks.

PubMed

Li, Chun-Ta; Weng, Chi-Yao; Lee, Cheng-Chi

2013-07-24

Wireless sensor networks (WSNs) can be quickly and randomly deployed in any harsh and unattended environment and only authorized users are allowed to access reliable sensor nodes in WSNs with the aid of gateways (GWNs). Secure authentication models among the users, the sensor nodes and GWN are important research issues for ensuring communication security and data privacy in WSNs. In 2013, Xue et al. proposed a temporal-credential-based mutual authentication and key agreement scheme for WSNs. However, in this paper, we point out that Xue et al.'s scheme cannot resist stolen-verifier, insider, off-line password guessing, smart card lost problem and many logged-in users' attacks and these security weaknesses make the scheme inapplicable to practical WSN applications. To tackle these problems, we suggest a simple countermeasure to prevent proposed attacks while the other merits of Xue et al.'s authentication scheme are left unchanged.

An Advanced Temporal Credential-Based Security Scheme with Mutual Authentication and Key Agreement for Wireless Sensor Networks

PubMed Central

Li, Chun-Ta; Weng, Chi-Yao; Lee, Cheng-Chi

2013-01-01

Wireless sensor networks (WSNs) can be quickly and randomly deployed in any harsh and unattended environment and only authorized users are allowed to access reliable sensor nodes in WSNs with the aid of gateways (GWNs). Secure authentication models among the users, the sensor nodes and GWN are important research issues for ensuring communication security and data privacy in WSNs. In 2013, Xue et al. proposed a temporal-credential-based mutual authentication and key agreement scheme for WSNs. However, in this paper, we point out that Xue et al.'s scheme cannot resist stolen-verifier, insider, off-line password guessing, smart card lost problem and many logged-in users' attacks and these security weaknesses make the scheme inapplicable to practical WSN applications. To tackle these problems, we suggest a simple countermeasure to prevent proposed attacks while the other merits of Xue et al.'s authentication scheme are left unchanged. PMID:23887085

System for loading executable code into volatile memory in a downhole tool

DOEpatents

Hall, David R.; Bartholomew, David B.; Johnson, Monte L.

2007-09-25

A system for loading an executable code into volatile memory in a downhole tool string component comprises a surface control unit comprising executable code. An integrated downhole network comprises data transmission elements in communication with the surface control unit and the volatile memory. The executable code, stored in the surface control unit, is not permanently stored in the downhole tool string component. In a preferred embodiment of the present invention, the downhole tool string component comprises boot memory. In another embodiment, the executable code is an operating system executable code. Preferably, the volatile memory comprises random access memory (RAM). A method for loading executable code to volatile memory in a downhole tool string component comprises sending the code from the surface control unit to a processor in the downhole tool string component over the network. A central processing unit writes the executable code in the volatile memory.

Failure Analysis of Network Based Accessible Pedestrian Signals in Closed-Loop Operation

DOT National Transportation Integrated Search

2011-03-01

The potential failure modes of a network based accessible pedestrian system were analyzed to determine the limitations and benefits of closed-loop operation. The vulnerabilities of the system are accessed using the industry standard process known as ...

42 CFR 423.124 - Special rules for out-of-network access to covered Part D drugs at out-of-network pharmacies.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 42 Public Health 3 2011-10-01 2011-10-01 false Special rules for out-of-network access to covered Part D drugs at out-of-network pharmacies. 423.124 Section 423.124 Public Health CENTERS FOR MEDICARE... PRESCRIPTION DRUG BENEFIT Benefits and Beneficiary Protections § 423.124 Special rules for out-of-network...

42 CFR 423.124 - Special rules for out-of-network access to covered Part D drugs at out-of-network pharmacies.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 42 Public Health 3 2010-10-01 2010-10-01 false Special rules for out-of-network access to covered Part D drugs at out-of-network pharmacies. 423.124 Section 423.124 Public Health CENTERS FOR MEDICARE... PRESCRIPTION DRUG BENEFIT Benefits and Beneficiary Protections § 423.124 Special rules for out-of-network...

Not an 'iron pipeline', but many capillaries: regulating passive transactions in Los Angeles' secondary, illegal gun market.

PubMed

Chesnut, Kelsie Y; Barragan, Melissa; Gravel, Jason; Pifer, Natalie A; Reiter, Keramet; Sherman, Nicole; Tita, George E

2017-08-01

California has strict firearm-related laws and is exceptional in its regulation of firearms retailers. Though evidence suggests that these laws can reduce illegal access to guns, high levels of gun violence persist in Los Angeles (LA), California. This research seeks to describe the sources of guns accessed by active offenders in LA, California and reports offenders' motivations for obtaining guns. Los Angeles County Jail (LACJ) system (four facilities). Random sampling from a screened pool of eligible participants was used to conduct qualitative semistructured interviews with 140 incarcerated gun offenders in one of four (LACJ) facilities. Researchers collected data on firearm acquisition, experiences related to gun violence, and other topics, using a validated survey instrument. Grounded theory guided the collection and analysis of data. Respondents reported possession of 77 specific guns (79.2% handguns) collectively. Social networks facilitate access to illegal guns; the majority of interviewees acquired their illegal guns through a social connection (85.7%) versus an outside broker/unregulated retailer (8.5%). Most guns were obtained through illegal purchase (n=51) or gift (n=15). A quarter of gun purchasers report engaging in a passive transaction, or one initiated by another party. Passive gun buyers were motivated by concerns for personal safety and/or economic opportunity. In LA's illegal gun market, where existing social relationships facilitate access to guns across a diffuse network, individuals, influenced by both fear and economic opportunity, have frequent opportunities to illegally possess firearms through passive transactions. Gun policies should better target and minimise these transactions. Published by the BMJ Publishing Group Limited. For permission to use (where not already granted under a licence) please go to http://www.bmj.com/company/products-services/rights-and-licensing/.

An Authentication and Key Management Mechanism for Resource Constrained Devices in IEEE 802.11-based IoT Access Networks.

PubMed

Kim, Ki-Wook; Han, Youn-Hee; Min, Sung-Gi

2017-09-21

Many Internet of Things (IoT) services utilize an IoT access network to connect small devices with remote servers. They can share an access network with standard communication technology, such as IEEE 802.11ah. However, an authentication and key management (AKM) mechanism for resource constrained IoT devices using IEEE 802.11ah has not been proposed as yet. We therefore propose a new AKM mechanism for an IoT access network, which is based on IEEE 802.11 key management with the IEEE 802.1X authentication mechanism. The proposed AKM mechanism does not require any pre-configured security information between the access network domain and the IoT service domain. It considers the resource constraints of IoT devices, allowing IoT devices to delegate the burden of AKM processes to a powerful agent. The agent has sufficient power to support various authentication methods for the access point, and it performs cryptographic functions for the IoT devices. Performance analysis shows that the proposed mechanism greatly reduces computation costs, network costs, and memory usage of the resource-constrained IoT device as compared to the existing IEEE 802.11 Key Management with the IEEE 802.1X authentication mechanism.

An Authentication and Key Management Mechanism for Resource Constrained Devices in IEEE 802.11-based IoT Access Networks

PubMed Central

Han, Youn-Hee; Min, Sung-Gi

2017-01-01

Many Internet of Things (IoT) services utilize an IoT access network to connect small devices with remote servers. They can share an access network with standard communication technology, such as IEEE 802.11ah. However, an authentication and key management (AKM) mechanism for resource constrained IoT devices using IEEE 802.11ah has not been proposed as yet. We therefore propose a new AKM mechanism for an IoT access network, which is based on IEEE 802.11 key management with the IEEE 802.1X authentication mechanism. The proposed AKM mechanism does not require any pre-configured security information between the access network domain and the IoT service domain. It considers the resource constraints of IoT devices, allowing IoT devices to delegate the burden of AKM processes to a powerful agent. The agent has sufficient power to support various authentication methods for the access point, and it performs cryptographic functions for the IoT devices. Performance analysis shows that the proposed mechanism greatly reduces computation costs, network costs, and memory usage of the resource-constrained IoT device as compared to the existing IEEE 802.11 Key Management with the IEEE 802.1X authentication mechanism. PMID:28934152

Planning Multitechnology Access Networks with Performance Constraints

NASA Astrophysics Data System (ADS)

Chamberland, Steven

Considering the number of access network technologies and the investment needed for the “last mile” of a solution, in today’s highly competitive markets, planning tools are crucial for the service providers to optimize the network costs and accelerate the planning process. In this paper, we propose to tackle the problem of planning access networks composed of four technologies/architectures: the digital subscriber line (xDSL) technologies deployed directly from the central office (CO), the fiber-to-the-node (FTTN), the fiber-to-the-micro-node (FTTn) and the fiber-to-the-premises (FTTP). A mathematical programming model is proposed for this planning problem that is solved using a commercial implementation of the branch-and-bound algorithm. Next, a detailed access network planning example is presented followed by a systematic set of experiments designed to assess the performance of the proposed approach.

Percolation of localized attack on complex networks

NASA Astrophysics Data System (ADS)

Shao, Shuai; Huang, Xuqing; Stanley, H. Eugene; Havlin, Shlomo

2015-02-01

The robustness of complex networks against node failure and malicious attack has been of interest for decades, while most of the research has focused on random attack or hub-targeted attack. In many real-world scenarios, however, attacks are neither random nor hub-targeted, but localized, where a group of neighboring nodes in a network are attacked and fail. In this paper we develop a percolation framework to analytically and numerically study the robustness of complex networks against such localized attack. In particular, we investigate this robustness in Erdős-Rényi networks, random-regular networks, and scale-free networks. Our results provide insight into how to better protect networks, enhance cybersecurity, and facilitate the design of more robust infrastructures.

Visualizing collaborative electronic health record usage for hospitalized patients with heart failure.

PubMed

Soulakis, Nicholas D; Carson, Matthew B; Lee, Young Ji; Schneider, Daniel H; Skeehan, Connor T; Scholtens, Denise M

2015-03-01

To visualize and describe collaborative electronic health record (EHR) usage for hospitalized patients with heart failure. We identified records of patients with heart failure and all associated healthcare provider record usage through queries of the Northwestern Medicine Enterprise Data Warehouse. We constructed a network by equating access and updates of a patient's EHR to a provider-patient interaction. We then considered shared patient record access as the basis for a second network that we termed the provider collaboration network. We calculated network statistics, the modularity of provider interactions, and provider cliques. We identified 548 patient records accessed by 5113 healthcare providers in 2012. The provider collaboration network had 1504 nodes and 83 998 edges. We identified 7 major provider collaboration modules. Average clique size was 87.9 providers. We used a graph database to demonstrate an ad hoc query of our provider-patient network. Our analysis suggests a large number of healthcare providers across a wide variety of professions access records of patients with heart failure during their hospital stay. This shared record access tends to take place not only in a pairwise manner but also among large groups of providers. EHRs encode valuable interactions, implicitly or explicitly, between patients and providers. Network analysis provided strong evidence of multidisciplinary record access of patients with heart failure across teams of 100+ providers. Further investigation may lead to clearer understanding of how record access information can be used to strategically guide care coordination for patients hospitalized for heart failure. © The Author 2015. Published by Oxford University Press on behalf of the American Medical Informatics Association.

The informational architecture of the cell.

PubMed

Walker, Sara Imari; Kim, Hyunju; Davies, Paul C W

2016-03-13

We compare the informational architecture of biological and random networks to identify informational features that may distinguish biological networks from random. The study presented here focuses on the Boolean network model for regulation of the cell cycle of the fission yeast Schizosaccharomyces pombe. We compare calculated values of local and global information measures for the fission yeast cell cycle to the same measures as applied to two different classes of random networks: Erdös-Rényi and scale-free. We report patterns in local information processing and storage that do indeed distinguish biological from random, associated with control nodes that regulate the function of the fission yeast cell-cycle network. Conversely, we find that integrated information, which serves as a global measure of 'emergent' information processing, does not differ from random for the case presented. We discuss implications for our understanding of the informational architecture of the fission yeast cell-cycle network in particular, and more generally for illuminating any distinctive physics that may be operative in life. © 2016 The Author(s).

Simulation of the mechanical behavior of random fiber networks with different microstructure.

PubMed

Hatami-Marbini, H

2018-05-24

Filamentous protein networks are broadly encountered in biological systems such as cytoskeleton and extracellular matrix. Many numerical studies have been conducted to better understand the fundamental mechanisms behind the striking mechanical properties of these networks. In most of these previous numerical models, the Mikado algorithm has been used to represent the network microstructure. Here, a different algorithm is used to create random fiber networks in order to investigate possible roles of architecture on the elastic behavior of filamentous networks. In particular, random fibrous structures are generated from the growth of individual fibers from random nucleation points. We use computer simulations to determine the mechanical behavior of these networks in terms of their model parameters. The findings are presented and discussed along with the response of Mikado fiber networks. We demonstrate that these alternative networks and Mikado networks show a qualitatively similar response. Nevertheless, the overall elasticity of Mikado networks is stiffer compared to that of the networks created using the alternative algorithm. We describe the effective elasticity of both network types as a function of their line density and of the material properties of the filaments. We also characterize the ratio of bending and axial energy and discuss the behavior of these networks in terms of their fiber density distribution and coordination number.

Infectious disease control using contact tracing in random and scale-free networks

PubMed Central

Kiss, Istvan Z; Green, Darren M; Kao, Rowland R

2005-01-01

Contact tracing aims to identify and isolate individuals that have been in contact with infectious individuals. The efficacy of contact tracing and the hierarchy of traced nodes—nodes with higher degree traced first—is investigated and compared on random and scale-free (SF) networks with the same number of nodes N and average connection K. For values of the transmission rate larger than a threshold, the final epidemic size on SF networks is smaller than that on corresponding random networks. While in random networks new infectious and traced nodes from all classes have similar average degrees, in SF networks the average degree of nodes that are in more advanced stages of the disease is higher at any given time. On SF networks tracing removes possible sources of infection with high average degree. However a higher tracing effort is required to control the epidemic than on corresponding random networks due to the high initial velocity of spread towards the highly connected nodes. An increased latency period fails to significantly improve contact tracing efficacy. Contact tracing has a limited effect if the removal rate of susceptible nodes is relatively high, due to the fast local depletion of susceptible nodes. PMID:16849217

Guidelines for Outsourcing Remote Access.

ERIC Educational Resources Information Center

Hassler, Ardoth; Neuman, Michael

1996-01-01

Discusses the advantages and disadvantages of outsourcing remote access to campus computer networks and the Internet, focusing on improved service, cost-sharing, partnerships with vendors, supported protocols, bandwidth, scope of access, implementation, support, network security, and pricing. Includes a checklist for a request for proposals on…

Efficient sampling of complex network with modified random walk strategies

NASA Astrophysics Data System (ADS)

Xie, Yunya; Chang, Shuhua; Zhang, Zhipeng; Zhang, Mi; Yang, Lei

2018-02-01

We present two novel random walk strategies, choosing seed node (CSN) random walk and no-retracing (NR) random walk. Different from the classical random walk sampling, the CSN and NR strategies focus on the influences of the seed node choice and path overlap, respectively. Three random walk samplings are applied in the Erdös-Rényi (ER), Barabási-Albert (BA), Watts-Strogatz (WS), and the weighted USAir networks, respectively. Then, the major properties of sampled subnets, such as sampling efficiency, degree distributions, average degree and average clustering coefficient, are studied. The similar conclusions can be reached with these three random walk strategies. Firstly, the networks with small scales and simple structures are conducive to the sampling. Secondly, the average degree and the average clustering coefficient of the sampled subnet tend to the corresponding values of original networks with limited steps. And thirdly, all the degree distributions of the subnets are slightly biased to the high degree side. However, the NR strategy performs better for the average clustering coefficient of the subnet. In the real weighted USAir networks, some obvious characters like the larger clustering coefficient and the fluctuation of degree distribution are reproduced well by these random walk strategies.

An Effective Massive Sensor Network Data Access Scheme Based on Topology Control for the Internet of Things

PubMed Central

Yi, Meng; Chen, Qingkui; Xiong, Neal N.

2016-01-01

This paper considers the distributed access and control problem of massive wireless sensor networks’ data access center for the Internet of Things, which is an extension of wireless sensor networks and an element of its topology structure. In the context of the arrival of massive service access requests at a virtual data center, this paper designs a massive sensing data access and control mechanism to improve the access efficiency of service requests and makes full use of the available resources at the data access center for the Internet of things. Firstly, this paper proposes a synergistically distributed buffer access model, which separates the information of resource and location. Secondly, the paper divides the service access requests into multiple virtual groups based on their characteristics and locations using an optimized self-organizing feature map neural network. Furthermore, this paper designs an optimal scheduling algorithm of group migration based on the combination scheme between the artificial bee colony algorithm and chaos searching theory. Finally, the experimental results demonstrate that this mechanism outperforms the existing schemes in terms of enhancing the accessibility of service requests effectively, reducing network delay, and has higher load balancing capacity and higher resource utility rate. PMID:27827878

Modular Energy-Efficient and Robust Paradigms for a Disaster-Recovery Process over Wireless Sensor Networks

PubMed Central

Razaque, Abdul; Elleithy, Khaled

2015-01-01

Robust paradigms are a necessity, particularly for emerging wireless sensor network (WSN) applications. The lack of robust and efficient paradigms causes a reduction in the provision of quality of service (QoS) and additional energy consumption. In this paper, we introduce modular energy-efficient and robust paradigms that involve two archetypes: (1) the operational medium access control (O-MAC) hybrid protocol and (2) the pheromone termite (PT) model. The O-MAC protocol controls overhearing and congestion and increases the throughput, reduces the latency and extends the network lifetime. O-MAC uses an optimized data frame format that reduces the channel access time and provides faster data delivery over the medium. Furthermore, O-MAC uses a novel randomization function that avoids channel collisions. The PT model provides robust routing for single and multiple links and includes two new significant features: (1) determining the packet generation rate to avoid congestion and (2) pheromone sensitivity to determine the link capacity prior to sending the packets on each link. The state-of-the-art research in this work is based on improving both the QoS and energy efficiency. To determine the strength of O-MAC with the PT model; we have generated and simulated a disaster recovery scenario using a network simulator (ns-3.10) that monitors the activities of disaster recovery staff; hospital staff and disaster victims brought into the hospital. Moreover; the proposed paradigm can be used for general purpose applications. Finally; the QoS metrics of the O-MAC and PT paradigms are evaluated and compared with other known hybrid protocols involving the MAC and routing features. The simulation results indicate that O-MAC with PT produced better outcomes. PMID:26153768

SpectralNET – an application for spectral graph analysis and visualization

PubMed Central

Forman, Joshua J; Clemons, Paul A; Schreiber, Stuart L; Haggarty, Stephen J

2005-01-01

Background Graph theory provides a computational framework for modeling a variety of datasets including those emerging from genomics, proteomics, and chemical genetics. Networks of genes, proteins, small molecules, or other objects of study can be represented as graphs of nodes (vertices) and interactions (edges) that can carry different weights. SpectralNET is a flexible application for analyzing and visualizing these biological and chemical networks. Results Available both as a standalone .NET executable and as an ASP.NET web application, SpectralNET was designed specifically with the analysis of graph-theoretic metrics in mind, a computational task not easily accessible using currently available applications. Users can choose either to upload a network for analysis using a variety of input formats, or to have SpectralNET generate an idealized random network for comparison to a real-world dataset. Whichever graph-generation method is used, SpectralNET displays detailed information about each connected component of the graph, including graphs of degree distribution, clustering coefficient by degree, and average distance by degree. In addition, extensive information about the selected vertex is shown, including degree, clustering coefficient, various distance metrics, and the corresponding components of the adjacency, Laplacian, and normalized Laplacian eigenvectors. SpectralNET also displays several graph visualizations, including a linear dimensionality reduction for uploaded datasets (Principal Components Analysis) and a non-linear dimensionality reduction that provides an elegant view of global graph structure (Laplacian eigenvectors). Conclusion SpectralNET provides an easily accessible means of analyzing graph-theoretic metrics for data modeling and dimensionality reduction. SpectralNET is publicly available as both a .NET application and an ASP.NET web application from . Source code is available upon request. PMID:16236170

SpectralNET--an application for spectral graph analysis and visualization.

PubMed

Forman, Joshua J; Clemons, Paul A; Schreiber, Stuart L; Haggarty, Stephen J

2005-10-19

Graph theory provides a computational framework for modeling a variety of datasets including those emerging from genomics, proteomics, and chemical genetics. Networks of genes, proteins, small molecules, or other objects of study can be represented as graphs of nodes (vertices) and interactions (edges) that can carry different weights. SpectralNET is a flexible application for analyzing and visualizing these biological and chemical networks. Available both as a standalone .NET executable and as an ASP.NET web application, SpectralNET was designed specifically with the analysis of graph-theoretic metrics in mind, a computational task not easily accessible using currently available applications. Users can choose either to upload a network for analysis using a variety of input formats, or to have SpectralNET generate an idealized random network for comparison to a real-world dataset. Whichever graph-generation method is used, SpectralNET displays detailed information about each connected component of the graph, including graphs of degree distribution, clustering coefficient by degree, and average distance by degree. In addition, extensive information about the selected vertex is shown, including degree, clustering coefficient, various distance metrics, and the corresponding components of the adjacency, Laplacian, and normalized Laplacian eigenvectors. SpectralNET also displays several graph visualizations, including a linear dimensionality reduction for uploaded datasets (Principal Components Analysis) and a non-linear dimensionality reduction that provides an elegant view of global graph structure (Laplacian eigenvectors). SpectralNET provides an easily accessible means of analyzing graph-theoretic metrics for data modeling and dimensionality reduction. SpectralNET is publicly available as both a .NET application and an ASP.NET web application from http://chembank.broad.harvard.edu/resources/. Source code is available upon request.

Modular Energy-Efficient and Robust Paradigms for a Disaster-Recovery Process over Wireless Sensor Networks.

PubMed

Razaque, Abdul; Elleithy, Khaled

2015-07-06

Robust paradigms are a necessity, particularly for emerging wireless sensor network (WSN) applications. The lack of robust and efficient paradigms causes a reduction in the provision of quality of service (QoS) and additional energy consumption. In this paper, we introduce modular energy-efficient and robust paradigms that involve two archetypes: (1) the operational medium access control (O-MAC) hybrid protocol and (2) the pheromone termite (PT) model. The O-MAC protocol controls overhearing and congestion and increases the throughput, reduces the latency and extends the network lifetime. O-MAC uses an optimized data frame format that reduces the channel access time and provides faster data delivery over the medium. Furthermore, O-MAC uses a novel randomization function that avoids channel collisions. The PT model provides robust routing for single and multiple links and includes two new significant features: (1) determining the packet generation rate to avoid congestion and (2) pheromone sensitivity to determine the link capacity prior to sending the packets on each link. The state-of-the-art research in this work is based on improving both the QoS and energy efficiency. To determine the strength of O-MAC with the PT model; we have generated and simulated a disaster recovery scenario using a network simulator (ns-3.10) that monitors the activities of disaster recovery staff; hospital staff and disaster victims brought into the hospital. Moreover; the proposed paradigm can be used for general purpose applications. Finally; the QoS metrics of the O-MAC and PT paradigms are evaluated and compared with other known hybrid protocols involving the MAC and routing features. The simulation results indicate that O-MAC with PT produced better outcomes.

77 FR 21996 - Certain Equipment for Communications Networks, Including Switches, Routers, Gateways, Bridges...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-04-12

... INTERNATIONAL TRADE COMMISSION [Investigation No. 337-TA-778] Certain Equipment for Communications Networks, Including Switches, Routers, Gateways, Bridges, Wireless Access Points, Cable Modems, IP Phones... networks, including switches, routers, gateways, bridges, wireless access points, cable modems, IP phones...

Simulation and measurement of optical access network with different types of optical-fiber amplifiers

NASA Astrophysics Data System (ADS)

Latal, Jan; Vogl, Jan; Koudelka, Petr; Vitasek, Jan; Siska, Petr; Liner, Andrej; Papes, Martin; Vasinek, Vladimir

2012-01-01

The optical access networks are nowadays swiftly developing in the telecommunications field. These networks can provide higher data transfer rates, and have great potential to the future in terms of transmission possibilities. Many local internet providers responded to these facts and began gradually installing optical access networks into their originally built networks, mostly based on wireless communication. This allowed enlargement of possibilities for end-users in terms of high data rates and also new services such as Triple play, IPTV (Internet Protocol television) etc. However, with this expansion and building-up is also related the potential of reach in case of these networks. Big cities, such as Prague, Brno, Ostrava or Olomouc cannot be simply covered, because of their sizes and also because of their internal regulations given by various organizations in each city. Standard logical and also physical reach of EPON (IEEE 802.3ah - Ethernet Passive Optical Network) optical access network is about 20 km. However, for networks based on Wavelength Division Multiplex the reach can be up to 80 km, if the optical-fiber amplifier is inserted into the network. This article deals with simulation of different types of amplifiers for WDM-PON (Wavelength Division Multiplexing-Passive Optical Network) network in software application Optiwave OptiSystem and than are the values from the application and from real measurement compared.

Stochastic Models of Emerging Infectious Disease Transmission on Adaptive Random Networks

PubMed Central

Pipatsart, Navavat; Triampo, Wannapong

2017-01-01

We presented adaptive random network models to describe human behavioral change during epidemics and performed stochastic simulations of SIR (susceptible-infectious-recovered) epidemic models on adaptive random networks. The interplay between infectious disease dynamics and network adaptation dynamics was investigated in regard to the disease transmission and the cumulative number of infection cases. We found that the cumulative case was reduced and associated with an increasing network adaptation probability but was increased with an increasing disease transmission probability. It was found that the topological changes of the adaptive random networks were able to reduce the cumulative number of infections and also to delay the epidemic peak. Our results also suggest the existence of a critical value for the ratio of disease transmission and adaptation probabilities below which the epidemic cannot occur. PMID:29075314

Performance analysis of a proposed tightly-coupled medical instrument network based on CAN protocol.

PubMed

Mujumdar, Shantanu; Thongpithoonrat, Pongnarin; Gurkan, D; McKneely, Paul K; Chapman, Frank M; Merchant, Fatima

2010-01-01

Advances in medical devices and health care has been phenomenal during the recent years. Although medical device manufacturers have been improving their instruments, network connection of these instruments still rely on proprietary technologies. Even if the interface has been provided by the manufacturer (e.g., RS-232, USB, or Ethernet coupled with a proprietary API), there is no widely-accepted uniform data model to access data of various bedside instruments. There is a need for a common standard which allows for internetworking with the medical devices from different manufacturers. ISO/IEEE 11073 (X73) is a standard attempting to unify the interfaces of all medical devices. X73 defines a client access mechanism that would be implemented into the communication controllers (residing between an instrument and the network) in order to access/network patient data. On the other hand, MediCAN™ technology suite has been demonstrated with various medical instruments to achieve interfacing and networking with a similar goal in its open standardization approach. However, it provides a more generic definition for medical data to achieve flexibility for networking and client access mechanisms. The instruments are in turn becoming more sophisticated; however, the operation of an instrument is still expected to be locally done by authorized medical personnel. Unfortunately, each medical instrument has its unique proprietary API (application programming interface - if any) to provide automated and electronic access to monitoring data. Integration of these APIs requires an agreement with the manufacturers towards realization of interoperable health care networking. As long as the interoperability of instruments with a network is not possible, ubiquitous access to patient status is limited only to manual entry based systems. This paper demonstrates an attempt to realize an interoperable medical instrument interface for networking using MediCAN technology suite as an open standard.

Network analysis of Bogotá's Ciclovía Recreativa, a self-organized multisectorial community program to promote physical activity in a middle-income country.

PubMed

Meisel, Jose D; Sarmiento, Olga L; Montes, Felipe; Martinez, Edwin O; Lemoine, Pablo D; Valdivia, Juan A; Brownson, Ross C; Zarama, Roberto

2014-01-01

Conduct a social network analysis of the health and non-health related organizations that participate in Bogotá's Ciclovía Recreativa (Ciclovía). Cross-sectional study. Ciclovía is a multisectoral community-based mass program in which streets are temporarily closed to motorized transport, allowing exclusive access to individuals for leisure activities and physical activity. Twenty-five organizations that participate in the Ciclovía. Seven variables were examined by using network analytic methods: relationship, link attributes (integration, contact, and importance), and node attributes (leadership, years in the program, and the sector of the organization). The network analytic methods were based on a visual descriptive analysis and an exponential random graph model. Analysis shows that the most central organizations in the network were outside of the Health sector and include Sports and Recreation, Government, and Security sectors. The organizations work in clusters formed by organizations of different sectors. Organization importance and structural predictors were positively related to integration, while the number of years working with Ciclovía was negatively associated with integration. Ciclovía is a network whose structure emerged as a self-organized complex system. Ciclovía of Bogotá is an example of a program with public health potential formed by organizations of multiple sectors with Sports and Recreation as the most central.

Geographic Accessibility of Community Pharmacies in Ontario

PubMed Central

Law, Michael R.; Dijkstra, Anna; Douillard, Jay A.; Morgan, Steven G.

2011-01-01

Background: Proximity is an important component of access to healthcare services. Recent changes in generic pricing in Ontario have caused speculation about pharmacy closures. However, there is little information on the current geographic accessibility of pharmacies. Therefore, we studied geographic access to pharmacies and modelled the impact of possible closures. Methods: We used location data on the 3,352 accredited community pharmacies from the Ontario College of Pharmacists and population estimates at the census dissemination block level. Using network analysis, we determined the share of Ontario's population who reside in a census dissemination block within three road travel distances of a community pharmacy: 800 m (walking), 2 km and 5 km (driving). We then simulated the effects on these measures of 10% to 50% reductions in the number of community pharmacies in Ontario. Results: Approximately 63.6% of the Ontario population reside in a dissemination block located within walking distance of one or more pharmacies; 84.6% and 90.7% reside within 2-km and 5-km driving distances, respectively. Randomly removing 30% of Ontario's community pharmacies reduces these estimates to 56.0%, 81.4% and 89.0% for each distance, respectively; a 50% reduction results in 48.3%, 77.1% and 87.2%, respectively. Conclusions: Pharmacies are geographically accessible for a majority of the Ontario population. Moreover, it appears that modest closures would have only a small impact on geographic access to pharmacies. However, closures may have other impacts on access, such as cost, waiting time and reduced patient choice. PMID:22294990

Network meta-analysis of disconnected networks: How dangerous are random baseline treatment effects?

PubMed

Béliveau, Audrey; Goring, Sarah; Platt, Robert W; Gustafson, Paul

2017-12-01

In network meta-analysis, the use of fixed baseline treatment effects (a priori independent) in a contrast-based approach is regularly preferred to the use of random baseline treatment effects (a priori dependent). That is because, often, there is not a need to model baseline treatment effects, which carry the risk of model misspecification. However, in disconnected networks, fixed baseline treatment effects do not work (unless extra assumptions are made), as there is not enough information in the data to update the prior distribution on the contrasts between disconnected treatments. In this paper, we investigate to what extent the use of random baseline treatment effects is dangerous in disconnected networks. We take 2 publicly available datasets of connected networks and disconnect them in multiple ways. We then compare the results of treatment comparisons obtained from a Bayesian contrast-based analysis of each disconnected network using random normally distributed and exchangeable baseline treatment effects to those obtained from a Bayesian contrast-based analysis of their initial connected network using fixed baseline treatment effects. For the 2 datasets considered, we found that the use of random baseline treatment effects in disconnected networks was appropriate. Because those datasets were not cherry-picked, there should be other disconnected networks that would benefit from being analyzed using random baseline treatment effects. However, there is also a risk for the normality and exchangeability assumption to be inappropriate in other datasets even though we have not observed this situation in our case study. We provide code, so other datasets can be investigated. Copyright © 2017 John Wiley & Sons, Ltd.

Traffic handling capability of a broadband indoor wireless network using CDMA multiple access

NASA Astrophysics Data System (ADS)

Zhang, Chang G.; Hafez, H. M.; Falconer, David D.

1994-05-01

CDMA (code division multiple access) may be an attractive technique for wireless access to broadband services because of its multiple access simplicity and other appealing features. In order to investigate traffic handling capabilities of a future network providing a variety of integrated services, this paper presents a study of a broadband indoor wireless network supporting high-speed traffic using CDMA multiple access. The results are obtained through the simulation of an indoor environment and the traffic capabilities of the wireless access to broadband 155.5 MHz ATM-SONET networks using the mm-wave band. A distributed system architecture is employed and the system performance is measured in terms of call blocking probability and dropping probability. The impacts of the base station density, traffic load, average holding time, and variable traffic sources on the system performance are examined. The improvement of system performance by implementing various techniques such as handoff, admission control, power control and sectorization are also investigated.

Quasirandom geometric networks from low-discrepancy sequences

NASA Astrophysics Data System (ADS)

Estrada, Ernesto

2017-08-01

We define quasirandom geometric networks using low-discrepancy sequences, such as Halton, Sobol, and Niederreiter. The networks are built in d dimensions by considering the d -tuples of digits generated by these sequences as the coordinates of the vertices of the networks in a d -dimensional Id unit hypercube. Then, two vertices are connected by an edge if they are at a distance smaller than a connection radius. We investigate computationally 11 network-theoretic properties of two-dimensional quasirandom networks and compare them with analogous random geometric networks. We also study their degree distribution and their spectral density distributions. We conclude from this intensive computational study that in terms of the uniformity of the distribution of the vertices in the unit square, the quasirandom networks look more random than the random geometric networks. We include an analysis of potential strategies for generating higher-dimensional quasirandom networks, where it is know that some of the low-discrepancy sequences are highly correlated. In this respect, we conclude that up to dimension 20, the use of scrambling, skipping and leaping strategies generate quasirandom networks with the desired properties of uniformity. Finally, we consider a diffusive process taking place on the nodes and edges of the quasirandom and random geometric graphs. We show that the diffusion time is shorter in the quasirandom graphs as a consequence of their larger structural homogeneity. In the random geometric graphs the diffusion produces clusters of concentration that make the process more slow. Such clusters are a direct consequence of the heterogeneous and irregular distribution of the nodes in the unit square in which the generation of random geometric graphs is based on.

Network-based H.264/AVC whole frame loss visibility model and frame dropping methods.

PubMed

Chang, Yueh-Lun; Lin, Ting-Lan; Cosman, Pamela C

2012-08-01

We examine the visual effect of whole frame loss by different decoders. Whole frame losses are introduced in H.264/AVC compressed videos which are then decoded by two different decoders with different common concealment effects: frame copy and frame interpolation. The videos are seen by human observers who respond to each glitch they spot. We found that about 39% of whole frame losses of B frames are not observed by any of the subjects, and over 58% of the B frame losses are observed by 20% or fewer of the subjects. Using simple predictive features which can be calculated inside a network node with no access to the original video and no pixel level reconstruction of the frame, we developed models which can predict the visibility of whole B frame losses. The models are then used in a router to predict the visual impact of a frame loss and perform intelligent frame dropping to relieve network congestion. Dropping frames based on their visual scores proves superior to random dropping of B frames.

Hybrid optical CDMA-FSO communications network under spatially correlated gamma-gamma scintillation.

PubMed

Jurado-Navas, Antonio; Raddo, Thiago R; Garrido-Balsells, José María; Borges, Ben-Hur V; Olmos, Juan José Vegas; Monroy, Idelfonso Tafur

2016-07-25

In this paper, we propose a new hybrid network solution based on asynchronous optical code-division multiple-access (OCDMA) and free-space optical (FSO) technologies for last-mile access networks, where fiber deployment is impractical. The architecture of the proposed hybrid OCDMA-FSO network is thoroughly described. The users access the network in a fully asynchronous manner by means of assigned fast frequency hopping (FFH)-based codes. In the FSO receiver, an equal gain-combining technique is employed along with intensity modulation and direct detection. New analytical formalisms for evaluating the average bit error rate (ABER) performance are also proposed. These formalisms, based on the spatially correlated gamma-gamma statistical model, are derived considering three distinct scenarios, namely, uncorrelated, totally correlated, and partially correlated channels. Numerical results show that users can successfully achieve error-free ABER levels for the three scenarios considered as long as forward error correction (FEC) algorithms are employed. Therefore, OCDMA-FSO networks can be a prospective alternative to deliver high-speed communication services to access networks with deficient fiber infrastructure.

A network of web multimedia medical information servers for a medical school and university hospital.

PubMed

Denier, P; Le Beux, P; Delamarre, D; Fresnel, A; Cleret, M; Courtin, C; Seka, L P; Pouliquen, B; Cleran, L; Riou, C; Burgun, A; Jarno, P; Leduff, F; Lesaux, H; Duvauferrier, R

1997-08-01

Modern medicine requires a rapid access to information including clinical data from medical records, bibliographic databases, knowledge bases and nomenclature databases. This is especially true for University Hospitals and Medical Schools for training as well as for fundamental and clinical research for diagnosis and therapeutic purposes. This implies the development of local, national and international cooperation which can be enhanced via the use and access to computer networks such as Internet. The development of professional cooperative networks goes with the development of the telecommunication and computer networks and our project is to make these new tools and technologies accessible to the medical students both during the teaching time in Medical School and during the training periods at the University Hospital. We have developed a local area network which communicates between the School of Medicine and the Hospital which takes advantage of the new Web client-server technology both internally (Intranet) and externally by access to the National Research Network (RENATER in France) connected to the Internet network. The address of our public web server is http:(/)/www.med.univ-rennesl.fr.

Toward Privacy-preserving Content Access Control for Information Centric Networking

DTIC Science & Technology

2014-03-01

REPORT Toward Privacy-preserving Content Access Control for Information Centric Networking 14. ABSTRACT 16. SECURITY CLASSIFICATION OF: Information...regardless the security mechanisms provided by different content hosting servers. However, using ABE has a drawback that the enforced content access...Encryption (ABE) is a flexible approach to enforce the content access policies regardless the security mechanisms provided by different content hosting

A Novel Dynamic Spectrum Access Framework Based on Reinforcement Learning for Cognitive Radio Sensor Networks.

PubMed

Lin, Yun; Wang, Chao; Wang, Jiaxing; Dou, Zheng

2016-10-12

Cognitive radio sensor networks are one of the kinds of application where cognitive techniques can be adopted and have many potential applications, challenges and future research trends. According to the research surveys, dynamic spectrum access is an important and necessary technology for future cognitive sensor networks. Traditional methods of dynamic spectrum access are based on spectrum holes and they have some drawbacks, such as low accessibility and high interruptibility, which negatively affect the transmission performance of the sensor networks. To address this problem, in this paper a new initialization mechanism is proposed to establish a communication link and set up a sensor network without adopting spectrum holes to convey control information. Specifically, firstly a transmission channel model for analyzing the maximum accessible capacity for three different polices in a fading environment is discussed. Secondly, a hybrid spectrum access algorithm based on a reinforcement learning model is proposed for the power allocation problem of both the transmission channel and the control channel. Finally, extensive simulations have been conducted and simulation results show that this new algorithm provides a significant improvement in terms of the tradeoff between the control channel reliability and the efficiency of the transmission channel.

A Novel Dynamic Spectrum Access Framework Based on Reinforcement Learning for Cognitive Radio Sensor Networks

PubMed Central

Lin, Yun; Wang, Chao; Wang, Jiaxing; Dou, Zheng

2016-01-01

Cognitive radio sensor networks are one of the kinds of application where cognitive techniques can be adopted and have many potential applications, challenges and future research trends. According to the research surveys, dynamic spectrum access is an important and necessary technology for future cognitive sensor networks. Traditional methods of dynamic spectrum access are based on spectrum holes and they have some drawbacks, such as low accessibility and high interruptibility, which negatively affect the transmission performance of the sensor networks. To address this problem, in this paper a new initialization mechanism is proposed to establish a communication link and set up a sensor network without adopting spectrum holes to convey control information. Specifically, firstly a transmission channel model for analyzing the maximum accessible capacity for three different polices in a fading environment is discussed. Secondly, a hybrid spectrum access algorithm based on a reinforcement learning model is proposed for the power allocation problem of both the transmission channel and the control channel. Finally, extensive simulations have been conducted and simulation results show that this new algorithm provides a significant improvement in terms of the tradeoff between the control channel reliability and the efficiency of the transmission channel. PMID:27754316

Safety management of Ethernet broadband access based on VLAN aggregation

NASA Astrophysics Data System (ADS)

Wang, Li

2004-04-01

With broadband access network development, the Ethernet technology is more and more applied access network now. It is different from the private network -LAN. The differences lie in four points: customer management, safety management, service management and count-fee management. This paper mainly discusses the safety management related questions. Safety management means that the access network must secure the customer data safety, isolate the broad message which brings the customer private information, such as ARP, DHCP, and protect key equipment from attack. Virtue LAN (VLAN) technology can restrict network broadcast flow. We can config each customer port with a VLAN, so each customer is isolated with others. The IP address bound with VLAN ID can be routed rightly. But this technology brings another question: IP address shortage. VLAN aggregation technology can solve this problem well. Such a mechanism provides several advantages over traditional IPv4 addressing architectures employed in large switched LANs today. With VLAN aggregation technology, we introduce the notion of sub-VLANs and super-VLANs, a much more optimal approach to IP addressing can be realized. This paper will expatiate the VLAN aggregation model and its implementation in Ethernet access network. It is obvious that the customers in different sub-VLANs can not communication to each other because the ARP packet is isolated. Proxy ARP can enable the communication among them. This paper will also expatiate the proxy ARP model and its implementation in Ethernet access network.

A Network and Visual Quality Aware N-Screen Content Recommender System Using Joint Matrix Factorization

PubMed Central

Ullah, Farman; Sarwar, Ghulam; Lee, Sungchang

2014-01-01

We propose a network and visual quality aware N-Screen content recommender system. N-Screen provides more ways than ever before to access multimedia content through multiple devices and heterogeneous access networks. The heterogeneity of devices and access networks present new questions of QoS (quality of service) in the realm of user experience with content. We propose, a recommender system that ensures a better visual quality on user's N-screen devices and the efficient utilization of available access network bandwidth with user preferences. The proposed system estimates the available bandwidth and visual quality on users N-Screen devices and integrates it with users preferences and contents genre information to personalize his N-Screen content. The objective is to recommend content that the user's N-Screen device and access network are capable of displaying and streaming with the user preferences that have not been supported in existing systems. Furthermore, we suggest a joint matrix factorization approach to jointly factorize the users rating matrix with the users N-Screen device similarity and program genres similarity. Finally, the experimental results show that we also enhance the prediction and recommendation accuracy, sparsity, and cold start issues. PMID:24982999

Noisy scale-free networks

NASA Astrophysics Data System (ADS)

Scholz, Jan; Dejori, Mathäus; Stetter, Martin; Greiner, Martin

2005-05-01

The impact of observational noise on the analysis of scale-free networks is studied. Various noise sources are modeled as random link removal, random link exchange and random link addition. Emphasis is on the resulting modifications for the node-degree distribution and for a functional ranking based on betweenness centrality. The implications for estimated gene-expressed networks for childhood acute lymphoblastic leukemia are discussed.

Entropy of spatial network ensembles

NASA Astrophysics Data System (ADS)

Coon, Justin P.; Dettmann, Carl P.; Georgiou, Orestis

2018-04-01

We analyze complexity in spatial network ensembles through the lens of graph entropy. Mathematically, we model a spatial network as a soft random geometric graph, i.e., a graph with two sources of randomness, namely nodes located randomly in space and links formed independently between pairs of nodes with probability given by a specified function (the "pair connection function") of their mutual distance. We consider the general case where randomness arises in node positions as well as pairwise connections (i.e., for a given pair distance, the corresponding edge state is a random variable). Classical random geometric graph and exponential graph models can be recovered in certain limits. We derive a simple bound for the entropy of a spatial network ensemble and calculate the conditional entropy of an ensemble given the node location distribution for hard and soft (probabilistic) pair connection functions. Under this formalism, we derive the connection function that yields maximum entropy under general constraints. Finally, we apply our analytical framework to study two practical examples: ad hoc wireless networks and the US flight network. Through the study of these examples, we illustrate that both exhibit properties that are indicative of nearly maximally entropic ensembles.

Synchronizability of random rectangular graphs

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

Estrada, Ernesto, E-mail: ernesto.estrada@strath.ac.uk; Chen, Guanrong

2015-08-15

Random rectangular graphs (RRGs) represent a generalization of the random geometric graphs in which the nodes are embedded into hyperrectangles instead of on hypercubes. The synchronizability of RRG model is studied. Both upper and lower bounds of the eigenratio of the network Laplacian matrix are determined analytically. It is proven that as the rectangular network is more elongated, the network becomes harder to synchronize. The synchronization processing behavior of a RRG network of chaotic Lorenz system nodes is numerically investigated, showing complete consistence with the theoretical results.

The Design of Passive Optical Networking+Ethernet over Coaxial Cable Access Networking and Video-on-Demand Services Carrying

NASA Astrophysics Data System (ADS)

Ji, Wei

2013-07-01

Video on demand is a very attractive service used for entertainment, education, and other purposes. The design of passive optical networking+Ethernet over coaxial cable accessing and a home gateway system is proposed. The network integrates the passive optical networking and Ethernet over coaxial cable to provide high dedicated bandwidth for the metropolitan video-on-demand services. Using digital video broadcasting, IP television protocol, unicasting, and broadcasting mechanisms maximizes the system throughput. The home gateway finishes radio frequency signal receiving and provides three kinds of interfaces for high-definition video, voice, and data, which achieves triple-play and wire/wireless access synchronously.

Networking CD-ROMs: The Decision Maker's Guide to Local Area Network Solutions.

ERIC Educational Resources Information Center

Elshami, Ahmed M.

In an era when patrons want access to CD-ROM resources but few libraries can afford to buy multiple copies, CD-ROM local area networks (LANs) are emerging as a cost-effective way to provide shared access. To help librarians make informed decisions, this manual offers information on: (1) the basics of LANs, a "local area network primer";…

Wireless Sensor Network Radio Power Management and Simulation Models

DTIC Science & Technology

2010-01-01

The Open Electrical & Electronic Engineering Journal, 2010, 4, 21-31 21 1874-1290/10 2010 Bentham Open Open Access Wireless Sensor Network Radio...Air Force Institute of Technology, Wright-Patterson AFB, OH, USA Abstract: Wireless sensor networks (WSNs) create a new frontier in collecting and...consumption. Keywords: Wireless sensor network , power management, energy-efficiency, medium access control (MAC), simulation pa- rameters. 1

Toward negative Poisson's ratio composites: Investigation of the auxetic behavior of fibrous networks

NASA Astrophysics Data System (ADS)

Tatlier, Mehmet Seha

Random fibrous can be found among natural and synthetic materials. Some of these random fibrous networks possess negative Poisson's ratio and they are extensively called auxetic materials. The governing mechanisms behind this counter intuitive property in random networks are yet to be understood and this kind of auxetic material remains widely under-explored. However, most of synthetic auxetic materials suffer from their low strength. This shortcoming can be rectified by developing high strength auxetic composites. The process of embedding auxetic random fibrous networks in a polymer matrix is an attractive alternate route to the manufacture of auxetic composites, however before such an approach can be developed, a methodology for designing fibrous networks with the desired negative Poisson's ratios must first be established. This requires an understanding of the factors which bring about negative Poisson's ratios in these materials. In this study, a numerical model is presented in order to investigate the auxetic behavior in compressed random fiber networks. Finite element analyses of three-dimensional stochastic fiber networks were performed to gain insight into the effects of parameters such as network anisotropy, network density, and degree of network compression on the out-of-plane Poisson's ratio and Young's modulus. The simulation results suggest that the compression is the critical parameter that gives rise to negative Poisson's ratio while anisotropy significantly promotes the auxetic behavior. This model can be utilized to design fibrous auxetic materials and to evaluate feasibility of developing auxetic composites by using auxetic fibrous networks as the reinforcing layer.

Influence of Choice of Null Network on Small-World Parameters of Structural Correlation Networks

PubMed Central

Hosseini, S. M. Hadi; Kesler, Shelli R.

2013-01-01

In recent years, coordinated variations in brain morphology (e.g., volume, thickness) have been employed as a measure of structural association between brain regions to infer large-scale structural correlation networks. Recent evidence suggests that brain networks constructed in this manner are inherently more clustered than random networks of the same size and degree. Thus, null networks constructed by randomizing topology are not a good choice for benchmarking small-world parameters of these networks. In the present report, we investigated the influence of choice of null networks on small-world parameters of gray matter correlation networks in healthy individuals and survivors of acute lymphoblastic leukemia. Three types of null networks were studied: 1) networks constructed by topology randomization (TOP), 2) networks matched to the distributional properties of the observed covariance matrix (HQS), and 3) networks generated from correlation of randomized input data (COR). The results revealed that the choice of null network not only influences the estimated small-world parameters, it also influences the results of between-group differences in small-world parameters. In addition, at higher network densities, the choice of null network influences the direction of group differences in network measures. Our data suggest that the choice of null network is quite crucial for interpretation of group differences in small-world parameters of structural correlation networks. We argue that none of the available null models is perfect for estimation of small-world parameters for correlation networks and the relative strengths and weaknesses of the selected model should be carefully considered with respect to obtained network measures. PMID:23840672

Immunization of Epidemics in Multiplex Networks

PubMed Central

Zhao, Dawei; Wang, Lianhai; Li, Shudong; Wang, Zhen; Wang, Lin; Gao, Bo

2014-01-01

Up to now, immunization of disease propagation has attracted great attention in both theoretical and experimental researches. However, vast majority of existing achievements are limited to the simple assumption of single layer networked population, which seems obviously inconsistent with recent development of complex network theory: each node could possess multiple roles in different topology connections. Inspired by this fact, we here propose the immunization strategies on multiplex networks, including multiplex node-based random (targeted) immunization and layer node-based random (targeted) immunization. With the theory of generating function, theoretical analysis is developed to calculate the immunization threshold, which is regarded as the most critical index for the effectiveness of addressed immunization strategies. Interestingly, both types of random immunization strategies show more efficiency in controlling disease spreading on multiplex Erdös-Rényi (ER) random networks; while targeted immunization strategies provide better protection on multiplex scale-free (SF) networks. PMID:25401755

Immunization of epidemics in multiplex networks.

PubMed

Zhao, Dawei; Wang, Lianhai; Li, Shudong; Wang, Zhen; Wang, Lin; Gao, Bo

2014-01-01

Up to now, immunization of disease propagation has attracted great attention in both theoretical and experimental researches. However, vast majority of existing achievements are limited to the simple assumption of single layer networked population, which seems obviously inconsistent with recent development of complex network theory: each node could possess multiple roles in different topology connections. Inspired by this fact, we here propose the immunization strategies on multiplex networks, including multiplex node-based random (targeted) immunization and layer node-based random (targeted) immunization. With the theory of generating function, theoretical analysis is developed to calculate the immunization threshold, which is regarded as the most critical index for the effectiveness of addressed immunization strategies. Interestingly, both types of random immunization strategies show more efficiency in controlling disease spreading on multiplex Erdös-Rényi (ER) random networks; while targeted immunization strategies provide better protection on multiplex scale-free (SF) networks.

Measuring geographic access to health care: raster and network-based methods

PubMed Central

2012-01-01

Background Inequalities in geographic access to health care result from the configuration of facilities, population distribution, and the transportation infrastructure. In recent accessibility studies, the traditional distance measure (Euclidean) has been replaced with more plausible measures such as travel distance or time. Both network and raster-based methods are often utilized for estimating travel time in a Geographic Information System. Therefore, exploring the differences in the underlying data models and associated methods and their impact on geographic accessibility estimates is warranted. Methods We examine the assumptions present in population-based travel time models. Conceptual and practical differences between raster and network data models are reviewed, along with methodological implications for service area estimates. Our case study investigates Limited Access Areas defined by Michigan’s Certificate of Need (CON) Program. Geographic accessibility is calculated by identifying the number of people residing more than 30 minutes from an acute care hospital. Both network and raster-based methods are implemented and their results are compared. We also examine sensitivity to changes in travel speed settings and population assignment. Results In both methods, the areas identified as having limited accessibility were similar in their location, configuration, and shape. However, the number of people identified as having limited accessibility varied substantially between methods. Over all permutations, the raster-based method identified more area and people with limited accessibility. The raster-based method was more sensitive to travel speed settings, while the network-based method was more sensitive to the specific population assignment method employed in Michigan. Conclusions Differences between the underlying data models help to explain the variation in results between raster and network-based methods. Considering that the choice of data model/method may substantially alter the outcomes of a geographic accessibility analysis, we advise researchers to use caution in model selection. For policy, we recommend that Michigan adopt the network-based method or reevaluate the travel speed assignment rule in the raster-based method. Additionally, we recommend that the state revisit the population assignment method. PMID:22587023

A Deterministic and Random Propagation Study with the Design of an Open Path 320 GHz to 340 GHz Transmissometer

NASA Astrophysics Data System (ADS)

Scally, Lawrence J.

This program was implemented by Lawrence J. Scally for a Ph.D. under the EECE department at the University of Colorado at Boulder with most funding provided by the U.S. Army. Professor Gasiewski is the advisor and guider for the entire program; he has a strong history decades ago in this type of program. This program is developing a more advanced than previous years transmissometer, called Terahertz Atmospheric and Ionospheric Propagation, Absorption and Scattering System (TAIPAS), on an open path between the University of Colorado EE building roof and the mesa on owned by National Institute of Standards and Technology (NIST); NIST has invested money, location and support for the program. Besides designing and building the transmissometer, that has never be accomplished at this level, the system also analyzes the atmospheric propagation of frequencies by scanning between 320 GHz and 340 GHz, which includes the peak absorption frequency at 325.1529 GHz due to water absorption. The processing and characterization of the deterministic and random propagation characteristics of the atmosphere in the real world was significantly started; this will be executed with varies aerosols for decades on the permanently mounted system that is accessible 24/7 via a network over the CU Virtual Private Network (VPN).

Mortality risk prediction in burn injury: Comparison of logistic regression with machine learning approaches.

PubMed

Stylianou, Neophytos; Akbarov, Artur; Kontopantelis, Evangelos; Buchan, Iain; Dunn, Ken W

2015-08-01

Predicting mortality from burn injury has traditionally employed logistic regression models. Alternative machine learning methods have been introduced in some areas of clinical prediction as the necessary software and computational facilities have become accessible. Here we compare logistic regression and machine learning predictions of mortality from burn. An established logistic mortality model was compared to machine learning methods (artificial neural network, support vector machine, random forests and naïve Bayes) using a population-based (England & Wales) case-cohort registry. Predictive evaluation used: area under the receiver operating characteristic curve; sensitivity; specificity; positive predictive value and Youden's index. All methods had comparable discriminatory abilities, similar sensitivities, specificities and positive predictive values. Although some machine learning methods performed marginally better than logistic regression the differences were seldom statistically significant and clinically insubstantial. Random forests were marginally better for high positive predictive value and reasonable sensitivity. Neural networks yielded slightly better prediction overall. Logistic regression gives an optimal mix of performance and interpretability. The established logistic regression model of burn mortality performs well against more complex alternatives. Clinical prediction with a small set of strong, stable, independent predictors is unlikely to gain much from machine learning outside specialist research contexts. Copyright © 2015 Elsevier Ltd and ISBI. All rights reserved.

Data Gathering and Energy Transfer Dilemma in UAV-Assisted Flying Access Network for IoT

PubMed Central

Arabi, Sara; Sadik, Mohamed

2018-01-01

Recently, Unmanned Aerial Vehicles (UAVs) have emerged as an alternative solution to assist wireless networks, thanks to numerous advantages they offer in comparison to terrestrial fixed base stations. For instance, a UAV can be used to embed a flying base station providing an on-demand nomadic access to network services. A UAV can also be used to wirelessly recharge out-of-battery ground devices. In this paper, we aim to deal with both data collection and recharging depleted ground Internet-of-Things (IoT) devices through a UAV station used as a flying base station. To extend the network lifetime, we present a novel use of UAV with energy harvesting module and wireless recharging capabilities. However, the UAV is used as an energy source to empower depleted IoT devices. On one hand, the UAV charges depleted ground IoT devices under three policies: (1) low-battery first scheme; (2) high-battery first scheme; and (3) random scheme. On the other hand, the UAV station collects data from IoT devices that have sufficient energy to transmit their packets, and in the same phase, the UAV exploits the Radio Frequency (RF) signals transmitted by IoT devices to extract and harvest energy. Furthermore, and as the UAV station has a limited coverage time due to its energy constraints, we propose and investigate an efficient trade-off between ground users recharging time and data gathering time. Furthermore, we suggest to control and optimize the UAV trajectory in order to complete its travel within a minimum time, while minimizing the energy spent and/or enhancing the network lifetime. Extensive numerical results and simulations show how the system behaves under different scenarios and using various metrics in which we examine the added value of UAV with energy harvesting module. PMID:29751662

A Statistical Method to Distinguish Functional Brain Networks

PubMed Central

Fujita, André; Vidal, Maciel C.; Takahashi, Daniel Y.

2017-01-01

One major problem in neuroscience is the comparison of functional brain networks of different populations, e.g., distinguishing the networks of controls and patients. Traditional algorithms are based on search for isomorphism between networks, assuming that they are deterministic. However, biological networks present randomness that cannot be well modeled by those algorithms. For instance, functional brain networks of distinct subjects of the same population can be different due to individual characteristics. Moreover, networks of subjects from different populations can be generated through the same stochastic process. Thus, a better hypothesis is that networks are generated by random processes. In this case, subjects from the same group are samples from the same random process, whereas subjects from different groups are generated by distinct processes. Using this idea, we developed a statistical test called ANOGVA to test whether two or more populations of graphs are generated by the same random graph model. Our simulations' results demonstrate that we can precisely control the rate of false positives and that the test is powerful to discriminate random graphs generated by different models and parameters. The method also showed to be robust for unbalanced data. As an example, we applied ANOGVA to an fMRI dataset composed of controls and patients diagnosed with autism or Asperger. ANOGVA identified the cerebellar functional sub-network as statistically different between controls and autism (p < 0.001). PMID:28261045

A Statistical Method to Distinguish Functional Brain Networks.

PubMed

Fujita, André; Vidal, Maciel C; Takahashi, Daniel Y

2017-01-01

One major problem in neuroscience is the comparison of functional brain networks of different populations, e.g., distinguishing the networks of controls and patients. Traditional algorithms are based on search for isomorphism between networks, assuming that they are deterministic. However, biological networks present randomness that cannot be well modeled by those algorithms. For instance, functional brain networks of distinct subjects of the same population can be different due to individual characteristics. Moreover, networks of subjects from different populations can be generated through the same stochastic process. Thus, a better hypothesis is that networks are generated by random processes. In this case, subjects from the same group are samples from the same random process, whereas subjects from different groups are generated by distinct processes. Using this idea, we developed a statistical test called ANOGVA to test whether two or more populations of graphs are generated by the same random graph model. Our simulations' results demonstrate that we can precisely control the rate of false positives and that the test is powerful to discriminate random graphs generated by different models and parameters. The method also showed to be robust for unbalanced data. As an example, we applied ANOGVA to an fMRI dataset composed of controls and patients diagnosed with autism or Asperger. ANOGVA identified the cerebellar functional sub-network as statistically different between controls and autism ( p < 0.001).

Impulsive synchronization of Markovian jumping randomly coupled neural networks with partly unknown transition probabilities via multiple integral approach.

PubMed

Chandrasekar, A; Rakkiyappan, R; Cao, Jinde

2015-10-01

This paper studies the impulsive synchronization of Markovian jumping randomly coupled neural networks with partly unknown transition probabilities via multiple integral approach. The array of neural networks are coupled in a random fashion which is governed by Bernoulli random variable. The aim of this paper is to obtain the synchronization criteria, which is suitable for both exactly known and partly unknown transition probabilities such that the coupled neural network is synchronized with mixed time-delay. The considered impulsive effects can be synchronized at partly unknown transition probabilities. Besides, a multiple integral approach is also proposed to strengthen the Markovian jumping randomly coupled neural networks with partly unknown transition probabilities. By making use of Kronecker product and some useful integral inequalities, a novel Lyapunov-Krasovskii functional was designed for handling the coupled neural network with mixed delay and then impulsive synchronization criteria are solvable in a set of linear matrix inequalities. Finally, numerical examples are presented to illustrate the effectiveness and advantages of the theoretical results. Copyright © 2015 Elsevier Ltd. All rights reserved.

Overload Control for Signaling Congestion of Machine Type Communications in 3GPP Networks

PubMed Central

Lu, Zhaoming; Pan, Qi; Wang, Luhan; Wen, Xiangming

2016-01-01

Because of the limited resources on radio access channels of third generation partnership projection (3GPP) network, one of the most challenging tasks posted by 3GPP cellular-based machine type communications (MTC) is congestion due to massive requests for connection to radio access network (RAN). In this paper, an overload control algorithm in 3GPP RAN is proposed, which proactively disperses the simultaneous access attempts in evenly distributed time window. Through periodic reservation strategy, massive access requests of MTC devices are dispersed in time, which reduces the probability of confliction of signaling. By the compensation and prediction mechanism, each device can communicate with MTC server with dynamic load of air interface. Numerical results prove that proposed method makes MTC applications friendly to 3GPP cellular network. PMID:27936011

Overload Control for Signaling Congestion of Machine Type Communications in 3GPP Networks.

PubMed

Lu, Zhaoming; Pan, Qi; Wang, Luhan; Wen, Xiangming

2016-01-01

Because of the limited resources on radio access channels of third generation partnership projection (3GPP) network, one of the most challenging tasks posted by 3GPP cellular-based machine type communications (MTC) is congestion due to massive requests for connection to radio access network (RAN). In this paper, an overload control algorithm in 3GPP RAN is proposed, which proactively disperses the simultaneous access attempts in evenly distributed time window. Through periodic reservation strategy, massive access requests of MTC devices are dispersed in time, which reduces the probability of confliction of signaling. By the compensation and prediction mechanism, each device can communicate with MTC server with dynamic load of air interface. Numerical results prove that proposed method makes MTC applications friendly to 3GPP cellular network.

Synconset Waves and Chains: Spiking Onsets in Synchronous Populations Predict and Are Predicted by Network Structure

PubMed Central

Raghavan, Mohan; Amrutur, Bharadwaj; Narayanan, Rishikesh; Sikdar, Sujit Kumar

2013-01-01

Synfire waves are propagating spike packets in synfire chains, which are feedforward chains embedded in random networks. Although synfire waves have proved to be effective quantification for network activity with clear relations to network structure, their utilities are largely limited to feedforward networks with low background activity. To overcome these shortcomings, we describe a novel generalisation of synfire waves, and define ‘synconset wave’ as a cascade of first spikes within a synchronisation event. Synconset waves would occur in ‘synconset chains’, which are feedforward chains embedded in possibly heavily recurrent networks with heavy background activity. We probed the utility of synconset waves using simulation of single compartment neuron network models with biophysically realistic conductances, and demonstrated that the spread of synconset waves directly follows from the network connectivity matrix and is modulated by top-down inputs and the resultant oscillations. Such synconset profiles lend intuitive insights into network organisation in terms of connection probabilities between various network regions rather than an adjacency matrix. To test this intuition, we develop a Bayesian likelihood function that quantifies the probability that an observed synfire wave was caused by a given network. Further, we demonstrate it's utility in the inverse problem of identifying the network that caused a given synfire wave. This method was effective even in highly subsampled networks where only a small subset of neurons were accessible, thus showing it's utility in experimental estimation of connectomes in real neuronal-networks. Together, we propose synconset chains/waves as an effective framework for understanding the impact of network structure on function, and as a step towards developing physiology-driven network identification methods. Finally, as synconset chains extend the utilities of synfire chains to arbitrary networks, we suggest utilities of our framework to several aspects of network physiology including cell assemblies, population codes, and oscillatory synchrony. PMID:24116018

Quantum random access memory.

PubMed

Giovannetti, Vittorio; Lloyd, Seth; Maccone, Lorenzo

2008-04-25

A random access memory (RAM) uses n bits to randomly address N=2(n) distinct memory cells. A quantum random access memory (QRAM) uses n qubits to address any quantum superposition of N memory cells. We present an architecture that exponentially reduces the requirements for a memory call: O(logN) switches need be thrown instead of the N used in conventional (classical or quantum) RAM designs. This yields a more robust QRAM algorithm, as it in general requires entanglement among exponentially less gates, and leads to an exponential decrease in the power needed for addressing. A quantum optical implementation is presented.

Ethernet access network based on free-space optic deployment technology

NASA Astrophysics Data System (ADS)

Gebhart, Michael; Leitgeb, Erich; Birnbacher, Ulla; Schrotter, Peter

2004-06-01

The satisfaction of all communication needs from single households and business companies over a single access infrastructure is probably the most challenging topic in communications technology today. But even though the so-called "Last Mile Access Bottleneck" is well known since more than ten years and many distribution technologies have been tried out, the optimal solution has not yet been found and paying commercial access networks offering all service classes are still rare today. Conventional services like telephone, radio and TV, as well as new and emerging services like email, web browsing, online-gaming, video conferences, business data transfer or external data storage can all be transmitted over the well known and cost effective Ethernet networking protocol standard. Key requirements for the deployment technology driven by the different services are high data rates to the single customer, security, moderate deployment costs and good scalability to number and density of users, quick and flexible deployment without legal impediments and high availability, referring to the properties of optical and wireless communication. We demonstrate all elements of an Ethernet Access Network based on Free Space Optic distribution technology. Main physical parts are Central Office, Distribution Network and Customer Equipment. Transmission of different services, as well as configuration, service upgrades and remote control of the network are handled by networking features over one FSO connection. All parts of the network are proven, the latest commercially available technology. The set up is flexible and can be adapted to any more specific need if required.

Use of a web 2.0 portal to improve education and communication in young patients with families: randomized controlled trial.

PubMed

Hanberger, Lena; Ludvigsson, Johnny; Nordfeldt, Sam

2013-08-23

Diabetes requires extensive self-care and comprehensive knowledge, making patient education central to diabetes self-management. Web 2.0 systems have great potential to enhance health information and open new ways for patients and practitioners to communicate. To develop a Web portal designed to facilitate self-management, including diabetes-related information and social networking functions, and to study its use and effects in pediatric patients with diabetes. A Web 2.0 portal was developed in collaboration with patients, parents, and practitioners. It offered communication with local practitioners, interaction with peers, and access to relevant information and services. Children and adolescents with diabetes in a geographic population of two pediatric clinics in Sweden were randomized to a group receiving passwords for access to the portal or a control group with no access (n=230) for 1 year. All subjects had access during a second study year. Users' activity was logged by site and page visits. Health-related quality of life (HRQOL), empowerment (DES), and quality of information (QPP) questionnaires were given at baseline and after 1 and 2 study years. Clinical data came from the Swedish pediatric diabetes quality registry SWEDIABKIDS. There was a continuous flow of site visits, decreasing in summer and Christmas periods. In 119/233 families (51%), someone visited the portal the first study year and 169/484 (35%) the second study year. The outcome variables did not differ between intervention and control group. No adverse treatment or self-care effects were identified. A higher proportion of mothers compared to fathers visited once or more the first year (P<.001) and the second year (P<.001). The patients who had someone in the family visiting the portal 5 times or more, had shorter diabetes duration (P=.006), were younger (P=.008), had lower HbA1c after 1 year of access (P=.010), and were more often girls (P<.001). Peer interaction seems to be a valued aspect. The Web 2.0 portal may be useful as a complement to traditional care for this target group. Widespread use of a portal would need integration in routine care and promotion by diabetes team members. International Standard Randomized Controlled Trial Number (ISRCTN):92107365; http://www.controlled-trials.com/ISRCTN92107365/ (Archived by WebCite at http://webcitation.org/6IkiIvtSb).

Blackmail propagation on small-world networks

NASA Astrophysics Data System (ADS)

Shao, Zhi-Gang; Jian-Ping Sang; Zou, Xian-Wu; Tan, Zhi-Jie; Jin, Zhun-Zhi

2005-06-01

The dynamics of the blackmail propagation model based on small-world networks is investigated. It is found that for a given transmitting probability λ the dynamical behavior of blackmail propagation transits from linear growth type to logistical growth one with the network randomness p increases. The transition takes place at the critical network randomness pc=1/N, where N is the total number of nodes in the network. For a given network randomness p the dynamical behavior of blackmail propagation transits from exponential decrease type to logistical growth one with the transmitting probability λ increases. The transition occurs at the critical transmitting probability λc=1/, where is the average number of the nearest neighbors. The present work will be useful for understanding computer virus epidemics and other spreading phenomena on communication and social networks.

75 FR 14467 - In the Matter of: Certain Dynamic Random Access Memory Semiconductors and Products Containing...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-03-25

... Access Memory Semiconductors and Products Containing Same, Including Memory Modules; Notice of... the sale within the United States after importation of certain dynamic random access memory semiconductors and products containing same, including memory modules, by reason of infringement of certain...

A CoAP-Based Network Access Authentication Service for Low-Power Wide Area Networks: LO-CoAP-EAP.

PubMed

Garcia-Carrillo, Dan; Marin-Lopez, Rafael; Kandasamy, Arunprabhu; Pelov, Alexander

2017-11-17

The Internet-of-Things (IoT) landscape is expanding with new radio technologies. In addition to the Low-Rate Wireless Personal Area Network (LR-WPAN), the recent set of technologies conforming the so-called Low-Power Wide Area Networks (LP-WAN) offers long-range communications, allowing one to send small pieces of information at a reduced energy cost, which promotes the creation of new IoT applications and services. However, LP-WAN technologies pose new challenges since they have strong limitations in the available bandwidth. In general, a first step prior to a smart object being able to gain access to the network is the process of network access authentication. It involves authentication, authorization and key management operations. This process is of vital importance for operators to control network resources. However, proposals for managing network access authentication in LP-WAN are tailored to the specifics of each technology, which could introduce interoperability problems in the future. In this sense, little effort has been put so far into providing a wireless-independent solution for network access authentication in the area of LP-WAN. To fill this gap, we propose a service named Low-Overhead CoAP-EAP (LO-CoAP-EAP), which is based on previous work designed for LR-WPAN. LO-CoAP-EAP integrates the use of Authentication, Authorization and Accounting (AAA) infrastructures and the Extensible Authentication Protocol (EAP) protocol. For this integration, we use the Constrained Application Protocol (CoAP) to design a network authentication service independent of the type of LP-WAN technology. LO-CoAP-EAP represents a trade-off between flexibility, wireless technology independence, scalability and performance in LP-WAN.

A CoAP-Based Network Access Authentication Service for Low-Power Wide Area Networks: LO-CoAP-EAP

PubMed Central

Garcia-Carrillo, Dan; Marin-Lopez, Rafael; Kandasamy, Arunprabhu; Pelov, Alexander

2017-01-01

The Internet-of-Things (IoT) landscape is expanding with new radio technologies. In addition to the Low-Rate Wireless Personal Area Network (LR-WPAN), the recent set of technologies conforming the so-called Low-Power Wide Area Networks (LP-WAN) offers long-range communications, allowing one to send small pieces of information at a reduced energy cost, which promotes the creation of new IoT applications and services. However, LP-WAN technologies pose new challenges since they have strong limitations in the available bandwidth. In general, a first step prior to a smart object being able to gain access to the network is the process of network access authentication. It involves authentication, authorization and key management operations. This process is of vital importance for operators to control network resources. However, proposals for managing network access authentication in LP-WAN are tailored to the specifics of each technology, which could introduce interoperability problems in the future. In this sense, little effort has been put so far into providing a wireless-independent solution for network access authentication in the area of LP-WAN. To fill this gap, we propose a service named Low-Overhead CoAP-EAP (LO-CoAP-EAP), which is based on previous work designed for LR-WPAN. LO-CoAP-EAP integrates the use of Authentication, Authorization and Accounting (AAA) infrastructures and the Extensible Authentication Protocol (EAP) protocol. For this integration, we use the Constrained Application Protocol (CoAP) to design a network authentication service independent of the type of LP-WAN technology. LO-CoAP-EAP represents a trade-off between flexibility, wireless technology independence, scalability and performance in LP-WAN. PMID:29149040

Randomizing bipartite networks: the case of the World Trade Web.

PubMed

Saracco, Fabio; Di Clemente, Riccardo; Gabrielli, Andrea; Squartini, Tiziano

2015-06-01

Within the last fifteen years, network theory has been successfully applied both to natural sciences and to socioeconomic disciplines. In particular, bipartite networks have been recognized to provide a particularly insightful representation of many systems, ranging from mutualistic networks in ecology to trade networks in economy, whence the need of a pattern detection-oriented analysis in order to identify statistically-significant structural properties. Such an analysis rests upon the definition of suitable null models, i.e. upon the choice of the portion of network structure to be preserved while randomizing everything else. However, quite surprisingly, little work has been done so far to define null models for real bipartite networks. The aim of the present work is to fill this gap, extending a recently-proposed method to randomize monopartite networks to bipartite networks. While the proposed formalism is perfectly general, we apply our method to the binary, undirected, bipartite representation of the World Trade Web, comparing the observed values of a number of structural quantities of interest with the expected ones, calculated via our randomization procedure. Interestingly, the behavior of the World Trade Web in this new representation is strongly different from the monopartite analogue, showing highly non-trivial patterns of self-organization.

Social capital and administrative contextual determinants of lack of access to a regular doctor: a multilevel analysis in southern Sweden.

PubMed

Lindström, Martin; Axén, Elin; Lindström, Christine; Beckman, Anders; Moghaddassi, Mahnaz; Merlo, Juan

2006-12-01

The aim of this study was to investigate the influence of contextual (social capital and administrative/neo-materialist) and individual factors on lack of access to a regular doctor. The 2000 public health survey in Scania is a cross-sectional study. A total of 13,715 persons answered a postal questionnaire, which is 59% of the random sample. A multilevel logistic regression model, with individuals at the first level and municipalities at the second, was performed. The effect (intra-class correlations, cross-level modification and odds ratios) of individual and municipality (social capital and health care district) factors on lack of access to a regular doctor was analysed using simulation method. The Deviance Information Criterion (DIC) was used as information criterion for the models. The second level municipality variance in lack of access to a regular doctor is substantial even in the final models with all individual and contextual variables included. The model that results in the largest reduction in DIC is the model including age, sex and individual social participation (which is a network aspect of social capital), but the models which include administrative and social capital second level factors also reduced the DIC values. This study suggests that both administrative health care district and social capital may partly explain the individual's self reported lack of access to a regular doctor.

A registry-based randomized trial comparing radial and femoral approaches in women undergoing percutaneous coronary intervention: the SAFE-PCI for Women (Study of Access Site for Enhancement of PCI for Women) trial.

PubMed

Rao, Sunil V; Hess, Connie N; Barham, Britt; Aberle, Laura H; Anstrom, Kevin J; Patel, Tejan B; Jorgensen, Jesse P; Mazzaferri, Ernest L; Jolly, Sanjit S; Jacobs, Alice; Newby, L Kristin; Gibson, C Michael; Kong, David F; Mehran, Roxana; Waksman, Ron; Gilchrist, Ian C; McCourt, Brian J; Messenger, John C; Peterson, Eric D; Harrington, Robert A; Krucoff, Mitchell W

2014-08-01

This study sought to determine the effect of radial access on outcomes in women undergoing percutaneous coronary intervention (PCI) using a registry-based randomized trial. Women are at increased risk of bleeding and vascular complications after PCI. The role of radial access in women is unclear. Women undergoing cardiac catheterization or PCI were randomized to radial or femoral arterial access. Data from the CathPCI Registry and trial-specific data were merged into a final study database. The primary efficacy endpoint was Bleeding Academic Research Consortium type 2, 3, or 5 bleeding or vascular complications requiring intervention. The primary feasibility endpoint was access site crossover. The primary analysis cohort was the subgroup undergoing PCI; sensitivity analyses were conducted in the total randomized population. The trial was stopped early for a lower than expected event rate. A total of 1,787 women (691 undergoing PCI) were randomized at 60 sites. There was no significant difference in the primary efficacy endpoint between radial or femoral access among women undergoing PCI (radial 1.2% vs. 2.9% femoral, odds ratio [OR]: 0.39; 95% confidence interval [CI]: 0.12 to 1.27); among women undergoing cardiac catheterization or PCI, radial access significantly reduced bleeding and vascular complications (0.6% vs. 1.7%; OR: 0.32; 95% CI: 0.12 to 0.90). Access site crossover was significantly higher among women assigned to radial access (PCI cohort: 6.1% vs. 1.7%; OR: 3.65; 95% CI: 1.45 to 9.17); total randomized cohort: (6.7% vs. 1.9%; OR: 3.70; 95% CI: 2.14 to 6.40). More women preferred radial access. In this pragmatic trial, which was terminated early, the radial approach did not significantly reduce bleeding or vascular complications in women undergoing PCI. Access site crossover occurred more often in women assigned to radial access. (SAFE-PCI for Women; NCT01406236). Copyright © 2014 American College of Cardiology Foundation. Published by Elsevier Inc. All rights reserved.

Full-band TDM-OPDMA for OBI-reduced simultaneous multiple access in a single-wavelength optical access network.

PubMed

Jung, Sun-Young; Kim, Chang-Hun; Han, Sang-Kook

2018-05-14

Simultaneous multiple access (MA) within a single wavelength can increase the data rate and split ratio in a passive optical network while optical beat interference (OBI) becomes serious in the uplink. Previous techniques to reduce OBI were limited by their complexity and lack of extendibility; as well, bandwidth allocation among MA signals is needed for single photo diode (PD) detection. We proposed and experimentally demonstrated full-band optical pulse division multiplexing-based MA (OPDMA) in an optical access network, which can effectively reduce OBI with extendibility and fully utilize frequency resources of optical modulator without bandwidth allocation in a single-wavelength MA.

Policy Issues in Computer Networks: Multi-Access Information Systems.

ERIC Educational Resources Information Center

Lyons, Patrice A.

As computer databases become more publicly accessible through public networks, there is a growing need to provide effective protection for proprietary information. Without adequate assurances that their works will be protected, authors and other copyright owners may be reluctant to allow the full text of their works to be accessed through computer…

User Procedures Standardization for Network Access. NBS Technical Note 799.

ERIC Educational Resources Information Center

Neumann, A. J.

User access procedures to information systems have become of crucial importance with the advent of computer networks, which have opened new types of resources to a broad spectrum of users. This report surveys user access protocols of six representative systems: BASIC, GE MK II, INFONET, MEDLINE, NIC/ARPANET and SPIRES. Functional access…

The Cybermobile: A Gateway for Public Access to Network-Based Information.

ERIC Educational Resources Information Center

Drumm, John E.; Groom, Frank M.

1997-01-01

Though the bookmobile has fallen on hard times, the cybermobile, a technology platform combining personal computing, CD-ROMs, fiber network, and wireless access to the Internet, may be the next step in mobile library services. Discusses standard vehicle, computer hardware, software, wireless access, and alliances with users, vendors, and community…

Accessibility and Integrity of Networked Information Collections. Background Paper.

ERIC Educational Resources Information Center

Lynch, Clifford A.

This paper considers questions related to the integrity and accessibility of new electronic information resources. It begins with a review of recent developments in networked information resources and the tools to identify, navigate, and use such resources. An overview is then given of the issues involved in access and integrity questions. Links…

Epidemic transmission on random mobile network with diverse infection periods

NASA Astrophysics Data System (ADS)

Li, Kezan; Yu, Hong; Zeng, Zhaorong; Ding, Yong; Ma, Zhongjun

2015-05-01

The heterogeneity of individual susceptibility and infectivity and time-varying topological structure are two realistic factors when we study epidemics on complex networks. Current research results have shown that the heterogeneity of individual susceptibility and infectivity can increase the epidemic threshold in a random mobile dynamical network with the same infection period. In this paper, we will focus on random mobile dynamical networks with diverse infection periods due to people's different constitutions and external circumstances. Theoretical results indicate that the epidemic threshold of the random mobile network with diverse infection periods is larger than the counterpart with the same infection period. Moreover, the heterogeneity of individual susceptibility and infectivity can play a significant impact on disease transmission. In particular, the homogeneity of individuals will avail to the spreading of epidemics. Numerical examples verify further our theoretical results very well.

Analytical connection between thresholds and immunization strategies of SIS model in random networks

NASA Astrophysics Data System (ADS)

Zhou, Ming-Yang; Xiong, Wen-Man; Liao, Hao; Wang, Tong; Wei, Zong-Wen; Fu, Zhong-Qian

2018-05-01

Devising effective strategies for hindering the propagation of viruses and protecting the population against epidemics is critical for public security and health. Despite a number of studies based on the susceptible-infected-susceptible (SIS) model devoted to this topic, we still lack a general framework to compare different immunization strategies in completely random networks. Here, we address this problem by suggesting a novel method based on heterogeneous mean-field theory for the SIS model. Our method builds the relationship between the thresholds and different immunization strategies in completely random networks. Besides, we provide an analytical argument that the targeted large-degree strategy achieves the best performance in random networks with arbitrary degree distribution. Moreover, the experimental results demonstrate the effectiveness of the proposed method in both artificial and real-world networks.

Power Allocation and Outage Probability Analysis for SDN-based Radio Access Networks

NASA Astrophysics Data System (ADS)

Zhao, Yongxu; Chen, Yueyun; Mai, Zhiyuan

2018-01-01

In this paper, performance of Access network Architecture based SDN (Software Defined Network) is analyzed with respect to the power allocation issue. A power allocation scheme PSO-PA (Particle Swarm Optimization-power allocation) algorithm is proposed, the proposed scheme is subjected to constant total power with the objective of minimizing system outage probability. The entire access network resource configuration is controlled by the SDN controller, then it sends the optimized power distribution factor to the base station source node (SN) and the relay node (RN). Simulation results show that the proposed scheme reduces the system outage probability at a low complexity.

Research on an uplink carrier sense multiple access algorithm of large indoor visible light communication networks based on an optical hard core point process.

PubMed

Nan, Zhufen; Chi, Xuefen

2016-12-20

The IEEE 802.15.7 protocol suggests that it could coordinate the channel access process based on the competitive method of carrier sensing. However, the directionality of light and randomness of diffuse reflection would give rise to a serious imperfect carrier sense (ICS) problem [e.g., hidden node (HN) problem and exposed node (EN) problem], which brings great challenges in realizing the optical carrier sense multiple access (CSMA) mechanism. In this paper, the carrier sense process implemented by diffuse reflection light is modeled as the choice of independent sets. We establish an ICS model with the presence of ENs and HNs for the multi-point to multi-point visible light communication (VLC) uplink communications system. Considering the severe optical ICS problem, an optical hard core point process (OHCPP) is developed, which characterizes the optical CSMA for the indoor VLC uplink communications system. Due to the limited coverage of the transmitted optical signal, in our OHCPP, the ENs within the transmitters' carrier sense region could be retained provided that they could not corrupt the ongoing communications. Moreover, because of the directionality of both light emitting diode (LED) transmitters and receivers, theoretical analysis of the HN problem becomes difficult. In this paper, we derive the closed-form expression for approximating the outage probability and transmission capacity of VLC networks with the presence of HNs and ENs. Simulation results validate the analysis and also show the existence of an optimal physical carrier-sensing threshold that maximizes the transmission capacity for a given emission angle of LED.

Efficient traffic grooming with dynamic ONU grouping for multiple-OLT-based access network

NASA Astrophysics Data System (ADS)

Zhang, Shizong; Gu, Rentao; Ji, Yuefeng; Wang, Hongxiang

2015-12-01

Fast bandwidth growth urges large-scale high-density access scenarios, where the multiple Passive Optical Networking (PON) system clustered deployment can be adopted as an appropriate solution to fulfill the huge bandwidth demands, especially for a future 5G mobile network. However, the lack of interaction between different optical line terminals (OLTs) results in part of the bandwidth resources waste. To increase the bandwidth efficiency, as well as reduce bandwidth pressure at the edge of a network, we propose a centralized flexible PON architecture based on Time- and Wavelength-Division Multiplexing PON (TWDM PON). It can provide flexible affiliation for optical network units (ONUs) and different OLTs to support access network traffic localization. Specifically, a dynamic ONU grouping algorithm (DGA) is provided to obtain the minimal OLT outbound traffic. Simulation results show that DGA obtains an average 25.23% traffic gain increment under different OLT numbers within a small ONU number situation, and the traffic gain will increase dramatically with the increment of the ONU number. As the DGA can be deployed easily as an application running above the centralized control plane, the proposed architecture can be helpful to improve the network efficiency for future traffic-intensive access scenarios.

Experiments and Analysis on a Computer Interface to an Information-Retrieval Network.

ERIC Educational Resources Information Center

Marcus, Richard S.; Reintjes, J. Francis

A primary goal of this project was to develop an interface that would provide direct access for inexperienced users to existing online bibliographic information retrieval networks. The experiment tested the concept of a virtual-system mode of access to a network of heterogeneous interactive retrieval systems and databases. An experimental…

76 FR 36154 - In the Matter of Certain Equipment for Communications Networks, Including Switches, Routers...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-06-21

... Communications Networks, Including Switches, Routers, Gateways, Bridges, Wireless Access Points, Cable Modems, IP... networks, including switches, routers, gateways, bridges, wireless access points, cable modems, IP phones... points, cable modems, IP phones, and products containing same that infringe one or more of claims 1, 5, 9...

Patent citation network in nanotechnology (1976-2004)

NASA Astrophysics Data System (ADS)

Li, Xin; Chen, Hsinchun; Huang, Zan; Roco, Mihail C.

2007-06-01

The patent citation networks are described using critical node, core network, and network topological analysis. The main objective is understanding of the knowledge transfer processes between technical fields, institutions and countries. This includes identifying key influential players and subfields, the knowledge transfer patterns among them, and the overall knowledge transfer efficiency. The proposed framework is applied to the field of nanoscale science and engineering (NSE), including the citation networks of patent documents, submitting institutions, technology fields, and countries. The NSE patents were identified by keywords "full-text" searching of patents at the United States Patent and Trademark Office (USPTO). The analysis shows that the United States is the most important citation center in NSE research. The institution citation network illustrates a more efficient knowledge transfer between institutions than a random network. The country citation network displays a knowledge transfer capability as efficient as a random network. The technology field citation network and the patent document citation network exhibit a␣less efficient knowledge diffusion capability than a random network. All four citation networks show a tendency to form local citation clusters.

Application of stochastic processes in random growth and evolutionary dynamics

NASA Astrophysics Data System (ADS)

Oikonomou, Panagiotis

We study the effect of power-law distributed randomness on the dynamical behavior of processes such as stochastic growth patterns and evolution. First, we examine the geometrical properties of random shapes produced by a generalized stochastic Loewner Evolution driven by a superposition of a Brownian motion and a stable Levy process. The situation is defined by the usual stochastic Loewner Evolution parameter, kappa, as well as alpha which defines the power-law tail of the stable Levy distribution. We show that the properties of these patterns change qualitatively and singularly at critical values of kappa and alpha. It is reasonable to call such changes "phase transitions". These transitions occur as kappa passes through four and as alpha passes through one. Numerical simulations are used to explore the global scaling behavior of these patterns in each "phase". We show both analytically and numerically that the growth continues indefinitely in the vertical direction for alpha greater than 1, goes as logarithmically with time for alpha equals to 1, and saturates for alpha smaller than 1. The probability density has two different scales corresponding to directions along and perpendicular to the boundary. Scaling functions for the probability density are given for various limiting cases. Second, we study the effect of the architecture of biological networks on their evolutionary dynamics. In recent years, studies of the architecture of large networks have unveiled a common topology, called scale-free, in which a majority of the elements are poorly connected except for a small fraction of highly connected components. We ask how networks with distinct topologies can evolve towards a pre-established target phenotype through a process of random mutations and selection. We use networks of Boolean components as a framework to model a large class of phenotypes. Within this approach, we find that homogeneous random networks and scale-free networks exhibit drastically different evolutionary paths. While homogeneous random networks accumulate neutral mutations and evolve by sparse punctuated steps, scale-free networks evolve rapidly and continuously towards the target phenotype. Moreover, we show that scale-free networks always evolve faster than homogeneous random networks; remarkably, this property does not depend on the precise value of the topological parameter. By contrast, homogeneous random networks require a specific tuning of their topological parameter in order to optimize their fitness. This model suggests that the evolutionary paths of biological networks, punctuated or continuous, may solely be determined by the network topology.

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

Garlapati, Shravan K; Kuruganti, Phani Teja; Buehrer, Richard M

The deployment of advanced metering infrastructure by the electric utilities poses unique communication challenges, particularly as the number of meters per aggregator increases. During a power outage, a smart meter tries to report it instantaneously to the electric utility. In a densely populated residential/industrial locality, it is possible that a large number of smart meters simultaneously try to get access to the communication network to report the power outage. If the number of smart meters is very high of the order of tens of thousands (metropolitan areas), the power outage data flooding can lead to Random Access CHannel (RACH) congestion.more » Several utilities are considering the use of cellular network for smart meter communications. In 3G/4G cellular networks, RACH congestion not only leads to collisions, retransmissions and increased RACH delays, but also has the potential to disrupt the dedicated traffic flow by increasing the interference levels (3G CDMA). In order to overcome this problem, in this paper we propose a Time Hierarchical Scheme (THS) that reduces the intensity of power outage data flooding and power outage reporting delay by 6/7th, and 17/18th when compared to their respective values without THS. Also, we propose an Optimum Transmission Rate Adaptive (OTRA) MAC to optimize the latency in power outage data collection. The analysis and simulation results presented in this paper show that both the OTRA and THS features of the proposed MAC results in a Power Outage Data Collection Latency (PODCL) that is 1/10th of the 4G LTE PODCL.« less

Vulnerability of complex networks

NASA Astrophysics Data System (ADS)

Mishkovski, Igor; Biey, Mario; Kocarev, Ljupco

2011-01-01

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

A Web-Based, Social Networking Physical Activity Intervention for Insufficiently Active Adults Delivered via Facebook App: Randomized Controlled Trial

PubMed Central

Ferguson, Monika; Vandelanotte, Corneel; Plotnikoff, Ron; De Bourdeaudhuij, Ilse; Thomas, Samantha; Nelson-Field, Karen; Olds, Tim

2015-01-01

Background Online social networks offer considerable potential for delivery of socially influential health behavior change interventions. Objective To determine the efficacy, engagement, and feasibility of an online social networking physical activity intervention with pedometers delivered via Facebook app. Methods A total of 110 adults with a mean age of 35.6 years (SD 12.4) were recruited online in teams of 3 to 8 friends. Teams were randomly allocated to receive access to a 50-day online social networking physical activity intervention which included self-monitoring, social elements, and pedometers (“Active Team” Facebook app; n=51 individuals, 12 teams) or a wait-listed control condition (n=59 individuals, 13 teams). Assessments were undertaken online at baseline, 8 weeks, and 20 weeks. The primary outcome measure was self-reported weekly moderate-to-vigorous physical activity (MVPA). Secondary outcomes were weekly walking, vigorous physical activity time, moderate physical activity time, overall quality of life, and mental health quality of life. Analyses were undertaken using random-effects mixed modeling, accounting for potential clustering at the team level. Usage statistics were reported descriptively to determine engagement and feasibility. Results At the 8-week follow-up, the intervention participants had significantly increased their total weekly MVPA by 135 minutes relative to the control group (P=.03), due primarily to increases in walking time (155 min/week increase relative to controls, P<.001). However, statistical differences between groups for total weekly MVPA and walking time were lost at the 20-week follow-up. There were no significant changes in vigorous physical activity, nor overall quality of life or mental health quality of life at either time point. High levels of engagement with the intervention, and particularly the self-monitoring features, were observed. Conclusions An online, social networking physical activity intervention with pedometers can produce sizable short-term physical activity changes. Future work is needed to determine how to maintain behavior change in the longer term, how to reach at-need populations, and how to disseminate such interventions on a mass scale. Trial Registration Australian New Zealand Clinical Trials Registry (ANZCTR): ACTRN12614000488606; https://www.anzctr.org.au/Trial/Registration/TrialReview.aspx?id=366239 (Archived by WebCite at http://www.webcitation.org/6ZVtu6TMz). PMID:26169067

HIV incidence among people who inject drugs (PWID) in Ukraine: results from a clustered randomized trial

PubMed Central

Davis, Jonathan M.; Dvoryak, Sergey; Brewster, John T.; Lisovska, Oksana; Strathdee, Steffanie A.; Latkin, Carl A.

2016-01-01

Summary Background In this study, we sought to assess whether a social network intervention was superior to HIV testing and counseling in impacting HIV incidence among PWID. Although this was not a primary study aim, it is associated with reducing drug and sex risk behaviors, which were primary aims. Methods PWID were recruited from street settings in Odessa, Donetsk, and Nikolayev, Ukraine for a clustered randomized clinical trial (RCT). “Index” or peer leaders, along with two of their network members, were randomly assigned to testing and counseling block (N=589) or testing and counseling plus a social network intervention block (N=611). Participants in the network intervention received 5-sessions to train their network members in risk reduction. Those assigned testing and counseling received no further intervention following counseling. Employing an intent to treat analyses, the primary outcome was HIV sero-conversion using Cox regression and incorporating a gamma frailty term to account for clustering. No stratification or minimization was utilized. The trail was registered with ClinicalTrial.gov, NCT01159704. Findings Between July 12, 2010 and November 23, 2012, 2,304 PWID were recruited, 1,200 of whom were HIV negative and included in the present study. At baseline, there were no significant differences between groups. Of the 1,200 HIV negative participants, 1,085 (90.4%) were retained at 12 months. Incidence density revealed 18.45 (95% CI 14.87 – 22.03, 102 events in 553.0 py) per 100 person years (py) for those in the intervention group and 31.78 (95% CI 26.83–36.74, 158 events in 497.1 py) per 100 py among control arm participants. This corresponded to a reduced hazard in the intervention group, HR= 0.53 (95% CI 0.38, 0.76, p =0.0003). There were no study-related adverse events. Interpretation These data provide strong support for integrating peer education into comprehensive HIV prevention programs for PWID and suggest the value in developing and testing peer-led interventions for improving access and adherence to PrEP and ART. Funding This study was funded by the National Institute on Drug Abuse (RO1 DA026739). PMID:27658879

A Web-Based, Social Networking Physical Activity Intervention for Insufficiently Active Adults Delivered via Facebook App: Randomized Controlled Trial.

PubMed

Maher, Carol; Ferguson, Monika; Vandelanotte, Corneel; Plotnikoff, Ron; De Bourdeaudhuij, Ilse; Thomas, Samantha; Nelson-Field, Karen; Olds, Tim

2015-07-13

Online social networks offer considerable potential for delivery of socially influential health behavior change interventions. To determine the efficacy, engagement, and feasibility of an online social networking physical activity intervention with pedometers delivered via Facebook app. A total of 110 adults with a mean age of 35.6 years (SD 12.4) were recruited online in teams of 3 to 8 friends. Teams were randomly allocated to receive access to a 50-day online social networking physical activity intervention which included self-monitoring, social elements, and pedometers ("Active Team" Facebook app; n=51 individuals, 12 teams) or a wait-listed control condition (n=59 individuals, 13 teams). Assessments were undertaken online at baseline, 8 weeks, and 20 weeks. The primary outcome measure was self-reported weekly moderate-to-vigorous physical activity (MVPA). Secondary outcomes were weekly walking, vigorous physical activity time, moderate physical activity time, overall quality of life, and mental health quality of life. Analyses were undertaken using random-effects mixed modeling, accounting for potential clustering at the team level. Usage statistics were reported descriptively to determine engagement and feasibility. At the 8-week follow-up, the intervention participants had significantly increased their total weekly MVPA by 135 minutes relative to the control group (P=.03), due primarily to increases in walking time (155 min/week increase relative to controls, P<.001). However, statistical differences between groups for total weekly MVPA and walking time were lost at the 20-week follow-up. There were no significant changes in vigorous physical activity, nor overall quality of life or mental health quality of life at either time point. High levels of engagement with the intervention, and particularly the self-monitoring features, were observed. An online, social networking physical activity intervention with pedometers can produce sizable short-term physical activity changes. Future work is needed to determine how to maintain behavior change in the longer term, how to reach at-need populations, and how to disseminate such interventions on a mass scale. Australian New Zealand Clinical Trials Registry (ANZCTR): ACTRN12614000488606; https://www.anzctr.org.au/Trial/Registration/TrialReview.aspx?id=366239 (Archived by WebCite at http://www.webcitation.org/6ZVtu6TMz).

A simple, effective media access protocol system for integrated, high data rate networks

NASA Technical Reports Server (NTRS)

Foudriat, E. C.; Maly, K.; Overstreet, C. M.; Khanna, S.; Zhang, L.

1992-01-01

The operation and performance of a dual media access protocol for integrated, gigabit networks are described. Unlike other dual protocols, each protocol supports a different class of traffic. The Carrier Sensed Multiple Access-Ring Network (CSMA/RN) protocol and the Circulating Reservation Packet (CRP) protocol support asynchronous and synchronous traffic, respectively. The two protocols operate with minimal impact upon each other. Performance information demonstrates that they support a complete range of integrated traffic loads, do not require call setup/termination or a special node for synchronous traffic control, and provide effective pre-use and recovery. The CRP also provides guaranteed access and fairness control for the asynchronous system. The paper demonstrates that the CSMA-CRP system fulfills many of the requirements for gigabit LAN-MAN networks most effectively and simply. To accomplish this, CSMA-CRP features are compared against similar ring and bus systems, such as Cambridge Fast Ring, Metaring, Cyclic Reservation Multiple Access, and Distributed Dual Queue Data Bus (DQDB).

Mobile access to the Internet: from personal bubble to satellites

NASA Astrophysics Data System (ADS)

Gerla, Mario

2001-10-01

Mobile, wireless access and networking has emerged in the last few years as one of the most important directions of Internet growth. The popularity of mobile, and, more generally, nomadic Internet access is due to many enabling factors including: (a) emergence of meaningful applications tailored to the individual on the move; (b) small form factor and long battery life; (c) efficient middleware designed to support mobility; and, (d) efficient wireless networking technologies. A key player in the mobile Internet access is the nomad, i.e. the individual equipped with various computing and I/O gadgets (cellular phone, earphones, GPS navigator, palm pilot, beeper, portable scanner, digital camera, etc.). These devices form his/her Personal Area Network or PAN or personal bubble. The connectivity within the bubble is wireless (using for example a low cost, low power wireless LAN such as Bluetooth). The bubble can expand and contract dynamically depending on needs. It may temporarily include sensors and actuators as the nomad walks into a new environment. In this paper, we identify the need for the interconnection of the PAN with other wireless networks in order to achieve costeffective mobile access to the Internet. We will overview some key networking technologies required to support the PAN (eg, Bluetooth). We will also discuss an emerging technology, Ad Hoc wireless networking which is the natural complement of the PAN in sparsely populated areas. Finally, we will identify the need for intelligent routers to assist the mobile user in the selection of the best Internet access strategy.

Rural considerations in establishing network adequacy standards for qualified health plans in state and regional health insurance exchanges.

PubMed

Talbot, Jean A; Coburn, Andrew; Croll, Zach; Ziller, Erika

2013-06-01

The Affordable Care Act (ACA) requires Health Insurance Exchanges (HIEs) to specify network adequacy standards for the Qualified Health Plans (QHPs) they offer to consumers. This article examines rural issues surrounding network adequacy standards, and offers recommendations for crafting standards that optimize rural access. This policy analysis reviews ACA requirements for QHP network adequacy standards, considering Medicaid managed care and Medicare Advantage (MA) standards as models. We analyze the implications of stringent vs flexible access standards in terms of how choices might affect health plans' participation in rural markets and rural enrollees' access to care. Finally, we propose strategies for designing standards with the degree of flexibility most likely to benefit rural consumers. A traditional approach to safeguarding rural access is to impose strict network adequacy standards on plans in rural areas. However, if strict standards prove difficult to meet due to rural provider scarcity, they might diminish QHPs' willingness to serve rural areas. Thus, they could exacerbate rather than alleviate rural access problems. To benefit rural communities, network adequacy standards must be strong enough to provide real protections for beneficiaries, yet flexible enough to accommodate rural delivery system constraints and remain attainable for QHPs. Useful strategies to achieve this balance might include: adjusting standards according to degrees of rurality and rural utilization norms; counting midlevel clinicians toward fulfillment of patient-provider ratios; and allowing plans to ensure rural access through delivery system innovations such as telehealth. © 2013 National Rural Health Association.

Dynamic Resource Allocation and Access Class Barring Scheme for Delay-Sensitive Devices in Machine to Machine (M2M) Communications.

PubMed

Li, Ning; Cao, Chao; Wang, Cong

2017-06-15

Supporting simultaneous access of machine-type devices is a critical challenge in machine-to-machine (M2M) communications. In this paper, we propose an optimal scheme to dynamically adjust the Access Class Barring (ACB) factor and the number of random access channel (RACH) resources for clustered machine-to-machine (M2M) communications, in which Delay-Sensitive (DS) devices coexist with Delay-Tolerant (DT) ones. In M2M communications, since delay-sensitive devices share random access resources with delay-tolerant devices, reducing the resources consumed by delay-sensitive devices means that there will be more resources available to delay-tolerant ones. Our goal is to optimize the random access scheme, which can not only satisfy the requirements of delay-sensitive devices, but also take the communication quality of delay-tolerant ones into consideration. We discuss this problem from the perspective of delay-sensitive services by adjusting the resource allocation and ACB scheme for these devices dynamically. Simulation results show that our proposed scheme realizes good performance in satisfying the delay-sensitive services as well as increasing the utilization rate of the random access resources allocated to them.

Random walks with long-range steps generated by functions of Laplacian matrices

NASA Astrophysics Data System (ADS)

Riascos, A. P.; Michelitsch, T. M.; Collet, B. A.; Nowakowski, A. F.; Nicolleau, F. C. G. A.

2018-04-01

In this paper, we explore different Markovian random walk strategies on networks with transition probabilities between nodes defined in terms of functions of the Laplacian matrix. We generalize random walk strategies with local information in the Laplacian matrix, that describes the connections of a network, to a dynamic determined by functions of this matrix. The resulting processes are non-local allowing transitions of the random walker from one node to nodes beyond its nearest neighbors. We find that only two types of Laplacian functions are admissible with distinct behaviors for long-range steps in the infinite network limit: type (i) functions generate Brownian motions, type (ii) functions Lévy flights. For this asymptotic long-range step behavior only the lowest non-vanishing order of the Laplacian function is relevant, namely first order for type (i), and fractional order for type (ii) functions. In the first part, we discuss spectral properties of the Laplacian matrix and a series of relations that are maintained by a particular type of functions that allow to define random walks on any type of undirected connected networks. Once described general properties, we explore characteristics of random walk strategies that emerge from particular cases with functions defined in terms of exponentials, logarithms and powers of the Laplacian as well as relations of these dynamics with non-local strategies like Lévy flights and fractional transport. Finally, we analyze the global capacity of these random walk strategies to explore networks like lattices and trees and different types of random and complex networks.

Influence of Landscape Coverage on Measuring Spatial and Length Properties of Rock Fracture Networks: Insights from Numerical Simulation

NASA Astrophysics Data System (ADS)

Cao, Wenzhuo; Lei, Qinghua

2018-01-01

Natural fractures are ubiquitous in the Earth's crust and often deeply buried in the subsurface. Due to the difficulty in accessing to their three-dimensional structures, the study of fracture network geometry is usually achieved by sampling two-dimensional (2D) exposures at the Earth's surface through outcrop mapping or aerial photograph techniques. However, the measurement results can be considerably affected by the coverage of forests and other plant species over the exposed fracture patterns. We quantitatively study such effects using numerical simulation. We consider the scenario of nominally isotropic natural fracture systems and represent them using 2D discrete fracture network models governed by fractal and length scaling parameters. The groundcover is modelled as random patches superimposing onto the 2D fracture patterns. The effects of localisation and total coverage of landscape patches are further investigated. The fractal dimension and length exponent of the covered fracture networks are measured and compared with those of the original non-covered patterns. The results show that the measured length exponent increases with the reduced localisation and increased coverage of landscape patches, which is more evident for networks dominated by very large fractures (i.e. small underlying length exponent). However, the landscape coverage seems to have a minor impact on the fractal dimension measurement. The research findings of this paper have important implications for field survey and statistical analysis of geological systems.

Integrated semiconductor-magnetic random access memory system

NASA Technical Reports Server (NTRS)

Katti, Romney R. (Inventor); Blaes, Brent R. (Inventor)

2001-01-01

The present disclosure describes a non-volatile magnetic random access memory (RAM) system having a semiconductor control circuit and a magnetic array element. The integrated magnetic RAM system uses CMOS control circuit to read and write data magnetoresistively. The system provides a fast access, non-volatile, radiation hard, high density RAM for high speed computing.

75 FR 20564 - Dynamic Random Access Memory Semiconductors from the Republic of Korea: Extension of Time Limit...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-04-20

... DEPARTMENT OF COMMERCE International Trade Administration [C-580-851] Dynamic Random Access Memory Semiconductors from the Republic of Korea: Extension of Time Limit for Preliminary Results of Countervailing Duty... access memory semiconductors from the Republic of Korea, covering the period January 1, 2008 through...

Distribution of shortest cycle lengths in random networks

NASA Astrophysics Data System (ADS)

Bonneau, Haggai; Hassid, Aviv; Biham, Ofer; Kühn, Reimer; Katzav, Eytan

2017-12-01

We present analytical results for the distribution of shortest cycle lengths (DSCL) in random networks. The approach is based on the relation between the DSCL and the distribution of shortest path lengths (DSPL). We apply this approach to configuration model networks, for which analytical results for the DSPL were obtained before. We first calculate the fraction of nodes in the network which reside on at least one cycle. Conditioning on being on a cycle, we provide the DSCL over ensembles of configuration model networks with degree distributions which follow a Poisson distribution (Erdős-Rényi network), degenerate distribution (random regular graph), and a power-law distribution (scale-free network). The mean and variance of the DSCL are calculated. The analytical results are found to be in very good agreement with the results of computer simulations.

Listening to the noise: random fluctuations reveal gene network parameters

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

Munsky, Brian; Khammash, Mustafa

2009-01-01

The cellular environment is abuzz with noise. The origin of this noise is attributed to the inherent random motion of reacting molecules that take part in gene expression and post expression interactions. In this noisy environment, clonal populations of cells exhibit cell-to-cell variability that frequently manifests as significant phenotypic differences within the cellular population. The stochastic fluctuations in cellular constituents induced by noise can be measured and their statistics quantified. We show that these random fluctuations carry within them valuable information about the underlying genetic network. Far from being a nuisance, the ever-present cellular noise acts as a rich sourcemore » of excitation that, when processed through a gene network, carries its distinctive fingerprint that encodes a wealth of information about that network. We demonstrate that in some cases the analysis of these random fluctuations enables the full identification of network parameters, including those that may otherwise be difficult to measure. This establishes a potentially powerful approach for the identification of gene networks and offers a new window into the workings of these networks.« less

To cut or not to cut? Assessing the modular structure of brain networks.

PubMed

Chang, Yu-Teng; Pantazis, Dimitrios; Leahy, Richard M

2014-05-01

A wealth of methods has been developed to identify natural divisions of brain networks into groups or modules, with one of the most prominent being modularity. Compared with the popularity of methods to detect community structure, only a few methods exist to statistically control for spurious modules, relying almost exclusively on resampling techniques. It is well known that even random networks can exhibit high modularity because of incidental concentration of edges, even though they have no underlying organizational structure. Consequently, interpretation of community structure is confounded by the lack of principled and computationally tractable approaches to statistically control for spurious modules. In this paper we show that the modularity of random networks follows a transformed version of the Tracy-Widom distribution, providing for the first time a link between module detection and random matrix theory. We compute parametric formulas for the distribution of modularity for random networks as a function of network size and edge variance, and show that we can efficiently control for false positives in brain and other real-world networks. Copyright © 2014 Elsevier Inc. All rights reserved.

Tactical Network Load Balancing in Multi-Gateway Wireless Sensor Networks

DTIC Science & Technology

2013-12-01

writeup scrsz = get( 0 ,’ScreenSize’); %Creation of the random Sensor Network fig = figure(1); set(fig, ’Position’,[1 scrsz( 4 )*.25 scrsz(3)*.7...thesis writeup scrsz = get( 0 ,’ScreenSize’); %Creation of the random Sensor Network fig = figure(1); set(fig, ’Position’,[1 scrsz( 4 )*.25 scrsz(3)*.7...TYPE AND DATES COVERED Master’s Thesis 4 . TITLE AND SUBTITLE TACTICAL NETWORK LOAD BALANCING IN MULTI-GATEWAY WIRELESS SENSOR NETWORKS 5

A New Random Walk for Replica Detection in WSNs.

PubMed

Aalsalem, Mohammed Y; Khan, Wazir Zada; Saad, N M; Hossain, Md Shohrab; Atiquzzaman, Mohammed; Khan, Muhammad Khurram

2016-01-01

Wireless Sensor Networks (WSNs) are vulnerable to Node Replication attacks or Clone attacks. Among all the existing clone detection protocols in WSNs, RAWL shows the most promising results by employing Simple Random Walk (SRW). More recently, RAND outperforms RAWL by incorporating Network Division with SRW. Both RAND and RAWL have used SRW for random selection of witness nodes which is problematic because of frequently revisiting the previously passed nodes that leads to longer delays, high expenditures of energy with lower probability that witness nodes intersect. To circumvent this problem, we propose to employ a new kind of constrained random walk, namely Single Stage Memory Random Walk and present a distributed technique called SSRWND (Single Stage Memory Random Walk with Network Division). In SSRWND, single stage memory random walk is combined with network division aiming to decrease the communication and memory costs while keeping the detection probability higher. Through intensive simulations it is verified that SSRWND guarantees higher witness node security with moderate communication and memory overheads. SSRWND is expedient for security oriented application fields of WSNs like military and medical.

A New Random Walk for Replica Detection in WSNs

PubMed Central

Aalsalem, Mohammed Y.; Saad, N. M.; Hossain, Md. Shohrab; Atiquzzaman, Mohammed; Khan, Muhammad Khurram

2016-01-01

Wireless Sensor Networks (WSNs) are vulnerable to Node Replication attacks or Clone attacks. Among all the existing clone detection protocols in WSNs, RAWL shows the most promising results by employing Simple Random Walk (SRW). More recently, RAND outperforms RAWL by incorporating Network Division with SRW. Both RAND and RAWL have used SRW for random selection of witness nodes which is problematic because of frequently revisiting the previously passed nodes that leads to longer delays, high expenditures of energy with lower probability that witness nodes intersect. To circumvent this problem, we propose to employ a new kind of constrained random walk, namely Single Stage Memory Random Walk and present a distributed technique called SSRWND (Single Stage Memory Random Walk with Network Division). In SSRWND, single stage memory random walk is combined with network division aiming to decrease the communication and memory costs while keeping the detection probability higher. Through intensive simulations it is verified that SSRWND guarantees higher witness node security with moderate communication and memory overheads. SSRWND is expedient for security oriented application fields of WSNs like military and medical. PMID:27409082

77 FR 73096 - Self-Regulatory Organizations; Chicago Board Options Exchange, Incorporated; Notice of Filing and...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-12-07

... systems in Chicago (the ``Disaster Recovery Systems'') in case of the occurrence of some kind of disaster which prevents NY4 from operating. These Disaster Recovery Systems can be accessed via Network Access... Disaster Recovery Network Access Ports in order to be able to connect to the Disaster Recovery Systems in...

Large optical 3D MEMS switches in access networks

NASA Astrophysics Data System (ADS)

Madamopoulos, Nicholas; Kaman, Volkan; Yuan, Shifu; Jerphagnon, Olivier; Helkey, Roger; Bowers, John E.

2007-09-01

Interest is high among residential customers and businesses for advanced, broadband services such as fast Internet access, electronic commerce, video-on-demand, digital broadcasting, teleconferencing and telemedicine. In order to satisfy such growing demand of end-customers, access technologies such as fiber-to-the-home/building (FTTH/B) are increasingly being deployed. Carriers can reduce maintenance costs, minimize technology obsolescence and introduce new services easily by reducing active elements in the fiber access network. However, having a passive optical network (PON) also introduces operational and maintenance challenges. Increased diagnostic monitoring capability of the network becomes a necessity as more and more fibers are provisioned to deliver services to the end-customers. This paper demonstrates the clear advantages that large 3D optical MEMS switches offer in solving these access network problems. The advantages in preventative maintenance, remote monitoring, test and diagnostic capability are highlighted. The low optical insertion loss for all switch optical connections of the switch enables the monitoring, grooming and serving of a large number of PON lines and customers. Furthermore, the 3D MEMS switch is transparent to optical wavelengths and data formats, thus making it easy to incorporate future upgrades, such higher bit rates or DWDM overlay to a PON.

A Systematic Scheme for Multiple Access in Ethernet Passive Optical Access Networks

NASA Astrophysics Data System (ADS)

Ma, Maode; Zhu, Yongqing; Hiang Cheng, Tee

2005-11-01

While backbone networks have experienced substantial changes in the last decade, access networks have not changed much. Recently, passive optical networks (PONs) seem to be ready for commercial deployment as access networks, due to the maturity of a number of enabling technologies. Among the PON technologies, Ethernet PON (EPON) standardized by the IEEE 802.3ah Ethernet in the First Mile (EFM) Task Force is the most attractive one because of its high speed, low cost, familiarity, interoperability, and low overhead. In this paper, we consider the issue of upstream channel sharing in the EPONs. We propose a novel multiple-access control scheme to provide bandwidth-guaranteed service for high-demand customers, while providing best effort service to low-demand customers according to the service level agreement (SLA). The analytical and simulation results prove that the proposed scheme performs best in what it is designed to do compared to another well-known scheme that has not considered providing differentiated services. With business customers preferring premium services with guaranteed bandwidth and residential users preferring low-cost best effort services, our scheme could benefit both groups of subscribers, as well as the operators.

Multimedia information processing in the SWAN mobile networked computing system

NASA Astrophysics Data System (ADS)

Agrawal, Prathima; Hyden, Eoin; Krzyzanowsji, Paul; Srivastava, Mani B.; Trotter, John

1996-03-01

Anytime anywhere wireless access to databases, such as medical and inventory records, can simplify workflow management in a business, and reduce or even eliminate the cost of moving paper documents. Moreover, continual progress in wireless access technology promises to provide per-user bandwidths of the order of a few Mbps, at least in indoor environments. When combined with the emerging high-speed integrated service wired networks, it enables ubiquitous and tetherless access to and processing of multimedia information by mobile users. To leverage on this synergy an indoor wireless network based on room-sized cells and multimedia mobile end-points is being developed at AT&T Bell Laboratories. This research network, called SWAN (Seamless Wireless ATM Networking), allows users carrying multimedia end-points such as PDAs, laptops, and portable multimedia terminals, to seamlessly roam while accessing multimedia data streams from the wired backbone network. A distinguishing feature of the SWAN network is its use of end-to-end ATM connectivity as opposed to the connectionless mobile-IP connectivity used by present day wireless data LANs. This choice allows the wireless resource in a cell to be intelligently allocated amongst various ATM virtual circuits according to their quality of service requirements. But an efficient implementation of ATM in a wireless environment requires a proper mobile network architecture. In particular, the wireless link and medium-access layers need to be cognizant of the ATM traffic, while the ATM layers need to be cognizant of the mobility enabled by the wireless layers. This paper presents an overview of SWAN's network architecture, briefly discusses the issues in making ATM mobile and wireless, and describes initial multimedia applications for SWAN.

Temperature dependent characteristics of the random telegraph noise on contact resistive random access memory

NASA Astrophysics Data System (ADS)

Chang, Liang-Shun; Lin, Chrong Jung; King, Ya-Chin

2014-01-01

The temperature dependent characteristics of the random telegraphic noise (RTN) on contact resistive random access memory (CRRAM) are studied in this work. In addition to the bi-level switching, the occurrences of the middle states in the RTN signal are investigated. Based on the unique its temperature dependent characteristics, a new temperature sensing scheme is proposed for applications in ultra-low power sensor modules.

Network problem threshold

NASA Technical Reports Server (NTRS)

Gejji, Raghvendra, R.

1992-01-01

Network transmission errors such as collisions, CRC errors, misalignment, etc. are statistical in nature. Although errors can vary randomly, a high level of errors does indicate specific network problems, e.g. equipment failure. In this project, we have studied the random nature of collisions theoretically as well as by gathering statistics, and established a numerical threshold above which a network problem is indicated with high probability.

A Simulation Study Comparing Epidemic Dynamics on Exponential Random Graph and Edge-Triangle Configuration Type Contact Network Models

PubMed Central

Rolls, David A.; Wang, Peng; McBryde, Emma; Pattison, Philippa; Robins, Garry

2015-01-01

We compare two broad types of empirically grounded random network models in terms of their abilities to capture both network features and simulated Susceptible-Infected-Recovered (SIR) epidemic dynamics. The types of network models are exponential random graph models (ERGMs) and extensions of the configuration model. We use three kinds of empirical contact networks, chosen to provide both variety and realistic patterns of human contact: a highly clustered network, a bipartite network and a snowball sampled network of a “hidden population”. In the case of the snowball sampled network we present a novel method for fitting an edge-triangle model. In our results, ERGMs consistently capture clustering as well or better than configuration-type models, but the latter models better capture the node degree distribution. Despite the additional computational requirements to fit ERGMs to empirical networks, the use of ERGMs provides only a slight improvement in the ability of the models to recreate epidemic features of the empirical network in simulated SIR epidemics. Generally, SIR epidemic results from using configuration-type models fall between those from a random network model (i.e., an Erdős-Rényi model) and an ERGM. The addition of subgraphs of size four to edge-triangle type models does improve agreement with the empirical network for smaller densities in clustered networks. Additional subgraphs do not make a noticeable difference in our example, although we would expect the ability to model cliques to be helpful for contact networks exhibiting household structure. PMID:26555701

Self-avoiding walks on scale-free networks

NASA Astrophysics Data System (ADS)

Herrero, Carlos P.

2005-01-01

Several kinds of walks on complex networks are currently used to analyze search and navigation in different systems. Many analytical and computational results are known for random walks on such networks. Self-avoiding walks (SAW’s) are expected to be more suitable than unrestricted random walks to explore various kinds of real-life networks. Here we study long-range properties of random SAW’s on scale-free networks, characterized by a degree distribution P (k) ˜ k-γ . In the limit of large networks (system size N→∞ ), the average number sn of SAW’s starting from a generic site increases as μn , with μ= < k2 > / -1 . For finite N , sn is reduced due to the presence of loops in the network, which causes the emergence of attrition of the paths. For kinetic growth walks, the average maximum length increases as a power of the system size: ˜ Nα , with an exponent α increasing as the parameter γ is raised. We discuss the dependence of α on the minimum allowed degree in the network. A similar power-law dependence is found for the mean self-intersection length of nonreversal random walks. Simulation results support our approximate analytical calculations.

Impact of degree heterogeneity on the behavior of trapping in Koch networks

NASA Astrophysics Data System (ADS)

Zhang, Zhongzhi; Gao, Shuyang; Xie, Wenlei

2010-12-01

Previous work shows that the mean first-passage time (MFPT) for random walks to a given hub node (node with maximum degree) in uncorrelated random scale-free networks is closely related to the exponent γ of power-law degree distribution P(k )˜k-γ, which describes the extent of heterogeneity of scale-free network structure. However, extensive empirical research indicates that real networked systems also display ubiquitous degree correlations. In this paper, we address the trapping issue on the Koch networks, which is a special random walk with one trap fixed at a hub node. The Koch networks are power-law with the characteristic exponent γ in the range between 2 and 3, they are either assortative or disassortative. We calculate exactly the MFPT that is the average of first-passage time from all other nodes to the trap. The obtained explicit solution shows that in large networks the MFPT varies lineally with node number N, which is obviously independent of γ and is sharp contrast to the scaling behavior of MFPT observed for uncorrelated random scale-free networks, where γ influences qualitatively the MFPT of trapping problem.

Selective randomized load balancing and mesh networks with changing demands

NASA Astrophysics Data System (ADS)

Shepherd, F. B.; Winzer, P. J.

2006-05-01

We consider the problem of building cost-effective networks that are robust to dynamic changes in demand patterns. We compare several architectures using demand-oblivious routing strategies. Traditional approaches include single-hop architectures based on a (static or dynamic) circuit-switched core infrastructure and multihop (packet-switched) architectures based on point-to-point circuits in the core. To address demand uncertainty, we seek minimum cost networks that can carry the class of hose demand matrices. Apart from shortest-path routing, Valiant's randomized load balancing (RLB), and virtual private network (VPN) tree routing, we propose a third, highly attractive approach: selective randomized load balancing (SRLB). This is a blend of dual-hop hub routing and randomized load balancing that combines the advantages of both architectures in terms of network cost, delay, and delay jitter. In particular, we give empirical analyses for the cost (in terms of transport and switching equipment) for the discussed architectures, based on three representative carrier networks. Of these three networks, SRLB maintains the resilience properties of RLB while achieving significant cost reduction over all other architectures, including RLB and multihop Internet protocol/multiprotocol label switching (IP/MPLS) networks using VPN-tree routing.

Extending the Ground Force Network: Aerial Layer Networking

DTIC Science & Technology

2013-04-25

Additionally aerial layer networks are envisioned to augment the Global Information Grid ( GIG ) access, which is currently provided by the surface...frequencies such as HF, VHF, and UHF. This enabled ground forces to establish tactical wide area networks (WAN) and permitted entry to the GIG ...PRC-117G. Both systems are unique in their overall mission sets, but both provide tactical users access to the WAN and GIG . Self-forming and self

Global mean first-passage times of random walks on complex networks.

PubMed

Tejedor, V; Bénichou, O; Voituriez, R

2009-12-01

We present a general framework, applicable to a broad class of random walks on complex networks, which provides a rigorous lower bound for the mean first-passage time of a random walker to a target site averaged over its starting position, the so-called global mean first-passage time (GMFPT). This bound is simply expressed in terms of the equilibrium distribution at the target and implies a minimal scaling of the GMFPT with the network size. We show that this minimal scaling, which can be arbitrarily slow, is realized under the simple condition that the random walk is transient at the target site and independently of the small-world, scale-free, or fractal properties of the network. Last, we put forward that the GMFPT to a specific target is not a representative property of the network since the target averaged GMFPT satisfies much more restrictive bounds.

Network analysis of Bogotá’s Ciclovía Recreativa, a self-organized multisectoral community program to promote physical activity in a middle-income country

PubMed Central

Meisel, Jose D; Sarmiento, Olga; Montes, Felipe; Martinez, Edwin O.; Lemoine, Pablo D; Valdivia, Juan A; Brownson, RC; Zarama, Robert

2016-01-01

Purpose Conduct a social network analysis of the health and non-health related organizations that participate in the Bogotá’s Ciclovía Recreativa (Ciclovía). Design Cross sectional study. Setting Ciclovía is a multisectoral community-based mass program in which streets are temporarily closed to motorized transport, allowing exclusive access to individuals for leisure activities and PA. Subjects 25 organizations that participate in the Ciclovía. Measures Seven variables were examined using network analytic methods: relationship, link attributes (integration, contact, and importance), and node attributes (leadership, years in the program, and the sector of the organization). Analysis The network analytic methods were based on a visual descriptive analysis and an exponential random graph model. Results Analysis shows that the most central organizations in the network were outside of the health sector and includes Sports and Recreation, Government, and Security sectors. The organizations work in clusters formed by organizations of different sectors. Organization importance and structural predictors were positively related to integration, while the number of years working with Ciclovía was negatively associated with integration. Conclusion Ciclovía is a network whose structure emerged as a self-organized complex system. Ciclovía of Bogotá is an example of a program with public health potential formed by organizations of multiple sectors with Sports and Recreation as the most central. PMID:23971523

Estimating network effect in geocenter motion: Theory

NASA Astrophysics Data System (ADS)

Zannat, Umma Jamila; Tregoning, Paul

2017-10-01

Geophysical models and their interpretations of several processes of interest, such as sea level rise, postseismic relaxation, and glacial isostatic adjustment, are intertwined with the need to realize the International Terrestrial Reference Frame. However, this realization needs to take into account the geocenter motion, that is, the motion of the center of figure of the Earth surface, due to, for example, deformation of the surface by earthquakes or hydrological loading effects. Usually, there is also a discrepancy, known as the network effect, between the theoretically convenient center of figure and the physically accessible center of network frames, because of unavoidable factors such as uneven station distribution, lack of stations in the oceans, disparity in the coverage between the two hemispheres, and the existence of tectonically deforming zones. Here we develop a method to estimate the magnitude of the network effect, that is, the error introduced by the incomplete sampling of the Earth surface, in measuring the geocenter motion, for a network of space geodetic stations of a fixed size N. For this purpose, we use, as our proposed estimate, the standard deviations of the changes in Helmert parameters measured by a random network of the same size N. We show that our estimate scales as 1/√N and give an explicit formula for it in terms of the vector spherical harmonics expansion of the displacement field. In a complementary paper we apply this formalism to coseismic displacements and elastic deformations due to surface water movements.

On the routing protocol influence on the resilience of wireless sensor networks to jamming attacks.

PubMed

Del-Valle-Soto, Carolina; Mex-Perera, Carlos; Monroy, Raul; Nolazco-Flores, Juan Arturo

2015-03-27

In this work, we compare a recently proposed routing protocol, the multi-parent hierarchical (MPH) protocol, with two well-known protocols, the ad hoc on-demand distance vector (AODV) and dynamic source routing (DSR). For this purpose, we have developed a simulator, which faithfully reifies the workings of a given protocol, considering a fixed, reconfigurable ad hoc network given by the number and location of participants, and general network conditions. We consider a scenario that can be found in a large number of wireless sensor network applications, a single sink node that collects all of the information generated by the sensors. The metrics used to compare the protocols were the number of packet retransmissions, carrier sense multiple access (CSMA) inner loop retries, the number of nodes answering the queries from the coordinator (sink) node and the energy consumption. We tested the network under ordinary (without attacks) conditions (and combinations thereof) and when it is subject to different types of jamming attacks (in particular, random and reactive jamming attacks), considering several positions for the jammer. Our results report that MPH has a greater ability to tolerate such attacks than DSR and AODV, since it minimizes and encapsulates the network segment under attack. The self-configuring capabilities of MPH derived from a combination of a proactive routes update, on a periodic-time basis, and a reactive behavior provide higher resilience while offering a better performance (overhead and energy consumption) than AODV and DSR, as shown in our simulation results.

A scaling law for random walks on networks

PubMed Central

Perkins, Theodore J.; Foxall, Eric; Glass, Leon; Edwards, Roderick

2014-01-01

The dynamics of many natural and artificial systems are well described as random walks on a network: the stochastic behaviour of molecules, traffic patterns on the internet, fluctuations in stock prices and so on. The vast literature on random walks provides many tools for computing properties such as steady-state probabilities or expected hitting times. Previously, however, there has been no general theory describing the distribution of possible paths followed by a random walk. Here, we show that for any random walk on a finite network, there are precisely three mutually exclusive possibilities for the form of the path distribution: finite, stretched exponential and power law. The form of the distribution depends only on the structure of the network, while the stepping probabilities control the parameters of the distribution. We use our theory to explain path distributions in domains such as sports, music, nonlinear dynamics and stochastic chemical kinetics. PMID:25311870

A scaling law for random walks on networks

NASA Astrophysics Data System (ADS)

Perkins, Theodore J.; Foxall, Eric; Glass, Leon; Edwards, Roderick

2014-10-01

The dynamics of many natural and artificial systems are well described as random walks on a network: the stochastic behaviour of molecules, traffic patterns on the internet, fluctuations in stock prices and so on. The vast literature on random walks provides many tools for computing properties such as steady-state probabilities or expected hitting times. Previously, however, there has been no general theory describing the distribution of possible paths followed by a random walk. Here, we show that for any random walk on a finite network, there are precisely three mutually exclusive possibilities for the form of the path distribution: finite, stretched exponential and power law. The form of the distribution depends only on the structure of the network, while the stepping probabilities control the parameters of the distribution. We use our theory to explain path distributions in domains such as sports, music, nonlinear dynamics and stochastic chemical kinetics.

A scaling law for random walks on networks.

PubMed

Perkins, Theodore J; Foxall, Eric; Glass, Leon; Edwards, Roderick

2014-10-14

The dynamics of many natural and artificial systems are well described as random walks on a network: the stochastic behaviour of molecules, traffic patterns on the internet, fluctuations in stock prices and so on. The vast literature on random walks provides many tools for computing properties such as steady-state probabilities or expected hitting times. Previously, however, there has been no general theory describing the distribution of possible paths followed by a random walk. Here, we show that for any random walk on a finite network, there are precisely three mutually exclusive possibilities for the form of the path distribution: finite, stretched exponential and power law. The form of the distribution depends only on the structure of the network, while the stepping probabilities control the parameters of the distribution. We use our theory to explain path distributions in domains such as sports, music, nonlinear dynamics and stochastic chemical kinetics.

Latest Trends in Home Networking Technologies

NASA Astrophysics Data System (ADS)

Tsutsui, Akihiro

Broadband access service, including FTTH, is now in widespread use in Japan. More than half of the households that have broadband Internet access construct local area networks (home networks) in their homes. In addition, information appliances such as personal computers, networked audio, and visual devices and game machines are connected to home networks, and many novel service applications are provided via the Internet. However, it is still difficult to install and incorporate these devices and services because networked devices have been developed in different communities. I briefly explain the current status of information appliances and home networking technologies and services and discuss some of the problems in this and their solutions.

[Study on network architecture of a tele-medical information sharing platform].

PubMed

Pan, Lin; Yu, Lun; Chen, Jin-xiong

2006-07-01

In the article,a plan of network construction which satisfies the demand of applications for a telemedical information sharing platform is proposed. We choice network access plans in view of user actual situation, through the analysis of the service demand and many kinds of network access technologies. Hospital servers that locate in LAN link sharing platform with node servers, should separate from the broadband network of sharing platform in order to ensure the security of the internal hospital network and the administration management. We use the VPN technology to realize the safe transmission of information in the platform network. Preliminary experiments have proved the plan is practicable.

Small-World Network Spectra in Mean-Field Theory

NASA Astrophysics Data System (ADS)

Grabow, Carsten; Grosskinsky, Stefan; Timme, Marc

2012-05-01

Collective dynamics on small-world networks emerge in a broad range of systems with their spectra characterizing fundamental asymptotic features. Here we derive analytic mean-field predictions for the spectra of small-world models that systematically interpolate between regular and random topologies by varying their randomness. These theoretical predictions agree well with the actual spectra (obtained by numerical diagonalization) for undirected and directed networks and from fully regular to strongly random topologies. These results may provide analytical insights to empirically found features of dynamics on small-world networks from various research fields, including biology, physics, engineering, and social science.

Access to Accredited Cancer Hospitals Within Federal Exchange Plans Under the Affordable Care Act

PubMed Central

Liao, Kai-Ping; Krause, Trudy M.; Giordano, Sharon H.

2017-01-01

Purpose The Affordable Care Act expanded access to health insurance in the United States, but concerns have arisen about access to specialized cancer care within narrow provider networks. To characterize the scope and potential impact of this problem, we assessed rates of inclusion of Commission on Cancer (CoC) –accredited hospitals and National Cancer Institute (NCI) –designated cancer centers within federal exchange networks. Methods We downloaded publicly available machine-readable network data and public use files for individual federal exchange plans from the Centers for Medicare and Medicaid Services for the 2016 enrollment year. We linked this information to National Provider Identifier data, identified a set of distinct provider networks, and assessed the rates of inclusion of CoC-accredited hospitals and NCI-designated centers. We measured variation in these rates according to geography, plan type, and metal level. Results Of 4,058 unique individual plans, network data were available for 3,637 (90%); hospital information was available for 3,531 (87%). Provider lists for these plans reduced into 295 unique networks for analysis. Ninety-five percent of networks included at least one CoC-accredited hospital, but just 41% of networks included NCI-designated centers. States and counties each varied substantially in the proportion of networks listed that included NCI-designated centers (range, 0% to 100%). The proportion of networks that included NCI-designated centers also varied by plan type (range, 31% for health maintenance organizations to 49% for preferred provider organizations; P = .04) but not by metal level. Conclusion A large majority of federal exchange networks contain CoC-accredited hospitals, but most do not contain NCI-designated cancer centers. These results will inform policy regarding access to cancer care, and they reinforce the importance of promoting access to clinical trials and specialized care through community sites. PMID:28068172

How Fast Can Networks Synchronize? A Random Matrix Theory Approach

NASA Astrophysics Data System (ADS)

Timme, Marc; Wolf, Fred; Geisel, Theo

2004-03-01

Pulse-coupled oscillators constitute a paradigmatic class of dynamical systems interacting on networks because they model a variety of biological systems including flashing fireflies and chirping crickets as well as pacemaker cells of the heart and neural networks. Synchronization is one of the most simple and most prevailing kinds of collective dynamics on such networks. Here we study collective synchronization [1] of pulse-coupled oscillators interacting on asymmetric random networks. Using random matrix theory we analytically determine the speed of synchronization in such networks in dependence on the dynamical and network parameters [2]. The speed of synchronization increases with increasing coupling strengths. Surprisingly, however, it stays finite even for infinitely strong interactions. The results indicate that the speed of synchronization is limited by the connectivity of the network. We discuss the relevance of our findings to general equilibration processes on complex networks. [5mm] [1] M. Timme, F. Wolf, T. Geisel, Phys. Rev. Lett. 89:258701 (2002). [2] M. Timme, F. Wolf, T. Geisel, cond-mat/0306512 (2003).

Kanerva's sparse distributed memory: An associative memory algorithm well-suited to the Connection Machine

NASA Technical Reports Server (NTRS)

Rogers, David

1988-01-01

The advent of the Connection Machine profoundly changes the world of supercomputers. The highly nontraditional architecture makes possible the exploration of algorithms that were impractical for standard Von Neumann architectures. Sparse distributed memory (SDM) is an example of such an algorithm. Sparse distributed memory is a particularly simple and elegant formulation for an associative memory. The foundations for sparse distributed memory are described, and some simple examples of using the memory are presented. The relationship of sparse distributed memory to three important computational systems is shown: random-access memory, neural networks, and the cerebellum of the brain. Finally, the implementation of the algorithm for sparse distributed memory on the Connection Machine is discussed.

Protecting workers in the home care industry: workers' experienced job demands, resource gaps, and benefits following a socially supportive intervention.

PubMed

Mabry, Linda; Parker, Kelsey N; Thompson, Sharon V; Bettencourt, Katrina M; Haque, Afsara; Luther Rhoten, Kristy; Wright, Rob R; Hess, Jennifer A; Olson, Ryan

2018-05-02

The Community of Practice and Safety Support (COMPASS) program is a peer-led group intervention for home care workers. In a randomized controlled trial, COMPASS significantly improved workers' professional support networks and safety and health behaviors. However, quantitative findings failed to capture workers' complex emotional, physical, and social experiences with job demands, resource limitations, and the intervention itself. Therefore, we conducted qualitative follow-up interviews with a sample of participants (n = 28) in the program. Results provided examples of unique physical and psychological demands, revealed stressful resource limitations (e.g., safety equipment access), and elucidated COMPASS's role as a valuable resource.

Calculating with light using a chip-scale all-optical abacus.

PubMed

Feldmann, J; Stegmaier, M; Gruhler, N; Ríos, C; Bhaskaran, H; Wright, C D; Pernice, W H P

2017-11-02

Machines that simultaneously process and store multistate data at one and the same location can provide a new class of fast, powerful and efficient general-purpose computers. We demonstrate the central element of an all-optical calculator, a photonic abacus, which provides multistate compute-and-store operation by integrating functional phase-change materials with nanophotonic chips. With picosecond optical pulses we perform the fundamental arithmetic operations of addition, subtraction, multiplication, and division, including a carryover into multiple cells. This basic processing unit is embedded into a scalable phase-change photonic network and addressed optically through a two-pulse random access scheme. Our framework provides first steps towards light-based non-von Neumann arithmetic.

Getting support in polarized societies: income, social networks, and socioeconomic context.

PubMed

Letki, Natalia; Mieriņa, Inta

2015-01-01

This paper explores how unequal resources and social and economic polarization affects the size of social networks and their use to access resources. We argue that individual resource position generates divergent expectations with regard to the impact of polarization on the size of networks on one hand, and their usefulness for accessing resources on the other. Social and economic polarization encourages reliance on informal networks, but those at the bottom of the social structure are forced to rely on more extensive networks than the wealthy to compensate for their isolated and underprivileged position. At the same time, social and economic polarization limits the resources the poor can access through their networks. We provide evidence consistent with these propositions, based on data derived from the International Social Survey Programme 2001 "Social Networks" dataset combined with contextual information on the levels of economic inequality in particular countries along with whether they experienced postcommunism. Copyright © 2014 The Authors. Published by Elsevier Inc. All rights reserved.

A carrier sensed multiple access protocol for high data base rate ring networks

NASA Technical Reports Server (NTRS)

Foudriat, E. C.; Maly, Kurt J.; Overstreet, C. Michael; Khanna, S.; Paterra, Frank

1990-01-01

The results of the study of a simple but effective media access protocol for high data rate networks are presented. The protocol is based on the fact that at high data rates networks can contain multiple messages simultaneously over their span, and that in a ring, nodes used to detect the presence of a message arriving from the immediate upstream neighbor. When an incoming signal is detected, the node must either abort or truncate a message it is presently sending. Thus, the protocol with local carrier sensing and multiple access is designated CSMA/RN. The performance of CSMA/RN with TTattempt and truncate is studied using analytic and simulation models. Three performance factors, wait or access time, service time and response or end-to-end travel time are presented. The service time is basically a function of the network rate, it changes by a factor of 1 between no load and full load. Wait time, which is zero for no load, remains small for load factors up to 70 percent of full load. Response time, which adds travel time while on the network to wait and service time, is mainly a function of network length, especially for longer distance networks. Simulation results are shown for CSMA/RN where messages are removed at the destination. A wide range of local and metropolitan area network parameters including variations in message size, network length, and node count are studied. Finally, a scaling factor based upon the ratio of message to network length demonstrates that the results, and hence, the CSMA/RN protocol, are applicable to wide area networks.

Perturbation propagation in random and evolved Boolean networks

NASA Astrophysics Data System (ADS)

Fretter, Christoph; Szejka, Agnes; Drossel, Barbara

2009-03-01

In this paper, we investigate the propagation of perturbations in Boolean networks by evaluating the Derrida plot and its modifications. We show that even small random Boolean networks agree well with the predictions of the annealed approximation, but nonrandom networks show a very different behaviour. We focus on networks that were evolved for high dynamical robustness. The most important conclusion is that the simple distinction between frozen, critical and chaotic networks is no longer useful, since such evolved networks can display the properties of all three types of networks. Furthermore, we evaluate a simplified empirical network and show how its specific state space properties are reflected in the modified Derrida plots.

Spread of information and infection on finite random networks

NASA Astrophysics Data System (ADS)

Isham, Valerie; Kaczmarska, Joanna; Nekovee, Maziar

2011-04-01

The modeling of epidemic-like processes on random networks has received considerable attention in recent years. While these processes are inherently stochastic, most previous work has been focused on deterministic models that ignore important fluctuations that may persist even in the infinite network size limit. In a previous paper, for a class of epidemic and rumor processes, we derived approximate models for the full probability distribution of the final size of the epidemic, as opposed to only mean values. In this paper we examine via direct simulations the adequacy of the approximate model to describe stochastic epidemics and rumors on several random network topologies: homogeneous networks, Erdös-Rényi (ER) random graphs, Barabasi-Albert scale-free networks, and random geometric graphs. We find that the approximate model is reasonably accurate in predicting the probability of spread. However, the position of the threshold and the conditional mean of the final size for processes near the threshold are not well described by the approximate model even in the case of homogeneous networks. We attribute this failure to the presence of other structural properties beyond degree-degree correlations, and in particular clustering, which are present in any finite network but are not incorporated in the approximate model. In order to test this “hypothesis” we perform additional simulations on a set of ER random graphs where degree-degree correlations and clustering are separately and independently introduced using recently proposed algorithms from the literature. Our results show that even strong degree-degree correlations have only weak effects on the position of the threshold and the conditional mean of the final size. On the other hand, the introduction of clustering greatly affects both the position of the threshold and the conditional mean. Similar analysis for the Barabasi-Albert scale-free network confirms the significance of clustering on the dynamics of rumor spread. For this network, though, with its highly skewed degree distribution, the addition of positive correlation had a much stronger effect on the final size distribution than was found for the simple random graph.

Organizational Readiness for Change and Opinions toward Treatment Innovations

PubMed Central

Fuller, Bret E.; Rieckmann, Traci; Nunes, Edward V.; Miller, Michael; Arfken, Cynthia; Edmundson, Eldon; McCarty, Dennis

2007-01-01

Program administrators and staff in treatment programs participating in the National Drug Abuse Treatment Clinical Trials Network (CTN) completed surveys to characterize participating programs and practitioners. A two-level random effects regression model assessed the influence of Organizational Readiness for Change (ORC) and organizational attributes on opinions toward the use of four evidence-based practices (manualized treatments, medication, integrated mental health services, and motivational incentives) and practices with less empirical support (confrontation and noncompliance discharge). The ORC Scales suggested greater support for evidence-based practices in programs where staff perceived more program need for improvement, better Internet access, higher levels of peer influence, more opportunities for professional growth, a stronger sense of organizational mission and more organizational stress. Support for confrontation and noncompliance discharge, in contrast, was strong when staff saw less opportunity for professional growth, weaker peer influence, less Internet access, and perceived less organizational stress. The analysis provides evidence of the ORC’s utility in assessing agency strengths and needs during the implementation of evidence-based practices. PMID:17434708

A remote sensing and geographic information system approach to sampling malaria vector habitats in Chiapas, Mexico

NASA Astrophysics Data System (ADS)

Beck, L.; Wood, B.; Whitney, S.; Rossi, R.; Spanner, M.; Rodriguez, M.; Rodriguez-Ramirez, A.; Salute, J.; Legters, L.; Roberts, D.; Rejmankova, E.; Washino, R.

1993-08-01

This paper describes a procedure whereby remote sensing and geographic information system (GIS) technologies are used in a sample design to study the habitat of Anopheles albimanus, one of the principle vectors of malaria in Central America. This procedure incorporates Landsat-derived land cover maps with digital elevation and road network data to identify a random selection of larval habitats accessible for field sampling. At the conclusion of the sampling season, the larval counts will be used to determine habitat productivity, and then integrated with information on human settlement to assess where people are at high risk of malaria. This aproach would be appropriate in areas where land cover information is lacking and problems of access constrain field sampling. The use of a GIS also permits other data (such as insecticide spraying data) to the incorporated in the sample design as they arise. This approach would also be pertinent for other tropical vector-borne diseases, particularly where human activities impact disease vector habitat.

An alternative resource sharing scheme for land mobile satellite services

NASA Technical Reports Server (NTRS)

Yan, Tsun-Yee; Sue, Miles K.

1990-01-01

A preliminary comparison between the two competing channelization concepts for the Land Mobile Satellite Services (LMSS), namely frequency division (FD) and code division (CD), is presented. Both random access and demand-assigned approaches are considered under these concepts. The CD concept is compared with the traditional FD concept based on the system consideration and a projected traffic model. It is shown that CD is not particularly attractive for the first generation Mobile Satellite Services because of the spectral occupancy of the network bandwidth. However, the CD concept is a viable alternative for future systems such as the personal access satellite system (PASS) in the Ka-band spectrum where spectral efficiency is not of prime concern. The effects of power robbing and voice activity factor are incorporated. It was shown that the traditional rule of thumb of dividing the number of raw channels by the voice activity factor to obtain the effective number of channels is only valid asymptotically as the aggregated traffic approaches infinity.

An alternative resource sharing scheme for land mobile satellite services

NASA Astrophysics Data System (ADS)

Yan, Tsun-Yee; Sue, Miles K.

A preliminary comparison between the two competing channelization concepts for the Land Mobile Satellite Services (LMSS), namely frequency division (FD) and code division (CD), is presented. Both random access and demand-assigned approaches are considered under these concepts. The CD concept is compared with the traditional FD concept based on the system consideration and a projected traffic model. It is shown that CD is not particularly attractive for the first generation Mobile Satellite Services because of the spectral occupancy of the network bandwidth. However, the CD concept is a viable alternative for future systems such as the personal access satellite system (PASS) in the Ka-band spectrum where spectral efficiency is not of prime concern. The effects of power robbing and voice activity factor are incorporated. It was shown that the traditional rule of thumb of dividing the number of raw channels by the voice activity factor to obtain the effective number of channels is only valid asymptotically as the aggregated traffic approaches infinity.

Parameters affecting the resilience of scale-free networks to random failures.

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

Link, Hamilton E.; LaViolette, Randall A.; Lane, Terran

2005-09-01

It is commonly believed that scale-free networks are robust to massive numbers of random node deletions. For example, Cohen et al. in (1) study scale-free networks including some which approximate the measured degree distribution of the Internet. Their results suggest that if each node in this network failed independently with probability 0.99, most of the remaining nodes would still be connected in a giant component. In this paper, we show that a large and important subclass of scale-free networks are not robust to massive numbers of random node deletions. In particular, we study scale-free networks which have minimum node degreemore » of 1 and a power-law degree distribution beginning with nodes of degree 1 (power-law networks). We show that, in a power-law network approximating the Internet's reported distribution, when the probability of deletion of each node is 0.5 only about 25% of the surviving nodes in the network remain connected in a giant component, and the giant component does not persist beyond a critical failure rate of 0.9. The new result is partially due to improved analytical accommodation of the large number of degree-0 nodes that result after node deletions. Our results apply to power-law networks with a wide range of power-law exponents, including Internet-like networks. We give both analytical and empirical evidence that such networks are not generally robust to massive random node deletions.« less

Spreading in online social networks: the role of social reinforcement.

PubMed

Zheng, Muhua; Lü, Linyuan; Zhao, Ming

2013-07-01

Some epidemic spreading models are usually applied to analyze the propagation of opinions or news. However, the dynamics of epidemic spreading and information or behavior spreading are essentially different in many aspects. Centola's experiments [Science 329, 1194 (2010)] on behavior spreading in online social networks showed that the spreading is faster and broader in regular networks than in random networks. This result contradicts with the former understanding that random networks are preferable for spreading than regular networks. To describe the spreading in online social networks, a unknown-known-approved-exhausted four-status model was proposed, which emphasizes the effect of social reinforcement and assumes that the redundant signals can improve the probability of approval (i.e., the spreading rate). Performing the model on regular and random networks, it is found that our model can well explain the results of Centola's experiments on behavior spreading and some former studies on information spreading in different parameter space. The effects of average degree and network size on behavior spreading process are further analyzed. The results again show the importance of social reinforcement and are accordant with Centola's anticipation that increasing the network size or decreasing the average degree will enlarge the difference of the density of final approved nodes between regular and random networks. Our work complements the former studies on spreading dynamics, especially the spreading in online social networks where the information usually requires individuals' confirmations before being transmitted to others.

76 FR 55417 - In the Matter of Certain Dynamic Random Access Memory and Nand Flash Memory Devices and Products...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-09-07

... Access Memory and Nand Flash Memory Devices and Products Containing Same; Notice of Institution of... importation, and the sale within the United States after importation of certain dynamic random access memory and NAND flash memory devices and products containing same by reason of infringement of certain claims...

A Review on Radio-Over-Fiber Technology-Based Integrated (Optical/Wireless) Networks

NASA Astrophysics Data System (ADS)

Rajpal, Shivika; Goyal, Rakesh

2017-06-01

In the present paper, radio-over-fiber (RoF) technology has been proposed, which is the integration of the optical and radio networks. With a high transmission capacity, comparatively low cost and low attenuation, optical fiber provides an ideal solution for accomplishing the interconnections. In addition, a radio system enables the significant mobility, flexibility and easy access. Therefore, the system integration can meet the increasing demands of subscribers for voice, data and multimedia services that require the access network to support high data rates at any time and any place inexpensively. RoF has the potentiality to the backbone of the wireless access network and it has gained significant momentum in the last decade as a potential last-mile access scheme. This paper gives the comprehensive review of RoF technology used in the communication system. Concept, applications, advantages and limitations of RoF technology are also discussed in this paper.

Population Accessibility to Radiotherapy Services in New South Wales Region of Australia: a methodological contribution

NASA Astrophysics Data System (ADS)

Shukla, Nagesh; Wickramasuriya, Rohan; Miller, Andrew; Perez, Pascal

2015-05-01

This paper proposes an integrated modelling process to assess the population accessibility to radiotherapy treatment services in future based on future cancer incidence and road network-based accessibility. Previous research efforts assessed travel distance/time barriers affecting access to cancer treatment services, as well as epidemiological studies that showed that cancer incidence rates vary with population demography. It is established that travel distances to treatment centres and demographic profiles of the accessible regions greatly influence the demand for cancer radiotherapy (RT) services. However, an integrated service planning approach that combines spatially-explicit cancer incidence projections, and the RT services accessibility based on patient road network have never been attempted. This research work presents this novel methodology for the accessibility assessment of RT services and demonstrates its viability by modelling New South Wales (NSW) cancer incidence rates for different age-sex groups based on observed cancer incidence trends; estimating the road network-based access to current NSW treatment centres; and, projecting the demand for RT services in New South Wales, Australia from year 2011 to 2026.

Routing in Networks with Random Topologies

NASA Technical Reports Server (NTRS)

Bambos, Nicholas

1997-01-01

We examine the problems of routing and server assignment in networks with random connectivities. In such a network the basic topology is fixed, but during each time slot and for each of tis input queues, each server (node) is either connected to or disconnected from each of its queues with some probability.

Gossip and Distributed Kalman Filtering: Weak Consensus Under Weak Detectability

NASA Astrophysics Data System (ADS)

Kar, Soummya; Moura, José M. F.

2011-04-01

The paper presents the gossip interactive Kalman filter (GIKF) for distributed Kalman filtering for networked systems and sensor networks, where inter-sensor communication and observations occur at the same time-scale. The communication among sensors is random; each sensor occasionally exchanges its filtering state information with a neighbor depending on the availability of the appropriate network link. We show that under a weak distributed detectability condition: 1. the GIKF error process remains stochastically bounded, irrespective of the instability properties of the random process dynamics; and 2. the network achieves \\emph{weak consensus}, i.e., the conditional estimation error covariance at a (uniformly) randomly selected sensor converges in distribution to a unique invariant measure on the space of positive semi-definite matrices (independent of the initial state.) To prove these results, we interpret the filtered states (estimates and error covariances) at each node in the GIKF as stochastic particles with local interactions. We analyze the asymptotic properties of the error process by studying as a random dynamical system the associated switched (random) Riccati equation, the switching being dictated by a non-stationary Markov chain on the network graph.

Discrete-time systems with random switches: From systems stability to networks synchronization.

PubMed

Guo, Yao; Lin, Wei; Ho, Daniel W C

2016-03-01

In this article, we develop some approaches, which enable us to more accurately and analytically identify the essential patterns that guarantee the almost sure stability of discrete-time systems with random switches. We allow for the case that the elements in the switching connection matrix even obey some unbounded and continuous-valued distributions. In addition to the almost sure stability, we further investigate the almost sure synchronization in complex dynamical networks consisting of randomly connected nodes. Numerical examples illustrate that a chaotic dynamics in the synchronization manifold is preserved when statistical parameters enter some almost sure synchronization region established by the developed approach. Moreover, some delicate configurations are considered on probability space for ensuring synchronization in networks whose nodes are described by nonlinear maps. Both theoretical and numerical results on synchronization are presented by setting only a few random connections in each switch duration. More interestingly, we analytically find it possible to achieve almost sure synchronization in the randomly switching complex networks even with very large population sizes, which cannot be easily realized in non-switching but deterministically connected networks.

Discrete-time systems with random switches: From systems stability to networks synchronization

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

Guo, Yao; Lin, Wei, E-mail: wlin@fudan.edu.cn; Shanghai Key Laboratory of Contemporary Applied Mathematics, LMNS, and Shanghai Center for Mathematical Sciences, Shanghai 200433

2016-03-15

In this article, we develop some approaches, which enable us to more accurately and analytically identify the essential patterns that guarantee the almost sure stability of discrete-time systems with random switches. We allow for the case that the elements in the switching connection matrix even obey some unbounded and continuous-valued distributions. In addition to the almost sure stability, we further investigate the almost sure synchronization in complex dynamical networks consisting of randomly connected nodes. Numerical examples illustrate that a chaotic dynamics in the synchronization manifold is preserved when statistical parameters enter some almost sure synchronization region established by the developedmore » approach. Moreover, some delicate configurations are considered on probability space for ensuring synchronization in networks whose nodes are described by nonlinear maps. Both theoretical and numerical results on synchronization are presented by setting only a few random connections in each switch duration. More interestingly, we analytically find it possible to achieve almost sure synchronization in the randomly switching complex networks even with very large population sizes, which cannot be easily realized in non-switching but deterministically connected networks.« less

Weighted Scaling in Non-growth Random Networks

NASA Astrophysics Data System (ADS)

Chen, Guang; Yang, Xu-Hua; Xu, Xin-Li

2012-09-01

We propose a weighted model to explain the self-organizing formation of scale-free phenomenon in non-growth random networks. In this model, we use multiple-edges to represent the connections between vertices and define the weight of a multiple-edge as the total weights of all single-edges within it and the strength of a vertex as the sum of weights for those multiple-edges attached to it. The network evolves according to a vertex strength preferential selection mechanism. During the evolution process, the network always holds its total number of vertices and its total number of single-edges constantly. We show analytically and numerically that a network will form steady scale-free distributions with our model. The results show that a weighted non-growth random network can evolve into scale-free state. It is interesting that the network also obtains the character of an exponential edge weight distribution. Namely, coexistence of scale-free distribution and exponential distribution emerges.

Symmetries and synchronization in multilayer random networks

NASA Astrophysics Data System (ADS)

Saa, Alberto

2018-04-01

In the light of the recently proposed scenario of asymmetry-induced synchronization (AISync), in which dynamical uniformity and consensus in a distributed system would demand certain asymmetries in the underlying network, we investigate here the influence of some regularities in the interlayer connection patterns on the synchronization properties of multilayer random networks. More specifically, by considering a Stuart-Landau model of complex oscillators with random frequencies, we report for multilayer networks a dynamical behavior that could be also classified as a manifestation of AISync. We show, namely, that the presence of certain symmetries in the interlayer connection pattern tends to diminish the synchronization capability of the whole network or, in other words, asymmetries in the interlayer connections would enhance synchronization in such structured networks. Our results might help the understanding not only of the AISync mechanism itself but also its possible role in the determination of the interlayer connection pattern of multilayer and other structured networks with optimal synchronization properties.

Breaking open the set top box

NASA Astrophysics Data System (ADS)

Banks, David; Wiley, Anthony; Catania, Nicolas; Coles, Alastair N.; Smith, Duncan; Baynham, Simon; Deliot, Eric; Chidzey, Rod

1998-02-01

In this paper we describe the work being done at HP Labs Bristol in the area of home networks and gateways. This work is based on the idea of breaking open the set top box by physically separating the access network specific functions from the application specific functions. The access network specific functions reside in an access network gateway that can be shared by many end user devices. The first section of the paper present the philosophy behind this approach. The end user devices and the access network gateways must be interconnected by a high bandwidth network which can offer a bounded delay service for delay sensitive traffic. We are advocating the use of IEEE 1394 for this network, and the next section of the paper gives a brief introduction to this technology. We then describe a prototype digital video broadcasting satellite compliant gateway that we have built. This gateway could be used, for example, by a PC for receiving a data service or by a digital TV for receiving an MPEG-2 video service. A control architecture is the presented which uses a PC application to provide a web based user interface to the system. Finally, we provide details of our work on extending the reach of IEEE 1394 and its standardization status.

Router Agent Technology for Policy-Based Network Management

NASA Technical Reports Server (NTRS)

Chow, Edward T.; Sudhir, Gurusham; Chang, Hsin-Ping; James, Mark; Liu, Yih-Chiao J.; Chiang, Winston

2011-01-01

This innovation can be run as a standalone network application on any computer in a networked environment. This design can be configured to control one or more routers (one instance per router), and can also be configured to listen to a policy server over the network to receive new policies based on the policy- based network management technology. The Router Agent Technology transforms the received policies into suitable Access Control List syntax for the routers it is configured to control. It commits the newly generated access control lists to the routers and provides feedback regarding any errors that were faced. The innovation also automatically generates a time-stamped log file regarding all updates to the router it is configured to control. This technology, once installed on a local network computer and started, is autonomous because it has the capability to keep listening to new policies from the policy server, transforming those policies to router-compliant access lists, and committing those access lists to a specified interface on the specified router on the network with any error feedback regarding commitment process. The stand-alone application is named RouterAgent and is currently realized as a fully functional (version 1) implementation for the Windows operating system and for CISCO routers.

Teleaudiology: efficacy assessment of an online social network as a support tool for parents of children candidates for cochlear implant.

PubMed

Aiello, Camila Piccini; Ferrari, Deborah Viviane

2015-01-01

To assess the efficacy of an online social network as a support for parents of children with hearing impairment. Twenty-two mothers, randomly divided into experimental (n=11) and control (n=11) groups, filled in an online form containing the Parental Stress Index - Short Form (PSI-SF). Only the experimental group had access to the "Babies' Portal" social network. Both groups filled in the online form once again 3 months after the first assessment, for evaluating the use and participation in the social network. The posts on the social network were rated by two independent raters regarding themes and mechanisms of self-help. No difference was observed in mean PSI-SF scores between the groups for both assessments. Intragroup analysis showed no difference for total and subscale results of PSI-SF between the two data collected for both groups except for the "Defensive Response" subscale, in which a decrease was observed in the score for the control group. The most frequent posting themes were related to personal information and expressions of religious beliefs. Regarding self-help mechanisms, a higher frequency of exchanging experiences and gratitude expressions was observed. Participants in the experimental group stated they would have liked to participate more frequently in the social network as they considered this tool important because of the exchange of information and experience with other mothers and hearing health-care professionals. The posts and the assessment of participants indicated the potential of this network to support parents of children with hearing impairment.

Cognitive Radio Cloud Networks: Assured Access In The Future Electromagnetic Operating Environment

DTIC Science & Technology

2017-04-04

AIR COMMAND AND STAFF COLLEGE AIR UNIVERSITY COGNITIVE RADIO CLOUD NETWORKS: ASSURED ACCESS IN THE FUTURE ELECTROMAGNETIC OPERATING...3 Abstract The electromagnetic spectrum is a finite resource that is critical to the United States military’s...ability to gain superiority in the other five warfighting domains. The Department of Defense’s electromagnetic strategy is spectrum access when and

An Ounce of Prevention: Technologists Use Network-Access Control to Protect System Resources, Students

ERIC Educational Resources Information Center

Bolch, Matt

2009-01-01

Whether for an entire district, a single campus, or one classroom, allowing authorized access to a computer network can be fraught with challenges. The login process should be fairly seamless to approved users, giving them speedy access to approved Web sites, databases, and other sources of information. It also should be tough on unauthorized…

Establishment of National Gravity Base Network of Iran

NASA Astrophysics Data System (ADS)

Hatam Chavari, Y.; Bayer, R.; Hinderer, J.; Ghazavi, K.; Sedighi, M.; Luck, B.; Djamour, Y.; Le Moign, N.; Saadat, R.; Cheraghi, H.

2009-04-01

A gravity base network is supposed to be a set of benchmarks uniformly distributed across the country and the absolute gravity values at the benchmarks are known to the best accessible accuracy. The gravity at the benchmark stations are either measured directly with absolute devices or transferred by gravity difference measurements by gravimeters from known stations. To decrease the accumulation of random measuring errors arising from these transfers, the number of base stations distributed across the country should be as small as possible. This is feasible if the stations are selected near to the national airports long distances apart but faster accessible and measurable by a gravimeter carried in an airplane between the stations. To realize the importance of such a network, various applications of a gravity base network are firstly reviewed. A gravity base network is the required reference frame for establishing 1st , 2nd and 3rd order gravity networks. Such a gravity network is used for the following purposes: a. Mapping of the structure of upper crust in geology maps. The required accuracy for the measured gravity values is about 0.2 to 0.4 mGal. b. Oil and mineral explorations. The required accuracy for the measured gravity values is about 5 µGal. c. Geotechnical studies in mining areas for exploring the underground cavities as well as archeological studies. The required accuracy is about 5 µGal and better. d. Subsurface water resource explorations and mapping crustal layers which absorb it. An accuracy of the same level of previous applications is required here too. e. Studying the tectonics of the Earth's crust. Repeated precise gravity measurements at the gravity network stations can assist us in identifying systematic height changes. The accuracy of the order of 5 µGal and more is required. f. Studying volcanoes and their evolution. Repeated precise gravity measurements at the gravity network stations can provide valuable information on the gradual upward movement of lava. g. Producing precise mean gravity anomaly for precise geoid determination. Replacing precise spirit leveling by the GPS leveling using precise geoid model is one of the forth coming application of the precise geoid. A gravity base network of 28 stations established over Iran. The stations were built mainly at bedrocks. All stations were measured by an FG5 absolute gravimeter, at least 12 hours at each station, to obtain an accuracy of a few micro gals. Several stations were repeated several times during recent years to estimate the gravity changes.

Sensitivity and network topology in chemical reaction systems

NASA Astrophysics Data System (ADS)

Okada, Takashi; Mochizuki, Atsushi

2017-08-01

In living cells, biochemical reactions are catalyzed by specific enzymes and connect to one another by sharing substrates and products, forming complex networks. In our previous studies, we established a framework determining the responses to enzyme perturbations only from network topology, and then proved a theorem, called the law of localization, explaining response patterns in terms of network topology. In this paper, we generalize these results to reaction networks with conserved concentrations, which allows us to study any reaction system. We also propose network characteristics quantifying robustness. We compare E. coli metabolic network with randomly rewired networks, and find that the robustness of the E. coli network is significantly higher than that of the random networks.

Highly Reliable PON Optical Splitters for Optical Access Networks in Outside Environments

NASA Astrophysics Data System (ADS)

Watanabe, Hiroshi; Araki, Noriyuki; Fujimoto, Hisashi

Broadband optical access services are spreading throughout the world, and the number of fiber to the home (FTTH) subscribers is increasing rapidly. Telecom operators are constructing passive optical networks (PONs) to provide optical access services. Externally installed optical splitters for PONs are very important passive devices in optical access networks, and they must provide satisfactory performance as outdoor plant over long periods. Therefore, we calculate the failure rate of optical access networks and assign a failure rate to the optical splitters in optical access networks. The maximum cumulative failure rate of 1 × 8 optical splitters was calculated as 0.025 for an optical access fiber length of 2.1km and a 20-year operating lifetime. We examined planar lightwave circuit (PLC) type optical splitters for use as outside plant in terms of their optical characteristics and environmental reliability. We confirmed that PLC type optical splitters have sufficient optical performance for a PON splitter and sufficient reliability as outside plant in accordance with ITU-T standard values. We estimated the lifetimes of three kinds of PLC type optical splitters by using accelerated aging tests. The estimated failure rate of these splitters installed in optical access networks was below the target value for the cumulative failure rate, and we confirmed that they have sufficient reliability to maintain the quality of the network service. We developed 1 × 8 optical splitter modules with plug and socket type optical connectors and optical fiber cords for optical aerial closures designed for use as outside plant. These technologies make it easy to install optical splitters in an aerial optical closure. The optical splitter modules have sufficient optical performance levels for PONs because the insertion loss at the commercially used wavelengths of 1.31 and 1.55µm is less than the criterion established by ITU-T Recommendation G.671 for optical splitters. We performed a temperature cycling test, and a low temperature storage and damp heat test to confirm the long-term reliability of these modules. They exhibited sufficient reliability as regards heat and moisture because the maximum loss change was less than 0.3dB.

Conductivity of Nanowire Arrays under Random and Ordered Orientation Configurations

PubMed Central

Jagota, Milind; Tansu, Nelson

2015-01-01

A computational model was developed to analyze electrical conductivity of random metal nanowire networks. It was demonstrated for the first time through use of this model that a performance gain in random metal nanowire networks can be achieved by slightly restricting nanowire orientation. It was furthermore shown that heavily ordered configurations do not outperform configurations with some degree of randomness; randomness in the case of metal nanowire orientations acts to increase conductivity. PMID:25976936

"This Site Is Blocked": K-12 Teachers and the Challenge of Accessing Peer-to-Peer Networks for Education

ERIC Educational Resources Information Center

Ching, Cynthia Carter; Hursh, Anthony W.

2010-01-01

This article examines a little-discussed phenomenon in the study of both peer-to-peer collaborative networks and teaching with technology: that of teachers caught in the middle between open public networks as teaching resources and highly restrictive school policies regarding internet content and online access. Based on their experiences as…

Advance reservation access control using software-defined networking and tokens

DOE PAGES

Chung, Joaquin; Jung, Eun-Sung; Kettimuthu, Rajkumar; ...

2017-03-09

Advance reservation systems allow users to reserve dedicated bandwidth connection resources from advanced high-speed networks. A common use case for such systems is data transfers in distributed science environments in which a user wants exclusive access to the reservation. However, current advance network reservation methods cannot ensure exclusive access of a network reservation to the specific flow for which the user made the reservation. We present in this paper a novel network architecture that addresses this limitation and ensures that a reservation is used only by the intended flow. We achieve this by leveraging software-defined networking (SDN) and token-based authorization.more » We use SDN to orchestrate and automate the reservation of networking resources, end-to-end and across multiple administrative domains, and tokens to create a strong binding between the user or application that requested the reservation and the flows provisioned by SDN. Finally, we conducted experiments on the ESNet 100G SDN testbed, and demonstrated that our system effectively protects authorized flows from competing traffic in the network.« less

Advance reservation access control using software-defined networking and tokens

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

Chung, Joaquin; Jung, Eun-Sung; Kettimuthu, Rajkumar

Advance reservation systems allow users to reserve dedicated bandwidth connection resources from advanced high-speed networks. A common use case for such systems is data transfers in distributed science environments in which a user wants exclusive access to the reservation. However, current advance network reservation methods cannot ensure exclusive access of a network reservation to the specific flow for which the user made the reservation. We present in this paper a novel network architecture that addresses this limitation and ensures that a reservation is used only by the intended flow. We achieve this by leveraging software-defined networking (SDN) and token-based authorization.more » We use SDN to orchestrate and automate the reservation of networking resources, end-to-end and across multiple administrative domains, and tokens to create a strong binding between the user or application that requested the reservation and the flows provisioned by SDN. Finally, we conducted experiments on the ESNet 100G SDN testbed, and demonstrated that our system effectively protects authorized flows from competing traffic in the network.« less

Advance reservation access control using software-defined networking and tokens

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

Chung, Joaquin; Jung, Eun-Sung; Kettimuthu, Rajkumar

Advance reservation systems allow users to reserve dedicated bandwidth connection resources from advanced high-speed networks. A common use case for such systems is data transfers in distributed science environments in which a user wants exclusive access to the reservation. However, current advance network reservation methods cannot ensure exclusive access of a network reservation to the specific flow for which the user made the reservation. We present here a novel network architecture that addresses this limitation and ensures that a reservation is used only by the intended flow. We achieve this by leveraging software-defined networking (SDN) and token-based authorization. We usemore » SDN to orchestrate and automate the reservation of networking resources, end-to-end and across multiple administrative domains, and tokens to create a strong binding between the user or application that requested the reservation and the flows provisioned by SDN. We conducted experiments on the ESNet 100G SDN testbed, and demonstrated that our system effectively protects authorized flows from competing traffic in the network. (C) 2017 Elsevier B.V. All rights reserved.« less

Energy challenges in optical access and aggregation networks.

PubMed

Kilper, Daniel C; Rastegarfar, Houman

2016-03-06

Scalability is a critical issue for access and aggregation networks as they must support the growth in both the size of data capacity demands and the multiplicity of access points. The number of connected devices, the Internet of Things, is growing to the tens of billions. Prevailing communication paradigms are reaching physical limitations that make continued growth problematic. Challenges are emerging in electronic and optical systems and energy increasingly plays a central role. With the spectral efficiency of optical systems approaching the Shannon limit, increasing parallelism is required to support higher capacities. For electronic systems, as the density and speed increases, the total system energy, thermal density and energy per bit are moving into regimes that become impractical to support-for example requiring single-chip processor powers above the 100 W limit common today. We examine communication network scaling and energy use from the Internet core down to the computer processor core and consider implications for optical networks. Optical switching in data centres is identified as a potential model from which scalable access and aggregation networks for the future Internet, with the application of integrated photonic devices and intelligent hybrid networking, will emerge. © 2016 The Author(s).

Use of a wireless local area network in an orthodontic clinic.

PubMed

Mupparapu, Muralidhar; Binder, Robert E; Cummins, John M

2005-06-01

Radiographic images and other patient records, including medical histories, demographics, and health insurance information, can now be stored digitally and accessed via patient management programs. However, digital image acquisition and diagnosis and treatment planning are independent tasks, and each is time consuming, especially when performed at different computer workstations. Networking or linking the computers in an office enhances access to imaging and treatment planning tools. Access can be further enhanced if the entire network is wireless. Thanks to wireless technology, stand-alone, desk-bound personal computers have been replaced with mobile, hand-held devices that can communicate with each other and the rest of the world via the Internet. As with any emerging technology, some issues should be kept in mind when adapting to the wireless environment. Foremost is network security. Second is the choice of mobile hardware devices that are used by the orthodontist, office staff, and patients. This article details the standards and choices in wireless technology that can be implemented in an orthodontic clinic and suggests how to select suitable mobile hardware for accessing or adding data to a preexisting network. The network security protocols discussed comply with HIPAA regulations and boost the efficiency of a modern orthodontic clinic.

Rapid and Efficient Redox Processes within 2D Covalent Organic Framework Thin Films

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

DeBlase, Catherine R.; Hernández-Burgos, Kenneth; Silberstein, Katharine E.

2015-03-24

Two-dimensional covalent organic frameworks (2D COFs) are ideally suited for organizing redox-active subunits into periodic, permanently porous polymer networks of interest for pseudocapacitive energy storage. Here we describe a method for synthesizing crystalline, oriented thin films of a redox-active 2D COF on Au working electrodes. The thickness of the COF film was controlled by varying the initial monomer concentration. A large percentage (80–99%) of the anthraquinone groups are electrochemically accessible in films thinner than 200 nm, an order of magnitude improvement over the same COF prepared as a randomly oriented microcrystalline powder. As a result, electrodes functionalized with oriented COFmore » films exhibit a 400% increase in capacitance scaled to electrode area as compared to those functionalized with the randomly oriented COF powder. These results demonstrate the promise of redox-active COFs for electrical energy storage and highlight the importance of controlling morphology for optimal performance.« less

Rapid and Efficient Redox Processes within 2D Covalent Organic Framework Thin Films

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

DeBlase, Catherine R.; Hernández-Burgos, Kenneth; Silberstein, Katharine E.

2015-02-17

Two-dimensional covalent organic frameworks (2D COFs) are ideally suited for organizing redox-active subunits into periodic, permanently porous polymer networks of interest for pseudocapacitive energy storage. Here we describe a method for synthesizing crystalline, oriented thin films of a redox-active 2D COF on Au working electrodes. The thickness of the COF film was controlled by varying the initial monomer concentration. A large percentage (80–99%) of the anthraquinone groups are electrochemically accessible in films thinner than 200 nm, an order of magnitude improvement over the same COF prepared as a randomly oriented microcrystalline powder. As a result, electrodes functionalized with oriented COFmore » films exhibit a 400% increase in capacitance scaled to electrode area as compared to those functionalized with the randomly oriented COF powder. These results demonstrate the promise of redox-active COFs for electrical energy storage and highlight the importance of controlling morphology for optimal performance.« less

Molecular ecological network analyses.

PubMed

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

2012-05-30

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

A New Ticket-Based Authentication Mechanism for Fast Handover in Mesh Network.

PubMed

Lai, Yan-Ming; Cheng, Pu-Jen; Lee, Cheng-Chi; Ku, Chia-Yi

2016-01-01

Due to the ever-growing popularity mobile devices of various kinds have received worldwide, the demands on large-scale wireless network infrastructure development and enhancement have been rapidly swelling in recent years. A mobile device holder can get online at a wireless network access point, which covers a limited area. When the client leaves the access point, there will be a temporary disconnection until he/she enters the coverage of another access point. Even when the coverages of two neighboring access points overlap, there is still work to do to make the wireless connection smoothly continue. The action of one wireless network access point passing a client to another access point is referred to as the handover. During handover, for security concerns, the client and the new access point should perform mutual authentication before any Internet access service is practically gained/provided. If the handover protocol is inefficient, in some cases discontinued Internet service will happen. In 2013, Li et al. proposed a fast handover authentication mechanism for wireless mesh network (WMN) based on tickets. Unfortunately, Li et al.'s work came with some weaknesses. For one thing, some sensitive information such as the time and date of expiration is sent in plaintext, which increases security risks. For another, Li et al.'s protocol includes the use of high-quality tamper-proof devices (TPDs), and this unreasonably high equipment requirement limits its applicability. In this paper, we shall propose a new efficient handover authentication mechanism. The new mechanism offers a higher level of security on a more scalable ground with the client's privacy better preserved. The results of our performance analysis suggest that our new mechanism is superior to some similar mechanisms in terms of authentication delay.

A New Ticket-Based Authentication Mechanism for Fast Handover in Mesh Network

PubMed Central

Lai, Yan-Ming; Cheng, Pu-Jen; Lee, Cheng-Chi; Ku, Chia-Yi

2016-01-01

Due to the ever-growing popularity mobile devices of various kinds have received worldwide, the demands on large-scale wireless network infrastructure development and enhancement have been rapidly swelling in recent years. A mobile device holder can get online at a wireless network access point, which covers a limited area. When the client leaves the access point, there will be a temporary disconnection until he/she enters the coverage of another access point. Even when the coverages of two neighboring access points overlap, there is still work to do to make the wireless connection smoothly continue. The action of one wireless network access point passing a client to another access point is referred to as the handover. During handover, for security concerns, the client and the new access point should perform mutual authentication before any Internet access service is practically gained/provided. If the handover protocol is inefficient, in some cases discontinued Internet service will happen. In 2013, Li et al. proposed a fast handover authentication mechanism for wireless mesh network (WMN) based on tickets. Unfortunately, Li et al.’s work came with some weaknesses. For one thing, some sensitive information such as the time and date of expiration is sent in plaintext, which increases security risks. For another, Li et al.’s protocol includes the use of high-quality tamper-proof devices (TPDs), and this unreasonably high equipment requirement limits its applicability. In this paper, we shall propose a new efficient handover authentication mechanism. The new mechanism offers a higher level of security on a more scalable ground with the client’s privacy better preserved. The results of our performance analysis suggest that our new mechanism is superior to some similar mechanisms in terms of authentication delay. PMID:27171160

BCH codes for large IC random-access memory systems

NASA Technical Reports Server (NTRS)

Lin, S.; Costello, D. J., Jr.

1983-01-01

In this report some shortened BCH codes for possible applications to large IC random-access memory systems are presented. These codes are given by their parity-check matrices. Encoding and decoding of these codes are discussed.

76 FR 35238 - Notice of Receipt of Complaint; Solicitation of Comments Relating to the Public Interest

Federal Register 2010, 2011, 2012, 2013, 2014

2011-06-16

... Static Random Access Memories and Products Containing Same, DN 2816; the Commission is soliciting... importation of certain static random access memories and products containing same. The complaint names as...

Random-access technique for modular bathymetry data storage in a continental shelf wave refraction program

NASA Technical Reports Server (NTRS)

Poole, L. R.

1974-01-01

A study was conducted of an alternate method for storage and use of bathymetry data in the Langley Research Center and Virginia Institute of Marine Science mid-Atlantic continental-shelf wave-refraction computer program. The regional bathymetry array was divided into 105 indexed modules which can be read individually into memory in a nonsequential manner from a peripheral file using special random-access subroutines. In running a sample refraction case, a 75-percent decrease in program field length was achieved by using the random-access storage method in comparison with the conventional method of total regional array storage. This field-length decrease was accompanied by a comparative 5-percent increase in central processing time and a 477-percent increase in the number of operating-system calls. A comparative Langley Research Center computer system cost savings of 68 percent was achieved by using the random-access storage method.

[From guidelines to practice: evaluation of the pediatric care provided by a service of secondary reference in the north of the State of Minas Gerais].

PubMed

Moreira, Laura Monteiro de Castro; Alves, Cláudia Regina Lindgren; Belisário, Soraya Almeida; Bueno, Mariana de Caux; de Moraes, Erica Furtado

2013-06-01

In the State of Minas Gerais, the Secondary Reference Viva Vida Centers (CVVRS) are one of the strategies deployed to tackle the problems in child health. This study sought to evaluate pediatric care provided in a CVVRS, using the guidelines defined when it was set up as a benchmark. A quantitative-qualitative approach was adopted, which included a cross-sectional study with stratified random sampling of 385 medical records of children registered with the program between 2007 and 2009, and analysis of focus groups with strategic actors of the initiative. There were divergences between the user profiles and the target audience in terms of age, hometown and clinical characteristics. Access and use of the service differed depending on the town, due to problems of misinformation concerning the proposal, difficulty of transportation and the fragility of the health network. The centers are considered an innovative and important initiative for the expansion and organization of the health network, though the intended logic is not effectively seen in practice. Interventions for articulation between the network services and adaptation of the agreed guidelines to the regional specificities are necessary.

Metal oxide resistive random access memory based synaptic devices for brain-inspired computing

NASA Astrophysics Data System (ADS)

Gao, Bin; Kang, Jinfeng; Zhou, Zheng; Chen, Zhe; Huang, Peng; Liu, Lifeng; Liu, Xiaoyan

2016-04-01

The traditional Boolean computing paradigm based on the von Neumann architecture is facing great challenges for future information technology applications such as big data, the Internet of Things (IoT), and wearable devices, due to the limited processing capability issues such as binary data storage and computing, non-parallel data processing, and the buses requirement between memory units and logic units. The brain-inspired neuromorphic computing paradigm is believed to be one of the promising solutions for realizing more complex functions with a lower cost. To perform such brain-inspired computing with a low cost and low power consumption, novel devices for use as electronic synapses are needed. Metal oxide resistive random access memory (ReRAM) devices have emerged as the leading candidate for electronic synapses. This paper comprehensively addresses the recent work on the design and optimization of metal oxide ReRAM-based synaptic devices. A performance enhancement methodology and optimized operation scheme to achieve analog resistive switching and low-energy training behavior are provided. A three-dimensional vertical synapse network architecture is proposed for high-density integration and low-cost fabrication. The impacts of the ReRAM synaptic device features on the performances of neuromorphic systems are also discussed on the basis of a constructed neuromorphic visual system with a pattern recognition function. Possible solutions to achieve the high recognition accuracy and efficiency of neuromorphic systems are presented.

Social networks and mental health among people living with human immunodeficiency virus (HIV) in Johannesburg, South Africa.

PubMed

Odek, Willis Omondi

2014-01-01

People living with human immunodeficiency virus (PLHIV) in developing countries can live longer due to improved treatment access, and a deeper understanding of determinants of their quality of life is critical. This study assessed the link between social capital, operationally defined in terms of social networks (group-based and personal social networks) and access to network resources (access to material and non-material resources and social support) and health-related quality of life (HRQoL) among 554 (55% female) adults on HIV treatment through South Africa's public health system. Female study participants were involved with more group-based social networks but had fewer personal social networks in comparison to males. Access to network resources was higher among females and those from larger households but lower among older study participants. Experience of social support significantly increased with household economic status and duration at current residence. Social capital indicators were unrelated to HIV disease status indicators, including duration since diagnosis, CD4 count and viral load. Only a minority (13%) of study participants took part in groups formed by and for predominantly PLHIV (HIV support groups), and participation in such groups was unrelated to their mental or physical health. Personal rather than group-linked social networks and access to network resources were significantly associated with mental but not physical health, after controlling for sociodemographic characteristics. The findings of limited participation in HIV support groups and that the participation in such groups was not significantly associated with physical or mental health may suggest efforts among PLHIV in South Africa to normalise HIV as a chronic illness through broad-based rather than HIV-status bounded social participation, as a strategy for deflecting stigma. Further research is required to examine the effects of HIV treatment on social networking and participation among PLHIV within both rural and other urban settings of South Africa.

Weighted networks as randomly reinforced urn processes

NASA Astrophysics Data System (ADS)

Caldarelli, Guido; Chessa, Alessandro; Crimaldi, Irene; Pammolli, Fabio

2013-02-01

We analyze weighted networks as randomly reinforced urn processes, in which the edge-total weights are determined by a reinforcement mechanism. We develop a statistical test and a procedure based on it to study the evolution of networks over time, detecting the “dominance” of some edges with respect to the others and then assessing if a given instance of the network is taken at its steady state or not. Distance from the steady state can be considered as a measure of the relevance of the observed properties of the network. Our results are quite general, in the sense that they are not based on a particular probability distribution or functional form of the random weights. Moreover, the proposed tool can be applied also to dense networks, which have received little attention by the network community so far, since they are often problematic. We apply our procedure in the context of the International Trade Network, determining a core of “dominant edges.”

Effects of behavioral patterns and network topology structures on Parrondo’s paradox

PubMed Central

Ye, Ye; Cheong, Kang Hao; Cen, Yu-wan; Xie, Neng-gang

2016-01-01

A multi-agent Parrondo’s model based on complex networks is used in the current study. For Parrondo’s game A, the individual interaction can be categorized into five types of behavioral patterns: the Matthew effect, harmony, cooperation, poor-competition-rich-cooperation and a random mode. The parameter space of Parrondo’s paradox pertaining to each behavioral pattern, and the gradual change of the parameter space from a two-dimensional lattice to a random network and from a random network to a scale-free network was analyzed. The simulation results suggest that the size of the region of the parameter space that elicits Parrondo’s paradox is positively correlated with the heterogeneity of the degree distribution of the network. For two distinct sets of probability parameters, the microcosmic reasons underlying the occurrence of the paradox under the scale-free network are elaborated. Common interaction mechanisms of the asymmetric structure of game B, behavioral patterns and network topology are also revealed. PMID:27845430

Effects of behavioral patterns and network topology structures on Parrondo’s paradox

NASA Astrophysics Data System (ADS)

Ye, Ye; Cheong, Kang Hao; Cen, Yu-Wan; Xie, Neng-Gang

2016-11-01

A multi-agent Parrondo’s model based on complex networks is used in the current study. For Parrondo’s game A, the individual interaction can be categorized into five types of behavioral patterns: the Matthew effect, harmony, cooperation, poor-competition-rich-cooperation and a random mode. The parameter space of Parrondo’s paradox pertaining to each behavioral pattern, and the gradual change of the parameter space from a two-dimensional lattice to a random network and from a random network to a scale-free network was analyzed. The simulation results suggest that the size of the region of the parameter space that elicits Parrondo’s paradox is positively correlated with the heterogeneity of the degree distribution of the network. For two distinct sets of probability parameters, the microcosmic reasons underlying the occurrence of the paradox under the scale-free network are elaborated. Common interaction mechanisms of the asymmetric structure of game B, behavioral patterns and network topology are also revealed.

Educational network comparative analysis of small groups: Short- and long-term communications

NASA Astrophysics Data System (ADS)

Berg, D. B.; Zvereva, O. M.; Nazarova, Yu. Yu.; Chepurov, E. G.; Kokovin, A. V.; Ranyuk, S. V.

2017-11-01

The present study is devoted to the discussion of small group communication network structures. These communications were observed in student groups, where actors were united with a regular educational activity. The comparative analysis was carried out for networks of short-term (1 hour) and long-term (4 weeks) communications, it was based on seven structural parameters, and consisted of two stages. At the first stage, differences between the network graphs were examined, and the random corresponding Bernoulli graphs were built. At the second stage, revealed differences were compared. Calculations were performed using UCINET software framework. It was found out that networks of long-term and short-term communications are quite different: the structure of a short-term communication network is close to a random one, whereas the most of long-term communication network parameters differ from the corresponding random ones by more than 30%. This difference can be explained by strong "noisiness" of a short-term communication network, and the lack of social in it.

GSFC network operations with Tracking and Data Relay Satellites

NASA Astrophysics Data System (ADS)

Spearing, R.; Perreten, D. E.

The Tracking and Data Relay Satellite System (TDRSS) Network (TN) has been developed to provide services to all NASA User spacecraft in near-earth orbits. Three inter-relating entities will provide these services. The TN has been transformed from a network continuously changing to meet User specific requirements to a network which is flexible to meet future needs without significant changes in operational concepts. Attention is given to the evolution of the TN network, the TN capabilities-space segment, forward link services, tracking services, return link services, the three basic capabilities, single access services, multiple access services, simulation services, the White Sands Ground Terminal, the NASA communications network, and the network control center.

GSFC network operations with Tracking and Data Relay Satellites

NASA Technical Reports Server (NTRS)

Spearing, R.; Perreten, D. E.

1984-01-01

The Tracking and Data Relay Satellite System (TDRSS) Network (TN) has been developed to provide services to all NASA User spacecraft in near-earth orbits. Three inter-relating entities will provide these services. The TN has been transformed from a network continuously changing to meet User specific requirements to a network which is flexible to meet future needs without significant changes in operational concepts. Attention is given to the evolution of the TN network, the TN capabilities-space segment, forward link services, tracking services, return link services, the three basic capabilities, single access services, multiple access services, simulation services, the White Sands Ground Terminal, the NASA communications network, and the network control center.

Data aggregation in wireless sensor networks using the SOAP protocol

NASA Astrophysics Data System (ADS)

Al-Yasiri, A.; Sunley, A.

2007-07-01

Wireless sensor networks (WSN) offer an increasingly attractive method of data gathering in distributed system architectures and dynamic access via wireless connectivity. Wireless sensor networks have physical and resource limitations, this leads to increased complexity for application developers and often results in applications that are closely coupled with network protocols. In this paper, a data aggregation framework using SOAP (Simple Object Access Protocol) on wireless sensor networks is presented. The framework works as a middleware for aggregating data measured by a number of nodes within a network. The aim of the study is to assess the suitability of the protocol in such environments where resources are limited compared to traditional networks.

Modeling of synchronization behavior of bursting neurons at nonlinearly coupled dynamical networks.

PubMed

Çakir, Yüksel

2016-01-01

Synchronization behaviors of bursting neurons coupled through electrical and dynamic chemical synapses are investigated. The Izhikevich model is used with random and small world network of bursting neurons. Various currents which consist of diffusive electrical and time-delayed dynamic chemical synapses are used in the simulations to investigate the influences of synaptic currents and couplings on synchronization behavior of bursting neurons. The effects of parameters, such as time delay, inhibitory synaptic strengths, and decay time on synchronization behavior are investigated. It is observed that in random networks with no delay, bursting synchrony is established with the electrical synapse alone, single spiking synchrony is observed with hybrid coupling. In small world network with no delay, periodic bursting behavior with multiple spikes is observed when only chemical and only electrical synapse exist. Single-spike and multiple-spike bursting are established with hybrid couplings. A decrease in the synchronization measure is observed with zero time delay, as the decay time is increased in random network. For synaptic delays which are above active phase period, synchronization measure increases with an increase in synaptic strength and time delay in small world network. However, in random network, it increases with only an increase in synaptic strength.

Method for Evaluation of Outage Probability on Random Access Channel in Mobile Communication Systems

NASA Astrophysics Data System (ADS)

Kollár, Martin

2012-05-01

In order to access the cell in all mobile communication technologies a so called random-access procedure is used. For example in GSM this is represented by sending the CHANNEL REQUEST message from Mobile Station (MS) to Base Transceiver Station (BTS) which is consequently forwarded as an CHANNEL REQUIRED message to the Base Station Controller (BSC). If the BTS decodes some noise on the Random Access Channel (RACH) as random access by mistake (so- called ‘phantom RACH') then it is a question of pure coincidence which èstablishment cause’ the BTS thinks to have recognized. A typical invalid channel access request or phantom RACH is characterized by an IMMEDIATE ASSIGNMENT procedure (assignment of an SDCCH or TCH) which is not followed by sending an ESTABLISH INDICATION from MS to BTS. In this paper a mathematical model for evaluation of the Power RACH Busy Threshold (RACHBT) in order to guaranty in advance determined outage probability on RACH is described and discussed as well. It focuses on Global System for Mobile Communications (GSM) however the obtained results can be generalized on remaining mobile technologies (ie WCDMA and LTE).

A new neural network model for solving random interval linear programming problems.

PubMed

Arjmandzadeh, Ziba; Safi, Mohammadreza; Nazemi, Alireza

2017-05-01

This paper presents a neural network model for solving random interval linear programming problems. The original problem involving random interval variable coefficients is first transformed into an equivalent convex second order cone programming problem. A neural network model is then constructed for solving the obtained convex second order cone problem. Employing Lyapunov function approach, it is also shown that the proposed neural network model is stable in the sense of Lyapunov and it is globally convergent to an exact satisfactory solution of the original problem. Several illustrative examples are solved in support of this technique. Copyright © 2017 Elsevier Ltd. All rights reserved.

Exploring activity-driven network with biased walks

NASA Astrophysics Data System (ADS)

Wang, Yan; Wu, Ding Juan; Lv, Fang; Su, Meng Long

We investigate the concurrent dynamics of biased random walks and the activity-driven network, where the preferential transition probability is in terms of the edge-weighting parameter. We also obtain the analytical expressions for stationary distribution and the coverage function in directed and undirected networks, all of which depend on the weight parameter. Appropriately adjusting this parameter, more effective search strategy can be obtained when compared with the unbiased random walk, whether in directed or undirected networks. Since network weights play a significant role in the diffusion process.

Quality of Recovery Evaluation of the Protection Schemes for Fiber-Wireless Access Networks

NASA Astrophysics Data System (ADS)

Fu, Minglei; Chai, Zhicheng; Le, Zichun

2016-03-01

With the rapid development of fiber-wireless (FiWi) access network, the protection schemes have got more and more attention due to the risk of huge data loss when failures occur. However, there are few studies on the performance evaluation of the FiWi protection schemes by the unified evaluation criterion. In this paper, quality of recovery (QoR) method was adopted to evaluate the performance of three typical protection schemes (MPMC scheme, OBOF scheme and RPMF scheme) against the segment-level failure in FiWi access network. The QoR models of the three schemes were derived in terms of availability, quality of backup path, recovery time and redundancy. To compare the performance of the three protection schemes comprehensively, five different classes of network services such as emergency service, prioritized elastic service, conversational service, etc. were utilized by means of assigning different QoR weights. Simulation results showed that, for the most service cases, RPMF scheme was proved to be the best solution to enhance the survivability when planning the FiWi access network.

Bayesian network meta-analysis for cluster randomized trials with binary outcomes.

PubMed

Uhlmann, Lorenz; Jensen, Katrin; Kieser, Meinhard

2017-06-01

Network meta-analysis is becoming a common approach to combine direct and indirect comparisons of several treatment arms. In recent research, there have been various developments and extensions of the standard methodology. Simultaneously, cluster randomized trials are experiencing an increased popularity, especially in the field of health services research, where, for example, medical practices are the units of randomization but the outcome is measured at the patient level. Combination of the results of cluster randomized trials is challenging. In this tutorial, we examine and compare different approaches for the incorporation of cluster randomized trials in a (network) meta-analysis. Furthermore, we provide practical insight on the implementation of the models. In simulation studies, it is shown that some of the examined approaches lead to unsatisfying results. However, there are alternatives which are suitable to combine cluster randomized trials in a network meta-analysis as they are unbiased and reach accurate coverage rates. In conclusion, the methodology can be extended in such a way that an adequate inclusion of the results obtained in cluster randomized trials becomes feasible. Copyright © 2016 John Wiley & Sons, Ltd. Copyright © 2016 John Wiley & Sons, Ltd.

Detecting phase transitions in a neural network and its application to classification of syndromes in traditional Chinese medicine

NASA Astrophysics Data System (ADS)

Chen, J.; Xi, G.; Wang, W.

2008-02-01

Detecting phase transitions in neural networks (determined or random) presents a challenging subject for phase transitions play a key role in human brain activity. In this paper, we detect numerically phase transitions in two types of random neural network(RNN) under proper parameters.

Two betweenness centrality measures based on Randomized Shortest Paths

PubMed Central

Kivimäki, Ilkka; Lebichot, Bertrand; Saramäki, Jari; Saerens, Marco

2016-01-01

This paper introduces two new closely related betweenness centrality measures based on the Randomized Shortest Paths (RSP) framework, which fill a gap between traditional network centrality measures based on shortest paths and more recent methods considering random walks or current flows. The framework defines Boltzmann probability distributions over paths of the network which focus on the shortest paths, but also take into account longer paths depending on an inverse temperature parameter. RSP’s have previously proven to be useful in defining distance measures on networks. In this work we study their utility in quantifying the importance of the nodes of a network. The proposed RSP betweenness centralities combine, in an optimal way, the ideas of using the shortest and purely random paths for analysing the roles of network nodes, avoiding issues involving these two paradigms. We present the derivations of these measures and how they can be computed in an efficient way. In addition, we show with real world examples the potential of the RSP betweenness centralities in identifying interesting nodes of a network that more traditional methods might fail to notice. PMID:26838176

Listening to the Noise: Random Fluctuations Reveal Gene Network Parameters

NASA Astrophysics Data System (ADS)

Munsky, Brian; Trinh, Brooke; Khammash, Mustafa

2010-03-01

The cellular environment is abuzz with noise originating from the inherent random motion of reacting molecules in the living cell. In this noisy environment, clonal cell populations exhibit cell-to-cell variability that can manifest significant prototypical differences. Noise induced stochastic fluctuations in cellular constituents can be measured and their statistics quantified using flow cytometry, single molecule fluorescence in situ hybridization, time lapse fluorescence microscopy and other single cell and single molecule measurement techniques. We show that these random fluctuations carry within them valuable information about the underlying genetic network. Far from being a nuisance, the ever-present cellular noise acts as a rich source of excitation that, when processed through a gene network, carries its distinctive fingerprint that encodes a wealth of information about that network. We demonstrate that in some cases the analysis of these random fluctuations enables the full identification of network parameters, including those that may otherwise be difficult to measure. We use theoretical investigations to establish experimental guidelines for the identification of gene regulatory networks, and we apply these guideline to experimentally identify predictive models for different regulatory mechanisms in bacteria and yeast.

Limited ability driven phase transitions in the coevolution process in Axelrod's model

NASA Astrophysics Data System (ADS)

Wang, Bing; Han, Yuexing; Chen, Luonan; Aihara, Kazuyuki

2009-04-01

We study the coevolution process in Axelrod's model by taking into account of agents' abilities to access information, which is described by a parameter α to control the geographical range of communication. We observe two kinds of phase transitions in both cultural domains and network fragments, which depend on the parameter α. By simulation, we find that not all rewiring processes pervade the dissemination of culture, that is, a very limited ability to access information constrains the cultural dissemination, while an exceptional ability to access information aids the dissemination of culture. Furthermore, by analyzing the network characteristics at the frozen states, we find that there exists a stage at which the network develops to be a small-world network with community structures.

The SPAN cookbook: A practical guide to accessing SPAN

NASA Technical Reports Server (NTRS)

Mason, Stephanie; Tencati, Ronald D.; Stern, David M.; Capps, Kimberly D.; Dorman, Gary; Peters, David J.

1990-01-01

This is a manual for remote users who wish to send electronic mail messages from the Space Physics Analysis Network (SPAN) to scientific colleagues on other computer networks and vice versa. In several instances more than one gateway has been included for the same network. Users are provided with an introduction to each network listed with helpful details about accessing the system and mail syntax examples. Also included is information on file transfers, remote logins, and help telephone numbers.

Nonadditivity of quantum and classical capacities for entanglement breaking multiple-access channels and the butterfly network

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

Grudka, Andrzej; National Quantum Information Centre of Gdansk, PL-81-824 Sopot; Horodecki, Pawel

2010-06-15

We analyze quantum network primitives which are entanglement breaking. We show superadditivity of quantum and classical capacity regions for quantum multiple-access channels and the quantum butterfly network. Since the effects are especially visible at high noise they suggest that quantum information effects may be particularly helpful in the case of the networks with occasional high noise rates. The present effects provide a qualitative borderline between superadditivities of bipartite and multipartite systems.

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.

Perspectives on Networking.

ERIC Educational Resources Information Center

Levy, Sue

1992-01-01

Presents a library automation vendor's perspective on networking based on activities at Ameritech Information Systems. Topics discussed include the information explosion; information technology; user expectations and needs; remote access; the library of the future; systems integration; ownership versus access; copyright laws; and the role of the…

Space Network IP Services (SNIS): An Architecture for Supporting Low Earth Orbiting IP Satellite Missions

NASA Technical Reports Server (NTRS)

Israel, David J.

2005-01-01

The NASA Space Network (SN) supports a variety of missions using the Tracking and Data Relay Satellite System (TDRSS), which includes ground stations in White Sands, New Mexico and Guam. A Space Network IP Services (SNIS) architecture is being developed to support future users with requirements for end-to-end Internet Protocol (IP) communications. This architecture will support all IP protocols, including Mobile IP, over TDRSS Single Access, Multiple Access, and Demand Access Radio Frequency (RF) links. This paper will describe this architecture and how it can enable Low Earth Orbiting IP satellite missions.

Easy Handling of Sensors and Actuators over TCP/IP Networks by Open Source Hardware/Software

PubMed Central

Mejías, Andrés; Herrera, Reyes S.; Márquez, Marco A.; Calderón, Antonio José; González, Isaías; Andújar, José Manuel

2017-01-01

There are several specific solutions for accessing sensors and actuators present in any process or system through a TCP/IP network, either local or a wide area type like the Internet. The usage of sensors and actuators of different nature and diverse interfaces (SPI, I2C, analogue, etc.) makes access to them from a network in a homogeneous and secure way more complex. A framework, including both software and hardware resources, is necessary to simplify and unify networked access to these devices. In this paper, a set of open-source software tools, specifically designed to cover the different issues concerning the access to sensors and actuators, and two proposed low-cost hardware architectures to operate with the abovementioned software tools are presented. They allow integrated and easy access to local or remote sensors and actuators. The software tools, integrated in the free authoring tool Easy Java and Javascript Simulations (EJS) solve the interaction issues between the subsystem that integrates sensors and actuators into the network, called convergence subsystem in this paper, and the Human Machine Interface (HMI)—this one designed using the intuitive graphical system of EJS—located on the user’s computer. The proposed hardware architectures and software tools are described and experimental implementations with the proposed tools are presented. PMID:28067801

Easy Handling of Sensors and Actuators over TCP/IP Networks by Open Source Hardware/Software.

PubMed

Mejías, Andrés; Herrera, Reyes S; Márquez, Marco A; Calderón, Antonio José; González, Isaías; Andújar, José Manuel

2017-01-05

There are several specific solutions for accessing sensors and actuators present in any process or system through a TCP/IP network, either local or a wide area type like the Internet. The usage of sensors and actuators of different nature and diverse interfaces (SPI, I2C, analogue, etc.) makes access to them from a network in a homogeneous and secure way more complex. A framework, including both software and hardware resources, is necessary to simplify and unify networked access to these devices. In this paper, a set of open-source software tools, specifically designed to cover the different issues concerning the access to sensors and actuators, and two proposed low-cost hardware architectures to operate with the abovementioned software tools are presented. They allow integrated and easy access to local or remote sensors and actuators. The software tools, integrated in the free authoring tool Easy Java and Javascript Simulations (EJS) solve the interaction issues between the subsystem that integrates sensors and actuators into the network, called convergence subsystem in this paper, and the Human Machine Interface (HMI)-this one designed using the intuitive graphical system of EJS-located on the user's computer. The proposed hardware architectures and software tools are described and experimental implementations with the proposed tools are presented.

Incentive Mechanism for P2P Content Sharing over Heterogenous Access Networks

NASA Astrophysics Data System (ADS)

Sato, Kenichiro; Hashimoto, Ryo; Yoshino, Makoto; Shinkuma, Ryoichi; Takahashi, Tatsuro

In peer-to-peer (P2P) content sharing, users can share their content by contributing their own resources to one another. However, since there is no incentive for contributing contents or resources to others, users may attempt to obtain content without any contribution. To motivate users to contribute their resources to the service, incentive-rewarding mechanisms have been proposed. On the other hand, emerging wireless technologies, such as IEEE 802.11 wireless local area networks, beyond third generation (B3G) cellular networks and mobile WiMAX, provide high-speed Internet access for wireless users. Using these high-speed wireless access, wireless users can use P2P services and share their content with other wireless users and with fixed users. However, this diversification of access networks makes it difficult to appropriately assign rewards to each user according to their contributions. This is because the cost necessary for contribution is different in different access networks. In this paper, we propose a novel incentive-rewarding mechanism called EMOTIVER that can assign rewards to users appropriately. The proposed mechanism uses an external evaluator and interactive learning agents. We also investigate a way of appropriately controlling rewards based on the system service's quality and managing policy.

Building a Gateway for the CD-ROM Network: A Step toward the Virtual Library with the Virtual Microsystems V-Server.

ERIC Educational Resources Information Center

Sylvia, Margaret

1993-01-01

Describes one college library's experience with a gateway for dial-in access to its CD-ROM network to increase access to automated index searching for students off-campus. Hardware and software choices are discussed in terms of access, reliability, affordability, and ease of use. Installation problems are discussed, and an appendix lists product…

Topological Structure of the Space of Phenotypes: The Case of RNA Neutral Networks

PubMed Central

Aguirre, Jacobo; Buldú, Javier M.; Stich, Michael; Manrubia, Susanna C.

2011-01-01

The evolution and adaptation of molecular populations is constrained by the diversity accessible through mutational processes. RNA is a paradigmatic example of biopolymer where genotype (sequence) and phenotype (approximated by the secondary structure fold) are identified in a single molecule. The extreme redundancy of the genotype-phenotype map leads to large ensembles of RNA sequences that fold into the same secondary structure and can be connected through single-point mutations. These ensembles define neutral networks of phenotypes in sequence space. Here we analyze the topological properties of neutral networks formed by 12-nucleotides RNA sequences, obtained through the exhaustive folding of sequence space. A total of 412 sequences fragments into 645 subnetworks that correspond to 57 different secondary structures. The topological analysis reveals that each subnetwork is far from being random: it has a degree distribution with a well-defined average and a small dispersion, a high clustering coefficient, and an average shortest path between nodes close to its minimum possible value, i.e. the Hamming distance between sequences. RNA neutral networks are assortative due to the correlation in the composition of neighboring sequences, a feature that together with the symmetries inherent to the folding process explains the existence of communities. Several topological relationships can be analytically derived attending to structural restrictions and generic properties of the folding process. The average degree of these phenotypic networks grows logarithmically with their size, such that abundant phenotypes have the additional advantage of being more robust to mutations. This property prevents fragmentation of neutral networks and thus enhances the navigability of sequence space. In summary, RNA neutral networks show unique topological properties, unknown to other networks previously described. PMID:22028856

Allocation of spectral and spatial modes in multidimensional metro-access optical networks

NASA Astrophysics Data System (ADS)

Gao, Wenbo; Cvijetic, Milorad

2018-04-01

Introduction of spatial division multiplexing (SDM) has added a new dimension in an effort to increase optical fiber channel capacity. At the same time, it can also be explored as an advanced optical networking tool. In this paper, we have investigated the resource allocation to end-users in multidimensional networking structure with plurality of spectral and spatial modes actively deployed in different networking segments. This presents a more comprehensive method as compared to the common practice where the segments of optical network are analyzed independently since the interaction between network hierarchies is included into consideration. We explored the possible transparency from the metro/core network to the optical access network, analyzed the potential bottlenecks from the network architecture perspective, and identified an optimized network structure. In our considerations, the viability of optical grooming through the entire hierarchical all-optical network is investigated by evaluating the effective utilization and spectral efficiency of the network architecture.

The Evolving National Information Network: Background and Challenges. A Report of the Technology Assessment Advisory Committee to the Commission on Preservation and Access.

ERIC Educational Resources Information Center

Van Houweling, Douglas E.; McGill, Michael J.

The rapidly developing and changing networking and telecommunications environment now being implemented in the United States and across the globe is explored. The creation of a flexible and inexpensive digital network allowing instantaneous access by any individual to information of any type is now within our grasp. A primer on the technology…

Identity Management Task Force Report 2008

DTIC Science & Technology

2008-01-01

Telecommunication Grid ( GTG ) consists of the public- switched telecommunications network (PSTN), various forms of Internet protocol (IP) networks...to network providers) to a large community of nomadic users and access devices over a wide range of access technologies. The GTG is notional, and...DOC Dr. Myra Gray , DOD Greg Hall, DNI Celia Hanley, DOD Patrick Hannon, DNI James Hass, IC Linda Hill, SSA Bobby Jones, DOC Patrick Hannon

Insider Threats in the Software Development Lifecycle

DTIC Science & Technology

2014-11-05

employee, contractor, or other business partner who • has or had authorized access to an organization’s network , system or data and • intentionally...organization’s network , system, or data and who, through • their action/inaction without malicious intent • cause harm or substantially increase...and female Male Target Network , systems, or data PII or Customer Information IP (trade secrets) or Customer Information Access Used

Statistical modeling of the Internet traffic dynamics: To which extent do we need long-term correlations?

NASA Astrophysics Data System (ADS)

Markelov, Oleg; Nguyen Duc, Viet; Bogachev, Mikhail

2017-11-01

Recently we have suggested a universal superstatistical model of user access patterns and aggregated network traffic. The model takes into account the irregular character of end user access patterns on the web via the non-exponential distributions of the local access rates, but neglects the long-term correlations between these rates. While the model is accurate for quasi-stationary traffic records, its performance under highly variable and especially non-stationary access dynamics remains questionable. In this paper, using an example of the traffic patterns from a highly loaded network cluster hosting the website of the 1998 FIFA World Cup, we suggest a generalization of the previously suggested superstatistical model by introducing long-term correlations between access rates. Using queueing system simulations, we show explicitly that this generalization is essential for modeling network nodes with highly non-stationary access patterns, where neglecting long-term correlations leads to the underestimation of the empirical average sojourn time by several decades under high throughput utilization.

Chromatin accessibility prediction via a hybrid deep convolutional neural network.

PubMed

Liu, Qiao; Xia, Fei; Yin, Qijin; Jiang, Rui

2018-03-01

A majority of known genetic variants associated with human-inherited diseases lie in non-coding regions that lack adequate interpretation, making it indispensable to systematically discover functional sites at the whole genome level and precisely decipher their implications in a comprehensive manner. Although computational approaches have been complementing high-throughput biological experiments towards the annotation of the human genome, it still remains a big challenge to accurately annotate regulatory elements in the context of a specific cell type via automatic learning of the DNA sequence code from large-scale sequencing data. Indeed, the development of an accurate and interpretable model to learn the DNA sequence signature and further enable the identification of causative genetic variants has become essential in both genomic and genetic studies. We proposed Deopen, a hybrid framework mainly based on a deep convolutional neural network, to automatically learn the regulatory code of DNA sequences and predict chromatin accessibility. In a series of comparison with existing methods, we show the superior performance of our model in not only the classification of accessible regions against background sequences sampled at random, but also the regression of DNase-seq signals. Besides, we further visualize the convolutional kernels and show the match of identified sequence signatures and known motifs. We finally demonstrate the sensitivity of our model in finding causative noncoding variants in the analysis of a breast cancer dataset. We expect to see wide applications of Deopen with either public or in-house chromatin accessibility data in the annotation of the human genome and the identification of non-coding variants associated with diseases. Deopen is freely available at https://github.com/kimmo1019/Deopen. ruijiang@tsinghua.edu.cn. Supplementary data are available at Bioinformatics online. © The Author (2017). Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com

Accessibility to primary healthcare in the capital city of a northeastern state of Brazil: an evaluation of the results of a programme.

PubMed

Vieira-da-Silva, Ligia Maria; Chaves, Sonia Cristina Lima; Esperidião, Monique Azevedo; Lopes-Martinho, Rosana Machado

2010-12-01

Organisational barriers to primary healthcare are still relevant in developing countries. Although descriptive reports of some experiences focusing on improving accessibility have been published, few studies have evaluated specific interventions aimed at overcoming the organisational obstacles. To evaluate the results of a project designed to improve accessibility to healthcare services in Salvador, Bahia, Brazil. An evaluative, cross-sectional, ex post facto study that included a control group was carried out in a random sample of 710 users of 25 healthcare units of the primary municipal healthcare network. The association between the project implementation degree and outcome variables was measured by prevalence ratios (PR) and statistical inference was based on Taylor series 95% CIs. Better access to primary healthcare was found in units in which the intervention had been implemented than in those in which it had not been implemented, particularly with respect to reducing avoidable queues, the waiting time for scheduling a consultation (PR=0.23; 95% CI 0.15 to 0.34); the time of arrival in the queue (PR=0.16; 95% CI 0.09 to 0.31) and the introduction of a system for scheduling appointments by telephone (PR=0.76; 95% CI 0.70 to 0.83). Owing to the simplicity of the programme and the impact it achieved, it may be reproduced in other underdeveloped countries to improve access to healthcare services. In addition, some of the instruments may be used in routine programme evaluation.

Cost effective Internet access and video conferencing for a community cancer network.

PubMed Central

London, J. W.; Morton, D. E.; Marinucci, D.; Catalano, R.; Comis, R. L.

1995-01-01

Utilizing the ubiquitous personal computer as a platform, and Integrated Services Digital Network (ISDN) communications, cost effective medical information access and consultation can be provided for physicians at geographically remote sites. Two modes of access are provided: information retrieval via the Internet, and medical consultation video conferencing. Internet access provides general medical information such as current treatment options, literature citations, and active clinical trials. During video consultations, radiographic and pathology images, and medical text reports (e.g., history and physical, pathology, radiology, clinical laboratory reports), may be viewed and simultaneously annotated by either video conference participant. Both information access modes have been employed by physicians at community hospitals which are members of the Jefferson Cancer Network, and oncologists at Thomas Jefferson University Hospital. This project has demonstrated the potential cost effectiveness and benefits of this technology. Images Figure 1 Figure 2 Figure 3 PMID:8563397

Optical fiber cabling technologies for flexible access network

NASA Astrophysics Data System (ADS)

Tanji, Hisashi

2008-07-01

Fiber-to-the-home (FTTH) outside plant infrastructure should be so designed and constructed as to flexibly deal with increasing subscribers and system evolution to be expected in the future, taking minimization of total cost (CAPEX and OPEX) into consideration. With this in mind, fiber access architectures are reviewed and key technologies on optical fiber and cable for supporting flexible access network are presented. Low loss over wide wavelength (low water peak) and bend-insensitive single mode fiber is a future proof solution. Enhanced separable ribbon facilitates mid-span access to individual fibers in a cable installed, improving fiber utilizing efficiency and flexibility of distribution design. It also contributes to an excellent low PMD characteristic which could be required for video RF overlay system or high capacity long reach metro-access convergence network in the future. Bend-insensitive fiber based cabling technique including field installable connector greatly improves fiber/cable handling in installation and maintenance work.

Diffusion in random networks

DOE PAGES

Zhang, Duan Z.; Padrino, Juan C.

2017-06-01

The ensemble 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 pockets connected by tortuous channels. Inside a channel, fluid transport is assumed to be governed by the one-dimensional diffusion equation. Mass balance leads to an integro-differential equation for the pocket 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,more » we consider the one-dimensional mass diffusion in a semi-infinite domain. 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. We found this early time similarity can be explained by random walk theory through the network.« less

Performance Analysis of Optical Mobile Fronthaul for Cloud Radio Access Networks

NASA Astrophysics Data System (ADS)

Zhang, Jiawei; Xiao, Yuming; Li, Hui; Ji, Yuefeng

2017-10-01

Cloud radio access networks (C-RAN) separates baseband units (BBU) of conventional base station to a centralized pool which connects remote radio heads (RRH) through mobile fronthaul. Mobile fronthaul is a new network segment of C-RAN, it is designed to transport digital sampling data between BBU and RRH. Optical transport networks that provide large bandwidth and low latency is a promising fronthaul solution. In this paper, we discuss several optical transport networks which are candidates for mobile fronthaul, analyze their performances including the number of used wavelength, round-trip latency and wavelength utilization.

Design of flood early warning system with wifi network based on smartphone

NASA Astrophysics Data System (ADS)

Supani, Ahyar; Andriani, Yuli; Taqwa, Ahmad

2017-11-01

Today, the development using internet of things enables activities surrounding us to be monitored, controlled, predicted and calculated remotely through connections to the internet network such as monitoring activities of long-distance flood warning with information technology. Applying an information technology in the field of flood early warning has been developed in the world, either connected to internet network or not. The internet network that has been done in this paper is the design of WiFi network to access data of rainfall, water level and flood status at any time with a smartphone coming from flood early warning system. The results obtained when test of data accessing with smartphone are in form of rainfall and water level graphs against time and flood status indicators consisting of 3 flood states: Standby 2, Standby 1 and Flood. It is concluded that data are from flood early warning system has been able to accessed and displayed on smartphone via WiFi network in any time and real time.

Wireless local area network for the dental office.

PubMed

Mupparapu, Muralidhar

2004-01-01

Dental offices are no exception to the implementation of new and advanced technology, especially if it enhances productivity. In a rapidly transforming digital world, wireless technology has a special place, as it has truly "retired the wire" and contributed to the ease and efficient access to patient data and other software-based applications for diagnosis and treatment. If the office or the clinic is networked, access to patient management software, imaging software and treatment planning tools is enhanced. Access will be further enhanced and unrestricted if the entire network is wireless. As with any new, emerging technology, there will be issues that should be kept in mind before adapting to the wireless environment. Foremost is the network security involved in the installation and use of these wireless networks. This short, technical manuscript deals with standards and choices in wireless technology currently available for implementation within a dental office. The benefits of each network security protocol available to protect patient data and boost the efficiency of a modern dental office are discussed.

California hospital networks are narrower in Marketplace than in commercial plans, but access and quality are similar.

PubMed

Haeder, Simon F; Weimer, David L; Mukamel, Dana B

2015-05-01

Do insurance plans offered through the Marketplace implemented by the State of California under the Affordable Care Act restrict consumers' access to hospitals relative to plans offered on the commercial market? And are the hospitals included in Marketplace networks of lower quality compared to those included in the commercial plans? To answer these questions, we analyzed differences in hospital networks across similar plan types offered both in the Marketplace and commercially, by region and insurer. We found that the common belief that Marketplace plans have narrower networks than their commercial counterparts appears empirically valid. However, there does not appear to be a substantive difference in geographic access as measured by the percentage of people residing in at least one hospital market area. More surprisingly, depending on the measure of hospital quality employed, the Marketplace plans have networks with comparable or even higher average quality than the networks of their commercial counterparts. Project HOPE—The People-to-People Health Foundation, Inc.

Percolation and Reinforcement on Complex Networks

NASA Astrophysics Data System (ADS)

Yuan, Xin

Complex networks appear in almost every aspect of our daily life and are widely studied in the fields of physics, mathematics, finance, biology and computer science. This work utilizes percolation theory in statistical physics to explore the percolation properties of complex networks and develops a reinforcement scheme on improving network resilience. This dissertation covers two major parts of my Ph.D. research on complex networks: i) probe--in the context of both traditional percolation and k-core percolation--the resilience of complex networks with tunable degree distributions or directed dependency links under random, localized or targeted attacks; ii) develop and propose a reinforcement scheme to eradicate catastrophic collapses that occur very often in interdependent networks. We first use generating function and probabilistic methods to obtain analytical solutions to percolation properties of interest, such as the giant component size and the critical occupation probability. We study uncorrelated random networks with Poisson, bi-Poisson, power-law, and Kronecker-delta degree distributions and construct those networks which are based on the configuration model. The computer simulation results show remarkable agreement with theoretical predictions. We discover an increase of network robustness as the degree distribution broadens and a decrease of network robustness as directed dependency links come into play under random attacks. We also find that targeted attacks exert the biggest damage to the structure of both single and interdependent networks in k-core percolation. To strengthen the resilience of interdependent networks, we develop and propose a reinforcement strategy and obtain the critical amount of reinforced nodes analytically for interdependent Erdḧs-Renyi networks and numerically for scale-free and for random regular networks. Our mechanism leads to improvement of network stability of the West U.S. power grid. This dissertation provides us with a deeper understanding of the effects of structural features on network stability and fresher insights into designing resilient interdependent infrastructure networks.

Florida: Library Networking and Technology Development.

ERIC Educational Resources Information Center

Wilkins, Barratt, Ed.

1996-01-01

Explains the development of library networks in Florida and the role of the state library. Topics include regional multitype library consortia; a statewide bibliographic database; interlibrary loan; Internet access in public libraries; government information, including remote public access; automation projects; telecommunications; and free-nets.…

Heard it through the grapevine: indirect networks and employee creativity.

PubMed

Hirst, Giles; Van Knippenberg, Daan; Zhou, Jing; Quintane, Eric; Zhu, Cherrie

2015-03-01

Social networks can be important sources of information and insights that may spark employee creativity. The cross-fertilization of ideas depends not just on access to information and insights through one's direct network-the people one actually interacts with--but at least as much on access to the indirect network one's direct ties connect one to (i.e., people one does not interact with directly, but with whom one's direct ties interact). We propose that the reach efficiency of this indirect network--its nonredundancy in terms of interconnections--is positively related to individual creativity. To help specify the boundaries of this positive influence of the indirect network, we also explore how many steps removed the indirect network still adds to creativity. In addition, we propose that the efficiency (nonredundancy) of one's direct network is important here, because more efficient direct networks give one access to indirect networks with greater reach efficiency. Our hypotheses were supported in a multilevel analysis of multisource survey data from 223 sales representatives nested within 11 divisions of a Chinese pharmaceutical company. This analysis also showed that the creative benefits of reach efficiency were evident for 3 and 4 degrees of separation but were greatest for indirect ties that depend only on one's direct ties. PsycINFO Database Record (c) 2015 APA, all rights reserved.

Research of application mode for FTTX technology

NASA Astrophysics Data System (ADS)

Wang, Zhong; Yun, Xiang; Huang, Wei

2009-08-01

With rapid development of Internet and broadband access network, the technologies of xDSL, FTTx+LAN, WLAN have more applications, new network service emerges in endless stream, especially the increase of network game, meeting TV, video on demand, etc. FTTH supports all present and future service with enormous bandwidth, including traditional telecommunication service, traditional data service and traditional TV service, and the future digital TV and VOD. With huge bandwidth of FTTH, it wins the final solution of broadband network, becomes the final goal of development of optical access network. In this paper, technique theory of EPON is introduced at first. At the same time, MAC frame structure, automatic detection and ranging of MPCP, DBA,and multi-LLID of EPON is analyzed. Then, service development ability, cost advantage and maintenance superiority based on EPON technology are carried out. At last,with Cost comparison between FTTH / FTTB building model and the traditional model, FTTB + LAN mode which is suitable for the newadding residential users in general areas and FTTN + DSL mode which is suitable for the old city and rural access network transformation are built up in detail. And FTTN + DSL project of rural information in rural areas and FTTH broadband HOUSE project on service solutions program are analyzed. comparing to the traditional access technologies, EPON technology has the obvious advantages, such as distance transmission, high or wide band, saving line resources, service abilities, etc. These are the qualities which not only be served for home users, but solve more access problems for us effectively.

Critical exponents for diluted resistor networks

NASA Astrophysics Data System (ADS)

Stenull, O.; Janssen, H. K.; Oerding, K.

1999-05-01

An approach by Stephen [Phys. Rev. B 17, 4444 (1978)] is used to investigate the critical properties of randomly diluted resistor networks near the percolation threshold by means of renormalized field theory. We reformulate an existing field theory by Harris and Lubensky [Phys. Rev. B 35, 6964 (1987)]. By a decomposition of the principal Feynman diagrams, we obtain diagrams which again can be interpreted as resistor networks. This interpretation provides for an alternative way of evaluating the Feynman diagrams for random resistor networks. We calculate the resistance crossover exponent φ up to second order in ɛ=6-d, where d is the spatial dimension. Our result φ=1+ɛ/42+4ɛ2/3087 verifies a previous calculation by Lubensky and Wang, which itself was based on the Potts-model formulation of the random resistor network.

A method for validating Rent's rule for technological and biological networks.

PubMed

Alcalde Cuesta, Fernando; González Sequeiros, Pablo; Lozano Rojo, Álvaro

2017-07-14

Rent's rule is empirical power law introduced in an effort to describe and optimize the wiring complexity of computer logic graphs. It is known that brain and neuronal networks also obey Rent's rule, which is consistent with the idea that wiring costs play a fundamental role in brain evolution and development. Here we propose a method to validate this power law for a certain range of network partitions. This method is based on the bifurcation phenomenon that appears when the network is subjected to random alterations preserving its degree distribution. It has been tested on a set of VLSI circuits and real networks, including biological and technological ones. We also analyzed the effect of different types of random alterations on the Rentian scaling in order to test the influence of the degree distribution. There are network architectures quite sensitive to these randomization procedures with significant increases in the values of the Rent exponents.

Network Dynamics of Innovation Processes.

PubMed

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

2018-01-26

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

Network Dynamics of Innovation Processes

NASA Astrophysics Data System (ADS)

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

2018-01-01

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

"I Don't Know What Fun Is": Examining the Intersection of Social Capital, Social Networks, and Social Recovery.

PubMed

Boeri, Miriam; Gardner, Megan; Gerken, Erin; Ross, Melissa; Wheeler, Jack

The purpose of this paper is to understand how people with problematic drug use access positive social capital. Social capital is defined as relations that provide valuable resources to individuals through participation in social networks. People with low socioeconomic status remain at a disadvantage for acquiring positive social capital, a component of recovery capital. The concept of social recovery emphasises the relational processes of recovery. In-depth life history data were collected from 29 individuals who used heroin, cocaine, crack, or methamphetamine for at least five years, have less than a high school education, and unstable employment and housing. Qualitative data were coded for social networks accessed throughout the life course, distinguished by bonding, bridging and linking social capital. Social networks included drug treatment programs; non-drug-using family and friends; religious/spiritual groups; workplace networks, and social clubs/activities. Bonding and/or bridging social capital were acquired through treatment, family and friends, religious/spiritual groups, workplaces, and social clubs. Linking social capital was not acquired through any social networks available, and many barriers to accessing mainstream social networks were found. This is a small study conducted in the US. A greater focus on social recovery is needed to achieve sustained recovery for individuals lacking access to and engagement in mainstream social networks. Social recovery is proposed as an analytical tool as well as for developing prevention, intervention, and treatment strategies.

“I Don’t Know What Fun Is”: Examining the Intersection of Social Capital, Social Networks, and Social Recovery

PubMed Central

Boeri, Miriam; Gardner, Megan; Gerken, Erin; Ross, Melissa; Wheeler, Jack

2016-01-01

Purpose The purpose of this paper is to understand how people with problematic drug use access positive social capital. Social capital is defined as relations that provide valuable resources to individuals through participation in social networks. People with low socioeconomic status remain at a disadvantage for acquiring positive social capital, a component of recovery capital. The concept of social recovery emphasises the relational processes of recovery. Design/methodology/approach In-depth life history data were collected from 29 individuals who used heroin, cocaine, crack, or methamphetamine for at least five years, have less than a high school education, and unstable employment and housing. Qualitative data were coded for social networks accessed throughout the life course, distinguished by bonding, bridging and linking social capital. Findings Social networks included drug treatment programs; non-drug-using family and friends; religious/spiritual groups; workplace networks, and social clubs/activities. Bonding and/or bridging social capital were acquired through treatment, family and friends, religious/spiritual groups, workplaces, and social clubs. Linking social capital was not acquired through any social networks available, and many barriers to accessing mainstream social networks were found. Limitations This is a small study conducted in the US. Social implications A greater focus on social recovery is needed to achieve sustained recovery for individuals lacking access to and engagement in mainstream social networks. Practical implications Social recovery is proposed as an analytical tool as well as for developing prevention, intervention, and treatment strategies. PMID:27668008

Random Bits Forest: a Strong Classifier/Regressor for Big Data

NASA Astrophysics Data System (ADS)

Wang, Yi; Li, Yi; Pu, Weilin; Wen, Kathryn; Shugart, Yin Yao; Xiong, Momiao; Jin, Li

2016-07-01

Efficiency, memory consumption, and robustness are common problems with many popular methods for data analysis. As a solution, we present Random Bits Forest (RBF), a classification and regression algorithm that integrates neural networks (for depth), boosting (for width), and random forests (for prediction accuracy). Through a gradient boosting scheme, it first generates and selects ~10,000 small, 3-layer random neural networks. These networks are then fed into a modified random forest algorithm to obtain predictions. Testing with datasets from the UCI (University of California, Irvine) Machine Learning Repository shows that RBF outperforms other popular methods in both accuracy and robustness, especially with large datasets (N > 1000). The algorithm also performed highly in testing with an independent data set, a real psoriasis genome-wide association study (GWAS).

Proceedings of the Mobile Satellite System Architectures and Multiple Access Techniques Workshop

NASA Technical Reports Server (NTRS)

Dessouky, Khaled

1989-01-01

The Mobile Satellite System Architectures and Multiple Access Techniques Workshop served as a forum for the debate of system and network architecture issues. Particular emphasis was on those issues relating to the choice of multiple access technique(s) for the Mobile Satellite Service (MSS). These proceedings contain articles that expand upon the 12 presentations given in the workshop. Contrasting views on Frequency Division Multiple Access (FDMA), Code Division Multiple Access (CDMA), and Time Division Multiple Access (TDMA)-based architectures are presented, and system issues relating to signaling, spacecraft design, and network management constraints are addressed. An overview article that summarizes the issues raised in the numerous discussion periods of the workshop is also included.

How well do mean field theories of spiking quadratic-integrate-and-fire networks work in realistic parameter regimes?

PubMed

Grabska-Barwińska, Agnieszka; Latham, Peter E

2014-06-01

We use mean field techniques to compute the distribution of excitatory and inhibitory firing rates in large networks of randomly connected spiking quadratic integrate and fire neurons. These techniques are based on the assumption that activity is asynchronous and Poisson. For most parameter settings these assumptions are strongly violated; nevertheless, so long as the networks are not too synchronous, we find good agreement between mean field prediction and network simulations. Thus, much of the intuition developed for randomly connected networks in the asynchronous regime applies to mildly synchronous networks.

Marine C2 in Support of HA/DR: Observations and Critical Assessments Following Super-Typhoon Haiyan

DTIC Science & Technology

2014-06-01

farm (Figure 1), established Internet access over commercial satellite service 6 (Figure 2), and configured a wireless local area network ( WLAN ...included support for a larger diameter wireless local area network ( WLAN ), providing greater freedom of movement for users accessing the GATR...emerging commercial capabilities, both communications systems and handheld/user-access devices involves the establishment of a synergistic application