Search is not available for this dataset
query
stringlengths 1
13.4k
| pos
stringlengths 1
61k
| neg
stringlengths 1
63.9k
| query_lang
stringclasses 147
values | __index_level_0__
int64 0
3.11M
|
|---|---|---|---|---|
Routing Protocols Based on Ant Colony Optimization in Wireless Sensor Networks: A Survey | clustering in sensor networks : a literature survey . | Early predictors of adolescent aggression and adult violence | eng_Latn | 24,000 |
Optimal Beaconing Control for Epidemic Routing in Delay-Tolerant Networks | Pocket switched networks and human mobility in conference environments | Report on the SIGIR 2016 Workshop on Neural Information Retrieval (Neu-IR) | eng_Latn | 24,001 |
A Hybrid Intrusion Detection System of Cluster-based Wireless Sensor Networks | Adaptive protocols for information dissemination in wireless sensor networks | Death by black powder revolver: a case report | kor_Hang | 24,002 |
Castalia Network Animator (CNA): A Visualization Tool for Castalia Wireless Sensor Network Simulator | Energy conservation in wireless sensor networks: A survey | Causal Discovery from Subsampled Time Series Data by Constraint Optimization | ind_Latn | 24,003 |
Opportunistic message routing using multi-layer social networks | Epidemic Routing for Partially-Connected Ad Hoc Networks | Simultaneous Hallucination and Recognition of Low-Resolution Faces Based on Singular Value Decomposition | eng_Latn | 24,004 |
CoReCast: Collision Resilient Broadcasting in Vehicular Networks | SAM: enabling practical spatial multiple access in wireless LAN | VQA: vertica query analyzer | eng_Latn | 24,005 |
Improving Packet Delivery Performance of Publish/Subscribe Protocols in Wireless Sensor Networks | Architectural Styles and the Design of Network-based Software Architectures | Isolated pulmonary metastases define a favorable subgroup in metastatic pancreatic cancer. | eng_Latn | 24,006 |
Spatial Correlation and Mobility Aware Traffic Modeling for Wireless Sensor Networks | Wireless Sensor Networks: A Survey | FOXP1mutations cause intellectual disability and a recognizable phenotype | eng_Latn | 24,007 |
An efficient protocol for authenticated and secure message delivery in vehicular ad hoc networks | New Directions in Cryptography | Adaptive Selective Verification | eng_Latn | 24,008 |
Integrating DTN and MANET routing | Pocket switched networks and human mobility in conference environments | DakNet: rethinking connectivity in developing nations | eng_Latn | 24,009 |
A Multi-Hop Dynamic Path-Selection (MHDP) Algorithm for the Augmented Lifetime of Wireless Sensor Networks | Energy Efficient Clustering Algorithms in Wireless Sensor Networks: A Survey | Indoor optical wireless communication: potential and state-of-the-art | eng_Latn | 24,010 |
Security and Privacy Issues in Wireless Mesh Networks: A Survey | CORE: A Collaborative Reputation Mechanism to enforce node cooperation in Mobile Ad hoc Networks | Robust Rooftop Extraction From Visible Band Images Using Higher Order CRF | eng_Latn | 24,011 |
Secure and Energy-Efficient Disjoint Multipath Routing for WSNs | Denial of Service in Sensor Networks | Superquadric Segmentation in Range Images via Fusion of Region and Boundary Information | eng_Latn | 24,012 |
BlueTorrent: Cooperative Content Sharing for Bluetooth Users | Code torrent: content distribution using network coding in VANET | A Hierarchical Deep Architecture and Mini-batch Selection Method for Joint Traffic Sign and Light Detection | eng_Latn | 24,013 |
Survey over VANET Routing Protocols for Vehicle to Vehicle Communication | A routing strategy for vehicular ad hoc networks in city environments | Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics | eng_Latn | 24,014 |
IoT 5G-UDN Protocols: Practical Model and Evaluation | Network monitoring: Present and future | Joint precision optimization and high level synthesis for approximate computing | eng_Latn | 24,015 |
A Survey of Secure Routing Protocols in Multi-Hop Cellular Networks | Mobile Low Latency Services in 5G | Multi-Head Attention for End-to-End Neural Machine Translation | eng_Latn | 24,016 |
Beyond Traditional DTN Routing: Social Networks for Opportunistic Communication | Efficient routing in intermittently connected mobile networks: the multiple-copy case | surgical reconstruction in female genital mutilation . | eng_Latn | 24,017 |
A functional taxonomy of wireless sensor network devices | Wireless Sensor Networks: A Survey | Data programming with DDLite: putting humans in a different part of the loop | eng_Latn | 24,018 |
Cluster size optimization in sensor networks with decentralized cluster-based protocols | Design of a distributed energy-efficient clustering algorithm for heterogeneous wireless sensor networks | Improve the Quality of Important Sentences for Automatic Text Summarization | eng_Latn | 24,019 |
Portfolio: Searching for relevant functions and their usages in millions of lines of code | Application of Spreading Activation Techniques in Information Retrieval | The impact of data aggregation in wireless sensor networks | eng_Latn | 24,020 |
SPINS : Security Protocols for Sensor Networks | Directed diffusion: a scalable and robust communication paradigm for sensor networks | Epidemic algorithms for replicated database maintenance | eng_Latn | 24,021 |
Is SDN the solution for NDN-VANETs? | CONET: Controlled data packets propagation in vehicular Named Data Networks | Co-operative downloading in vehicular ad-hoc wireless networks | eng_Latn | 24,022 |
Improved Cluster Head Selection for Efficient Data Aggregation in Sensor Networks | Secure data aggregation in wireless sensor networks: A comprehensive overview | Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computation | kor_Hang | 24,023 |
Establishing pairwise keys in distributed sensor networks | The Resurrecting Duckling: Security Issues for Ad-hoc Wireless Networks | homerf™ and swap : wireless networking for the connected home . | eng_Latn | 24,024 |
Secure data aggregation in wireless sensor networks: A comprehensive overview | Design guidelines for wireless sensor networks: communication, clustering and aggregation | Individual Cow Recording and Analysis System for Small Scale Dairy Farmers in Malaysia | eng_Latn | 24,025 |
A link-correlation-aware cross-layer protocol for IoT devices | Multihop cellular: a new architecture for wireless communications | Lithe: Lightweight Secure CoAP for the Internet of Things | eng_Latn | 24,026 |
Target tracking in VANETs using V2V communication with packet load enhancement | IEEE 802.11p: Towards an International Standard for Wireless Access in Vehicular Environments | a hybrid word - character model for abstractive summarization . | eng_Latn | 24,027 |
Research and Design for Rhizoma corydalis Machine Harvester Based on Scattered Planting Mode | The study put forward and designed a mechanical harvest scheme for Rhizoma corydalis according to planting mode in Hanzhong of Shaanxi Province.The machine used fixed groove type digging shovel,single mandatory shaking screen and "Z" screen separation.Its motive power used agricultural small tractors.The machine harvester weight 80 kg and harvest width to one meter.It can completely realize excavation,separation and screening in one procedure.Its structure is simple,easy to use,saving energy and high recovery ratio.The machine have widely application prospect. | In this paper pprivacy attacks to ad hoc routing protocols become an important issue as mobile ad hoc networks enter security critical domains. We modified Rids scheme for node location privacy in ANDOR protocol in mobile adhoc network. RIDS scheme also provide facility for the detection of wormhole attack and node misbehaviors in adhoc network. Different author proposed a different scheme for RIDS for providing security in mobile adhoc network. But all technique suffered common problem that problem is generation of node ID and protection of node ID in location based routing protocol. In this dissertation we modified the RIDS model for node id generation technique for identification of location of secured node. For these process we used cyclic shift technique for node ID generation. Here we discuss RIDS ANDOR and describe our proposed scheme. | eng_Latn | 24,028 |
An Algorithm for Computing the Rupture Degree of Tree | The rupture degree of a noncomplete connected graph G is defined by Y.Li et al as r(G)=max{ω(G-X)- |X|-m(G-X):X∈V(G),ω(G-X)1}.where ω(G-X) is the number of components of G-X and m(G-X) is the order of a largest component of G-X.In this paper,An algorithm for computing the rupture degree of tree is presented. | In this paper pprivacy attacks to ad hoc routing protocols become an important issue as mobile ad hoc networks enter security critical domains. We modified Rids scheme for node location privacy in ANDOR protocol in mobile adhoc network. RIDS scheme also provide facility for the detection of wormhole attack and node misbehaviors in adhoc network. Different author proposed a different scheme for RIDS for providing security in mobile adhoc network. But all technique suffered common problem that problem is generation of node ID and protection of node ID in location based routing protocol. In this dissertation we modified the RIDS model for node id generation technique for identification of location of secured node. For these process we used cyclic shift technique for node ID generation. Here we discuss RIDS ANDOR and describe our proposed scheme. | eng_Latn | 24,029 |
An aphid-injection method for the transmission of barley yellow dwarf virus☆ | Abstract Liquid extracts of two vector-specific strains of barley yellow dwarf virus, made from viruliferous aphids or from infected plants, were injected into Macrosiphum granarium (Kirby) or Rhopalosiphum padi (L.) by means of fine glass needles connected by tubing to a rubber syringe bulb operated by the foot. Each aphid species readily transmitted the virus to oat test plants only if the strain injected was the one that the species regularly transmits from leaves. When 180 individuals of M. granarium were injected and tested on separate plants, 154 survived injection and 58 transmitted virus. Virus was detected in hemolymph of M. granarium given a 1-day acquisition feeding on source plants, and M. granarium transmitted within 1 day after injection. Results of parallel assays of partially purified preparations by means of the aphidinjection and membrane-feeding techniques were in general agreement. | In this paper pprivacy attacks to ad hoc routing protocols become an important issue as mobile ad hoc networks enter security critical domains. We modified Rids scheme for node location privacy in ANDOR protocol in mobile adhoc network. RIDS scheme also provide facility for the detection of wormhole attack and node misbehaviors in adhoc network. Different author proposed a different scheme for RIDS for providing security in mobile adhoc network. But all technique suffered common problem that problem is generation of node ID and protection of node ID in location based routing protocol. In this dissertation we modified the RIDS model for node id generation technique for identification of location of secured node. For these process we used cyclic shift technique for node ID generation. Here we discuss RIDS ANDOR and describe our proposed scheme. | eng_Latn | 24,030 |
Advantages of low-gain Hopfield neurons | Tank and Hopfield have described numerous applications for the neural paradigm proposed by Hopfield in 1984. High-gain amplifiers were used for the neurons in their simulations and hardware implementations. Simulation and experimental results will be presented that illustrate the advantages of low-gain neurons. | Opportunistic Networks, with users as a vital component, appears as a natural evolution of mobile Ad Hoc Networks field, and to some extent, an example of how the Internet of Things work. So, Opportunistic Networks due to their characteristics, need users- centric considerations when it comes to design Opportunistic Networks' routing, privacy, and authentications schemes. However, most mutual authentication schemes proposed for Opportunistic Networks do not consider, on the one hand, the gregarious aspect of users, and on the other hand, the parameter that pre-established contacts could be used in a mutual authentication process. Considering the factors pre-established contacts, Seed OppNet Identity, and traditional cryptography's principles, this paper proposes a realistic multiple levels authentication scheme for short-term and limited-time wireless network environment. The proposed scheme is realistic and achieves anonymity and privacy. | eng_Latn | 24,031 |
Monitoring distributed properties in networks of tiny wireless devices | In this extended abstract we present a framework for monitoring distributed properties in networks of tiny embedded devices. The system consists of a high-level declarative language to express properties and of a flexible runtime that monitors the properties in a fully decentralized fashion. | UE transmitting and receiving data in neighboring service notifies in advance the location information to the server, to start the neighbor service, before Neighbor Discovery the UE to be communicated, the neighborhood comprising a UE to be communicated from the server receiving a degree, UE, based on the degree neighborhood, by searching the UE to be communicated, suppresses unnecessary neighbor discovery. | eng_Latn | 24,032 |
Description of the SD-1 High-Speed Axial Rotation Device | A high-speed axial rotation device capable of carrying animal subjects, the SD-1, was constructed and evaluated for vestibular research at the University of Iowa. The device can be controlled automatically by using a Data-Trak curve-follower programmer, or manually if desired. The drive system for the device is a Schaevitz GSD2PR variable-speed motor with associated electronic components, including a solid-state power supply with excellent voltage regulation capability. The rotating module is dynamically balanced to insure maximum performance and personal safety. Above 50 degrees/sec, angular velocity of the device increases linearly with increases in setting of the speed-control potentiometer. Control of angular velocity can be maintained constant ±0.20% for any specific setting of the speed-control potentiometer. Control of angular acceleration and deceleration is excellent over the range from 1 degree/sec2 to 3 × 103 degrees/sec2. By utilizing either the programmer or plugging unit, angular acceleratio... | In this paper pprivacy attacks to ad hoc routing protocols become an important issue as mobile ad hoc networks enter security critical domains. We modified Rids scheme for node location privacy in ANDOR protocol in mobile adhoc network. RIDS scheme also provide facility for the detection of wormhole attack and node misbehaviors in adhoc network. Different author proposed a different scheme for RIDS for providing security in mobile adhoc network. But all technique suffered common problem that problem is generation of node ID and protection of node ID in location based routing protocol. In this dissertation we modified the RIDS model for node id generation technique for identification of location of secured node. For these process we used cyclic shift technique for node ID generation. Here we discuss RIDS ANDOR and describe our proposed scheme. | eng_Latn | 24,033 |
Gap junction adhesion is necessary for radial migration in the neocortex | This paper describes the first evidence of a role for gap junctions in neuronal migration, and also shows that the adhesive properties of the gap junctions, not the conductivity of their channels, are important for the migration. | In this paper pprivacy attacks to ad hoc routing protocols become an important issue as mobile ad hoc networks enter security critical domains. We modified Rids scheme for node location privacy in ANDOR protocol in mobile adhoc network. RIDS scheme also provide facility for the detection of wormhole attack and node misbehaviors in adhoc network. Different author proposed a different scheme for RIDS for providing security in mobile adhoc network. But all technique suffered common problem that problem is generation of node ID and protection of node ID in location based routing protocol. In this dissertation we modified the RIDS model for node id generation technique for identification of location of secured node. For these process we used cyclic shift technique for node ID generation. Here we discuss RIDS ANDOR and describe our proposed scheme. | eng_Latn | 24,034 |
Receiver Location Privacy in MANET By Using cyclic technique for node ID generation | In this paper pprivacy attacks to ad hoc routing protocols become an important issue as mobile ad hoc networks enter security critical domains. We modified Rids scheme for node location privacy in ANDOR protocol in mobile adhoc network. RIDS scheme also provide facility for the detection of wormhole attack and node misbehaviors in adhoc network. Different author proposed a different scheme for RIDS for providing security in mobile adhoc network. But all technique suffered common problem that problem is generation of node ID and protection of node ID in location based routing protocol. In this dissertation we modified the RIDS model for node id generation technique for identification of location of secured node. For these process we used cyclic shift technique for node ID generation. Here we discuss RIDS ANDOR and describe our proposed scheme. | Wireless connectivity, the internet of things, smart technologies and applications will all create new EMC challenges, in both expected and unexpected forms. Traceable metrology needs to be developed, both to characterize and optimize these future systems, and to minimize interference and EMC problems. This paper looks at metrology and EMC challenges related to 5G and beyond communications, and what NIST is doing towards solutions. | eng_Latn | 24,035 |
Transmission of beet yellows and beet mosaic viruses by noncolonizing aphid vectors. | A late Rhopalosiphum padi (L.), Acyrthosiphon kondoi Shinji, and Diuraphis no:xia (Mordvilko) transmitted beet yellows virus (BYV) and beet mosaic virus (BMV) in laboratory tests. In single probe acquisition tests, A. kondoi! and D. no:xia failed to transmit BMV, but both transmitted the virus successfully in free-choice arena tests. A. kondoi and D. no:xia are new vectors of beet yellows and beet mosaic virus. None of the three aphids colonize sugar beets but may be important in BYV and BMV epidemiology. | In Mobile Social Networks (MSN) users can participate in communication based on their mutual interests. Many solutions for Mobile Ad Hoc networks have been proposed however content based communication in partially or intermittently connected MANETs has been a recent research area. In this paper we present an adaptive protocol to facilitate implementation of a Mobile Social Network based on peer to peer content driven communication when end-to-end connectivity is not possible. The proposed protocol takes into account the information about user's interests, content based data storing and forwarding, and host mobility in a disconnected, delay tolerant MANET. | eng_Latn | 24,036 |
Comment on "Random-field Ising model as a dynamical system" | It is analytically shown that the gap which produces the fractal structure of the attractor of the dynamical system vanishes linearly if the exchange reaches a critical value in contrast to the $\frac{5}{2}$ power law claimed to be observed numerically by Satija Phys. Rev. B 35 6877 (1987). Several other statements of this paper are critically discussed. | In this paper pprivacy attacks to ad hoc routing protocols become an important issue as mobile ad hoc networks enter security critical domains. We modified Rids scheme for node location privacy in ANDOR protocol in mobile adhoc network. RIDS scheme also provide facility for the detection of wormhole attack and node misbehaviors in adhoc network. Different author proposed a different scheme for RIDS for providing security in mobile adhoc network. But all technique suffered common problem that problem is generation of node ID and protection of node ID in location based routing protocol. In this dissertation we modified the RIDS model for node id generation technique for identification of location of secured node. For these process we used cyclic shift technique for node ID generation. Here we discuss RIDS ANDOR and describe our proposed scheme. | eng_Latn | 24,037 |
[Rheological parameters in hemorrhoid pathology]. | The authors studied erythrocyte aggregation in 62 patients suffering from hemorrhoidal disease, distributed on the basis of proctoscopy findings between three groups (recent uncomplicated congestive attack, recent thrombosed hemorrhoid, stage IIb or III chronic prolapse). This hemorheological parameter is a sensitive marker of circulatory stasis. Values measured were compared with those obtained in 21 healthy subjects. Erythrocyte aggregation index was significantly higher in patients than in controls (31.6 +/- 6.8 versus 27.7 +/- 4.4) (p < 0.05). This difference was due essentially to increased values in patients with acute hemorrhoid problems. A parallel increase in blood fibrinogen was found in these same patients. Hemorheological changes could predispose to worsening of venous stasis in the hemorrhoidal circulation and participate in the onset or spread of thrombotic processes. | In this paper pprivacy attacks to ad hoc routing protocols become an important issue as mobile ad hoc networks enter security critical domains. We modified Rids scheme for node location privacy in ANDOR protocol in mobile adhoc network. RIDS scheme also provide facility for the detection of wormhole attack and node misbehaviors in adhoc network. Different author proposed a different scheme for RIDS for providing security in mobile adhoc network. But all technique suffered common problem that problem is generation of node ID and protection of node ID in location based routing protocol. In this dissertation we modified the RIDS model for node id generation technique for identification of location of secured node. For these process we used cyclic shift technique for node ID generation. Here we discuss RIDS ANDOR and describe our proposed scheme. | eng_Latn | 24,038 |
Comparison of Two Rigid Pavement Design Methods | A comparison of the design thickness of rigid pavement slabs as determined by the AASHTO and PCA methods is presented. The comparison is given for a wide range of truck volumes and axle weights to represent the loadings that are likely to occur on facilities ranging from residential streets to major freeways. The effect of foundation strength on slab thickness is also examined for each design method. | In this paper pprivacy attacks to ad hoc routing protocols become an important issue as mobile ad hoc networks enter security critical domains. We modified Rids scheme for node location privacy in ANDOR protocol in mobile adhoc network. RIDS scheme also provide facility for the detection of wormhole attack and node misbehaviors in adhoc network. Different author proposed a different scheme for RIDS for providing security in mobile adhoc network. But all technique suffered common problem that problem is generation of node ID and protection of node ID in location based routing protocol. In this dissertation we modified the RIDS model for node id generation technique for identification of location of secured node. For these process we used cyclic shift technique for node ID generation. Here we discuss RIDS ANDOR and describe our proposed scheme. | eng_Latn | 24,039 |
Method and apparatus for transmitting frames across a communication network | A method and apparatus include a scheduling entity (208) for selecting a coding scheme and transmitting the frame (304) across a communication network (100). The controller (206) coupled to scheduling entity (208) determines a transmission gain for the frame based on the received signal interference and assigned reliability factor for the communication node. The scheduler entity (208) selects the lowest coding scheme for the frame corresponding to the determined transmission gain. The transceiver (214) coupled to controller (206) via interface (212) receives the encoded frame and transmits the frame to a plurality of mobile stations in the communication network (100). | Increases in mobile device processing power, storage capacity, and connectivity in recent years have led to a rapid rise in mobile device use. But mobile users face challenges in making connections with other users in order to share resources. To address this issue, we propose an architecture that uses peer-to-peer protocol to establish a resource sharing platform for mobile devices, combined with a data grid to help analyze and classify resources. | eng_Latn | 24,040 |
Diagnosis and management of a ruptured rudimentary horn pregnancy in a low-resource setting. | A 22-year-old woman presented with amenorrhoea, lower abdominal pain and brown vaginal discharge. She was noted to be in hypovolaemic shock with a distended and peritonitic abdomen. On bimanual examination, the uterus was not palpated, the posterior fornix was full and cervical excitation was present. A clinical diagnosis of a ruptured ectopic pregnancy was made. She was resuscitated and an emergency laparotomy was performed. Intraoperatively, a ruptured rudimentary horn with an ex utero pregnancy was discovered. The right horn and tube were removed, as was the non-viable fetus. There were no postoperative complications and the patient was discharged after 5 days of observation. | In this paper pprivacy attacks to ad hoc routing protocols become an important issue as mobile ad hoc networks enter security critical domains. We modified Rids scheme for node location privacy in ANDOR protocol in mobile adhoc network. RIDS scheme also provide facility for the detection of wormhole attack and node misbehaviors in adhoc network. Different author proposed a different scheme for RIDS for providing security in mobile adhoc network. But all technique suffered common problem that problem is generation of node ID and protection of node ID in location based routing protocol. In this dissertation we modified the RIDS model for node id generation technique for identification of location of secured node. For these process we used cyclic shift technique for node ID generation. Here we discuss RIDS ANDOR and describe our proposed scheme. | eng_Latn | 24,041 |
A novel improved particle swarm optimization frame work for reconfiguration of radial distribution system | Electrical feeder reconfiguration performs a crucial task in operating the topological formation of distribution feeders by varying the open/close condition of the switches in each normal and abnormal working environments. In the present paper an Improved Particle Swarm Optimization (IPSO) strategy are developed for distribution reconfiguration problem. The network reconfiguration has been carried out by employing a 33 bus radial distribution system for normal standard situations and condition in the occurrence of the fault. The Improved Particle Swarm Optimization (IPSO) approach has conveyed considerable minimization of real power losses in the time of normal situation of operation. During occurrence of fault the reconfiguration process could enhance the quantity of load centers provided and thus the whole load. It could be clearly determined that the proposed approach conveys an enhanced performance. | In this paper pprivacy attacks to ad hoc routing protocols become an important issue as mobile ad hoc networks enter security critical domains. We modified Rids scheme for node location privacy in ANDOR protocol in mobile adhoc network. RIDS scheme also provide facility for the detection of wormhole attack and node misbehaviors in adhoc network. Different author proposed a different scheme for RIDS for providing security in mobile adhoc network. But all technique suffered common problem that problem is generation of node ID and protection of node ID in location based routing protocol. In this dissertation we modified the RIDS model for node id generation technique for identification of location of secured node. For these process we used cyclic shift technique for node ID generation. Here we discuss RIDS ANDOR and describe our proposed scheme. | eng_Latn | 24,042 |
A Folded RFID Tag Antennas Based on Hilbert Fractal Structure | Based on Hilbert theory and technique, a folded tag antenna for RFID application is presented in this paper. In order to reduce the size of tag, a Hilbert fractal structure is employed. Additionally, to match flexibly the impedance between antenna and chip, a folded technique is employed. The input impedance of tag antenna can be adjusted easily by changing the high of folded structure. A designed tag antenna dimension is 23.32mm×7.66mm, and its return loss, bandwidth, gain and theoretical detection distance are given at 2.45GHz by HFSS software. The simulation results show that the designed antenna can meet the requirements of the practical applications. | In this paper pprivacy attacks to ad hoc routing protocols become an important issue as mobile ad hoc networks enter security critical domains. We modified Rids scheme for node location privacy in ANDOR protocol in mobile adhoc network. RIDS scheme also provide facility for the detection of wormhole attack and node misbehaviors in adhoc network. Different author proposed a different scheme for RIDS for providing security in mobile adhoc network. But all technique suffered common problem that problem is generation of node ID and protection of node ID in location based routing protocol. In this dissertation we modified the RIDS model for node id generation technique for identification of location of secured node. For these process we used cyclic shift technique for node ID generation. Here we discuss RIDS ANDOR and describe our proposed scheme. | eng_Latn | 24,043 |
OTA methods for 5G BTS testing — Survey of potential approaches | Through the recent decades, the technical area of antenna testing has undergone disruptive changes, since modern telecommunication systems demand ever increasing test cases. OTA (Over the Air) testing initially mostly concerned making sure that cellular phones complied with radiation pattern and efficiency requirements [1]. For future BTS (Base Transceiver Station) systems, OTA testing will cover a much larger proportion of the testing needed for a transceiver product. Testing of multi-antenna devices will further require more advanced test methods, in many times involving spatial channel models [2]. This paper presents different existing OTA test methods of wireless transceivers, and what adaptations of these which may be needed for testing future 5G BTS systems. Aspects of both conformance testing and performance testing are discussed. | Recent routing/multicast protocols in large-scale mobile ad-hoc networks (MANETs) adopt two-tier infrastructures by selecting backbone hosts (BHs) in order to avoid the inefficiency of the flooding. Further, previous MANET quality-of-service (QoS) routing/multicasting protocols determined bandwidth-satisfied routes for QoS applications. However, they suffer from two bandwidth-violation problems. In this paper, a novel algorithm that can avoid the two problems is proposed and integrated with the two-tier infrastructures to construct bandwidth-satisfied multicast trees for QoS applications in large-scale MANETs. | eng_Latn | 24,044 |
A genetic tuning algorithm of PID parameters | PID control schemes have been widely used in most of process control systems represented by chemical process for a long time. However, it is still a very important problem how to determine or tune the PID parameters, because these parameters have a great influence on the stability and the performance of the control system. On the other hand, in the last twenty years, a genetic algorithm is attracted as one method which gives us optimal answers for search, optimization and machine learning problems. In this paper, we propose a new genetic tuning algorithm of PID parameters, in which the search area of PID parameters is reduced sharply by considering an effective parameters' area from the viewpoint of the control performance. | In this paper pprivacy attacks to ad hoc routing protocols become an important issue as mobile ad hoc networks enter security critical domains. We modified Rids scheme for node location privacy in ANDOR protocol in mobile adhoc network. RIDS scheme also provide facility for the detection of wormhole attack and node misbehaviors in adhoc network. Different author proposed a different scheme for RIDS for providing security in mobile adhoc network. But all technique suffered common problem that problem is generation of node ID and protection of node ID in location based routing protocol. In this dissertation we modified the RIDS model for node id generation technique for identification of location of secured node. For these process we used cyclic shift technique for node ID generation. Here we discuss RIDS ANDOR and describe our proposed scheme. | eng_Latn | 24,045 |
Two algorithms for non-rigid image registration and their evaluation | This paper presents two non-rigid image registration algorithms: Thirion's Demons method and its spline-based extension, and compares their performance on the task of inter-subject registration of MRI brain images. The methods are designed to be fast and derive their speed from the uncoupling of the correspondence calculation and deformation interpolation procedures, each of which are then amenable to efficient implementation. The evaluation results indicate that this uncoupling does not significantly limit the registration accuracy that can be achieved. | In this paper pprivacy attacks to ad hoc routing protocols become an important issue as mobile ad hoc networks enter security critical domains. We modified Rids scheme for node location privacy in ANDOR protocol in mobile adhoc network. RIDS scheme also provide facility for the detection of wormhole attack and node misbehaviors in adhoc network. Different author proposed a different scheme for RIDS for providing security in mobile adhoc network. But all technique suffered common problem that problem is generation of node ID and protection of node ID in location based routing protocol. In this dissertation we modified the RIDS model for node id generation technique for identification of location of secured node. For these process we used cyclic shift technique for node ID generation. Here we discuss RIDS ANDOR and describe our proposed scheme. | eng_Latn | 24,046 |
Using Iterative Ridge Regression to Explore Associations Between Conditioned Variables | Abstract We address a specific case of joint probability mapping, where the information presented is the probabilistic associations of random variables under a certain condition variable (conditioned associations). Bayesian and dependency networks graphically map the joint probabilities of random variables, though both networks may identify associations that are independent of the condition (background associations). Since the background associations have the same topological features as conditioned associations, it is difficult to discriminate between conditioned and non-conditioned associations, which results in a major increase in the search space. We introduce a modification of the dependency network method, which produces a directed graph, containing only condition-related associations. The graph nodes represent the random variables and the graph edges represent the associations that arise under the condition variable. This method is based on ridge-regression, where one can utilize a numerically robu... | In this paper pprivacy attacks to ad hoc routing protocols become an important issue as mobile ad hoc networks enter security critical domains. We modified Rids scheme for node location privacy in ANDOR protocol in mobile adhoc network. RIDS scheme also provide facility for the detection of wormhole attack and node misbehaviors in adhoc network. Different author proposed a different scheme for RIDS for providing security in mobile adhoc network. But all technique suffered common problem that problem is generation of node ID and protection of node ID in location based routing protocol. In this dissertation we modified the RIDS model for node id generation technique for identification of location of secured node. For these process we used cyclic shift technique for node ID generation. Here we discuss RIDS ANDOR and describe our proposed scheme. | eng_Latn | 24,047 |
A general strategy for cloning viroids and other small circular RNAs that uses minimal amounts of template and does not require prior knowledge of its sequence | Abstract Two PCR-based methods are described for obtaining clones of small circular RNAs of unknown sequence and for which only minute amounts are available. To avoid introducing any assumption about the RNA sequence, synthesis of the cDNAs is initiated with random primers. The cDNA population is then PCR-amplified using a primer whose sequence is present at both sides of the cDNAs, since they have been obtained with random hexamers and then a linker with the sequence of the PCR primer has been ligated to their termini, or because the cDNAs have been synthesized with an oligonucleotide that contains the sequence of the PCR primer at its 5′ end and six randomized positions at its 3′ end. The procedures need only approximately 50 ng of purified RNA template. The reasons for the emergence of cloning artifacts and precautions to avoid them are discussed. | In this paper pprivacy attacks to ad hoc routing protocols become an important issue as mobile ad hoc networks enter security critical domains. We modified Rids scheme for node location privacy in ANDOR protocol in mobile adhoc network. RIDS scheme also provide facility for the detection of wormhole attack and node misbehaviors in adhoc network. Different author proposed a different scheme for RIDS for providing security in mobile adhoc network. But all technique suffered common problem that problem is generation of node ID and protection of node ID in location based routing protocol. In this dissertation we modified the RIDS model for node id generation technique for identification of location of secured node. For these process we used cyclic shift technique for node ID generation. Here we discuss RIDS ANDOR and describe our proposed scheme. | eng_Latn | 24,048 |
Research on the Packets Marking Schemes of Reconstructing-Path in Network Attack | The paper analyzes the probabilistic FMS (Fragment Marking Scheme) of IP traceback , points out some limitations of such schemes, and discusses a scheme based on probabilistic marking packet by using algebraic coding theory. The victim can use the edges sampled in these packets to reconstruct attack path. The algebraic method is analyzed of marking packets and reconstructing attack path algorithm. The performance of this method is analyzed and compared with FMS. The scheme has very low network and router overhead and support incremental deployment in IPv 6. | By borrowing some concepts as patch, corridor, matrix and their index coefficients from landscape ecology, and using the basic principles and steps of landscape-planning, this article founds a operational theoretical model of the development of tour landscape in urban districts. | eng_Latn | 24,049 |
On Spectrum Probing in Cognitive Radio Networks: Does Randomization Matter? | In cognitive radio networks, dynamic spectrum access is achieved by allowing secondary users (SUs) to probe the spectrum and utilize available channels opportunistically. Spectrum probing mechanisms should be efficient and fast to avoid harmful interference with primary users (PUs). Periodic probing has been commonly adopted as a default spectrum probing mechanism. In this paper, we attempt to study different spectrum probing mechanisms and evaluate a performance metric called the probing delay, i.e., how quickly a probing mechanism can detect a channel change. We find that randomization in the probing strategy does affect the probing delay. Specifically, in the independent sensing scenario, periodic probing indeed achieves the smallest probing delay. In the cooperative sensing scenario, however, randomization can drastically reduce the probing delay. | In this paper pprivacy attacks to ad hoc routing protocols become an important issue as mobile ad hoc networks enter security critical domains. We modified Rids scheme for node location privacy in ANDOR protocol in mobile adhoc network. RIDS scheme also provide facility for the detection of wormhole attack and node misbehaviors in adhoc network. Different author proposed a different scheme for RIDS for providing security in mobile adhoc network. But all technique suffered common problem that problem is generation of node ID and protection of node ID in location based routing protocol. In this dissertation we modified the RIDS model for node id generation technique for identification of location of secured node. For these process we used cyclic shift technique for node ID generation. Here we discuss RIDS ANDOR and describe our proposed scheme. | eng_Latn | 24,050 |
Light microscopic analysis of contacts between pairs of identified leech neurons with combined use of horseradish peroxidase and lucifer yellow | Intracellular injections of horseradish peroxidase (HRP) and Lucifer Yellow (LY) were used to determine the locations of possible synaptic contacts between pairs of identified leech neurons. The pairs studied were ipsilateral touch sensory neurons (T cells), T cells plus the large longitudinal motoneuron (L cell), and T cells plus the annulus erector motoneuron (AE cell). The joint use of epi-fluorescence and transmitted light permitted the simultaneous observation of the processes of the HRP- and LY-filled cells. Our results indicate that, within the resolution of the light microscope, (a) over 40% of the varicosities of a T cell are in contact with those of another ipsilateral T cell, (b) both ipsilateral and contralateral T cells make numerous contacts with the two motoneurons studied, and (c) T cell- motoneuron contacts are distributed widely within the region where the cells overlap in the neuropil and occur on both major and minor processes of the motoneurons. | For achieving the optimal performances and the longest lifetime of wireless sensor networks,the design of network routing protocol is very important.This paper analyzes many challenges of wireless sensor network routing protocol,and then discusses the well-known LEACH routing protocol and its evolution protocols HEED and PEGASIS in wireless sensor networks.Based on theoretical analysis,it compares comprehensively the performances such as network lifetime and delay of these routing protocols,and presents the corresponding simulation process and results. | eng_Latn | 24,051 |
The concept of a dynamic parameter | Summary form only. The author introduces the concept of a dynamic parameter, a concept based on the fact that a component (for this study, an electric motor) possesses many attributes of a dynamic role. A system's function can be expressed as a function of the motor-related sensors, interlocks, instrumentation, and other actuating devices. This process can be used to build intelligent structures. These structures would be expert-defined and become powerful communication highways which include traditional or classical engineering relationships as well as specific new relationships defined in the present work. > | In this paper pprivacy attacks to ad hoc routing protocols become an important issue as mobile ad hoc networks enter security critical domains. We modified Rids scheme for node location privacy in ANDOR protocol in mobile adhoc network. RIDS scheme also provide facility for the detection of wormhole attack and node misbehaviors in adhoc network. Different author proposed a different scheme for RIDS for providing security in mobile adhoc network. But all technique suffered common problem that problem is generation of node ID and protection of node ID in location based routing protocol. In this dissertation we modified the RIDS model for node id generation technique for identification of location of secured node. For these process we used cyclic shift technique for node ID generation. Here we discuss RIDS ANDOR and describe our proposed scheme. | eng_Latn | 24,052 |
Optimal Design of Semi-Rigid Braced Frames Via Knowledge-Based Approach | Semi-rigid design represents, by its intrinsic nature, a new option aimed at improving the competitiveness of steel construction. This objective can be achieved via Knowledge-Based approaches. In the perspective of design automation, our research proposes a novel methodology for the detailed analysis of a braced building frame adopting semi-rigid steel joints. A software tool was developed in order to enforce such methodology, which provides the most cost-effective solution complying with Eurocode specifications. The first results of a numerical study are also briefly discussed. | In this paper pprivacy attacks to ad hoc routing protocols become an important issue as mobile ad hoc networks enter security critical domains. We modified Rids scheme for node location privacy in ANDOR protocol in mobile adhoc network. RIDS scheme also provide facility for the detection of wormhole attack and node misbehaviors in adhoc network. Different author proposed a different scheme for RIDS for providing security in mobile adhoc network. But all technique suffered common problem that problem is generation of node ID and protection of node ID in location based routing protocol. In this dissertation we modified the RIDS model for node id generation technique for identification of location of secured node. For these process we used cyclic shift technique for node ID generation. Here we discuss RIDS ANDOR and describe our proposed scheme. | eng_Latn | 24,053 |
On the Ranked Points of A pi 0 1 Set. | The rank of an element of the Cantor space is considered and ranked points that are not π 2 0 singletons are constructed. Results about Turing equivalence in terms of ranks of points are givers | In this paper pprivacy attacks to ad hoc routing protocols become an important issue as mobile ad hoc networks enter security critical domains. We modified Rids scheme for node location privacy in ANDOR protocol in mobile adhoc network. RIDS scheme also provide facility for the detection of wormhole attack and node misbehaviors in adhoc network. Different author proposed a different scheme for RIDS for providing security in mobile adhoc network. But all technique suffered common problem that problem is generation of node ID and protection of node ID in location based routing protocol. In this dissertation we modified the RIDS model for node id generation technique for identification of location of secured node. For these process we used cyclic shift technique for node ID generation. Here we discuss RIDS ANDOR and describe our proposed scheme. | eng_Latn | 24,054 |
A General Route to Bridged Azabicyclic Compounds Using Radical Translocation/Cyclization Reactions | This review summarizes a general route to bridged azabicyclic compounds using tributyltin hydride-mediated radical translocation/cyclization reactions. | In this paper pprivacy attacks to ad hoc routing protocols become an important issue as mobile ad hoc networks enter security critical domains. We modified Rids scheme for node location privacy in ANDOR protocol in mobile adhoc network. RIDS scheme also provide facility for the detection of wormhole attack and node misbehaviors in adhoc network. Different author proposed a different scheme for RIDS for providing security in mobile adhoc network. But all technique suffered common problem that problem is generation of node ID and protection of node ID in location based routing protocol. In this dissertation we modified the RIDS model for node id generation technique for identification of location of secured node. For these process we used cyclic shift technique for node ID generation. Here we discuss RIDS ANDOR and describe our proposed scheme. | eng_Latn | 24,055 |
Precise dynamic slicing algorithms | Dynamic slicing algorithms can greatly reduce the de bugging effort by focusing the attention of the user on a relevant subset of program statements. In this paper we present the design and evaluation of three precise dynamic slicing algorithms called the full preprocessing (FP), no preprocessing (NP) and limited preprocessing (LP) algorithms. The algorithms differ in the relative timing of constructing the dynamic data dependence graph and its traversal for computing requested dynamic slices. Our experiments show that the LP algorithm is a fast and practical precise slicing algorithm. In fact we show that while precise slices can be orders of magnitude smaller than imprecise dynamic slices, for small number of slicing requests, the LP algorithm is faster than an imprecise dynamic slicing algorithm proposed by Agrawal and Horgan. | In this paper pprivacy attacks to ad hoc routing protocols become an important issue as mobile ad hoc networks enter security critical domains. We modified Rids scheme for node location privacy in ANDOR protocol in mobile adhoc network. RIDS scheme also provide facility for the detection of wormhole attack and node misbehaviors in adhoc network. Different author proposed a different scheme for RIDS for providing security in mobile adhoc network. But all technique suffered common problem that problem is generation of node ID and protection of node ID in location based routing protocol. In this dissertation we modified the RIDS model for node id generation technique for identification of location of secured node. For these process we used cyclic shift technique for node ID generation. Here we discuss RIDS ANDOR and describe our proposed scheme. | eng_Latn | 24,056 |
"LMITs" - Load Management Innovative Techniques | This paper is one of a series for use in ``LMITs'' Load Management Innovative Techniques forums. The goal of these forums is to focus attention on new load management techniques being developed by utilities. In particular, it is intended to highlight innovative techniques so as to foster interest and discussion by IEEE members in new deas in this rapidly developing technology area. The four short note reports by the contributing authors discuss a new and different load management technique being tried at four different utility companies. | This document describes a minimal mode of operation for an IPv6 over ::: the TSCH mode of IEEE 802.15.4e (6TiSCH) network. This minimal mode of ::: operation specifies the baseline set of protocols that need to be ::: supported and the recommended configurations and modes of operation ::: sufficient to enable a 6TiSCH functional network. 6TiSCH provides IPv6 ::: connectivity over a Time-Slotted Channel Hopping (TSCH) mesh composed ::: of IEEE Std 802.15.4 TSCH links. This minimal mode uses a collection ::: of protocols with the respective configurations, including the IPv6 ::: Low-Power Wireless Personal Area Network (6LoWPAN) framework, enabling ::: interoperable IPv6 connectivity over IEEE Std 802.15.4 TSCH. This ::: minimal configuration provides the necessary bandwidth for network and ::: security bootstrapping and defines the proper link between the IETF ::: protocols that interface to IEEE Std 802.15.4 TSCH. This minimal mode ::: of operation should be implemented by all 6TiSCH-compliant devices. | eng_Latn | 24,057 |
A Cross-Layer Two-Stage Scheduler for Wireless LANs | In this paper, a cross-layer scheduler for wireless LAN access points is introduced which includes a MAC and a PHY layer stage. For the MAC scheduler, both a simple round-robin scheme and an adaptive scheme which considers both the queue length and the packet lifetimes of each flow are considered. The MAC scheduler hands over a list with the most important packets to the PHY scheduler, which selects one or more packets according to the channel capacity available for the respective destination stations. It is shown that the combination of the MAC and the PHY layer scheduler increases the throughput while the delay is reduced. Fairness is supported in the way that the performance is enhanced not only for the entire system, but also for the individual flows. | SUMMARY ::: ::: Live media streaming over peer-to-peer (P2P) network structures is commonplace nowadays. However, with the large number of users in a typical P2P system, it is impractical to use the central server to process the key information update requests of all the users Accordingly, the present study proposes a distributed key management scheme in which the server is only required to transmit the key update information to a limited number of users. To further reduce the load on the server, the update information is distributed using a hop-by-hop approach. An effective method is proposed for protecting the key update information as it is propagated through the network. In addition, a technique is presented for ensuring the security of the certificates used in the system It is shown that the distributed key management scheme and authentication procedure ensure an efficient and secure P2P live streaming performance even in the event of high churn rates. Copyright © 2012 John Wiley & Sons, Ltd. | eng_Latn | 24,058 |
Diameter Support for Proxy Mobile IPv6 Localized Routing | In Proxy Mobile IPv6, packets received from a Mobile Node (MN) by the ::: Mobile Access Gateway (MAG) to which it is attached are typically ::: tunneled to a Local Mobility Anchor (LMA) for routing. The term ::: "localized routing" refers to a method by which packets are routed ::: directly between an MN's MAG and the MAG of its Correspondent Node ::: (CN) without involving any LMA. In a Proxy Mobile IPv6 deployment, it ::: may be desirable to control the establishment of localized routing ::: sessions between two MAGs in a Proxy Mobile IPv6 domain by requiring ::: that the session be authorized. This document specifies how to ::: accomplish this using the Diameter protocol. | We propose a novel scheme based on uneven mapping to reduce the PAPR of OFDM signal and verify its availability by transmitting 10 × 20MHz LTE-A signal. The results show that this method could achieve 2% the EVM performance improvement. | eng_Latn | 24,059 |
Cost of thinning with a whole-tree chip harvesting system | A study of the cost of thinning with a whole-tree chip harvesting system consisting of a feller-buncher, two grapple skidders, and a 22-inch chipper indicated a capital outlay for equipment of over $500,000. Whole-tree chir-buncher, two grapple skidders, and a 22-inch chipper indicated a capital outlay for equipment of over $500,000. Whole-tree chips were produced at the landing at a base cost to the contractor of $12.25/green ton. Transportation of chips to plant site added $0.083/ton mile or about $3.7/green ton, yielding a total delivered cost of $15.42/green ton. This does not include costs for tree making, landing preparation, or stumpage, or for risk and management. At the current market price of $16.65/green ton, the operation would be required to run about 7 hours/day to reach the break-even point. 5 references. | In this paper pprivacy attacks to ad hoc routing protocols become an important issue as mobile ad hoc networks enter security critical domains. We modified Rids scheme for node location privacy in ANDOR protocol in mobile adhoc network. RIDS scheme also provide facility for the detection of wormhole attack and node misbehaviors in adhoc network. Different author proposed a different scheme for RIDS for providing security in mobile adhoc network. But all technique suffered common problem that problem is generation of node ID and protection of node ID in location based routing protocol. In this dissertation we modified the RIDS model for node id generation technique for identification of location of secured node. For these process we used cyclic shift technique for node ID generation. Here we discuss RIDS ANDOR and describe our proposed scheme. | eng_Latn | 24,060 |
Loss allocation and loss minimisation for radial distribution system including DGs | The rise in electrical power demand and corresponding transmission or distribution loss is affecting the efficiency of power delivery. A new method for loss allocation in radial distribution system based on proportional sharing is proposed. Based on allocated loss, optimal location of distribution generation (DG) is selected. After selecting the location, optimal size of DG is obtained for that location. Loss allocation to DGs is based on formation of two matrices, power contribution matrix and power sharing matrix. Loss share of DGs and loads are decided based on both power injection by DGs and loss minimisation due to presence of DGs. Results of the proposed method are shown on 69 bus radial distribution system. | In this paper pprivacy attacks to ad hoc routing protocols become an important issue as mobile ad hoc networks enter security critical domains. We modified Rids scheme for node location privacy in ANDOR protocol in mobile adhoc network. RIDS scheme also provide facility for the detection of wormhole attack and node misbehaviors in adhoc network. Different author proposed a different scheme for RIDS for providing security in mobile adhoc network. But all technique suffered common problem that problem is generation of node ID and protection of node ID in location based routing protocol. In this dissertation we modified the RIDS model for node id generation technique for identification of location of secured node. For these process we used cyclic shift technique for node ID generation. Here we discuss RIDS ANDOR and describe our proposed scheme. | eng_Latn | 24,061 |
To alleviate the amount of network traffic that comes from broadcasting all signals to all nodes , more advanced central nodes were developed that are able to keep track of the identities of the nodes that are connected to the network . | In order to alleviate the amount of network traffic that comes from broadcasting all signals to all nodes , more advanced central nodes were developed that are able to keep track of the identities of the nodes that are connected to the network . | It is responsible for collecting , analyzing and reporting intelligence on threats to Canada 's national security , and conducting operations , covert and overt , within Canada and abroad . | eng_Latn | 24,062 |
Some jurisdictions require that the association register with the police or other official body to inform the public of the association 's existence . | But in some jurisdictions , there is a minimum for the number of persons starting an association , in others the association must register with the police or other official body to inform the public of the association 's existence . | In order to alleviate the amount of network traffic that comes from broadcasting all signals to all nodes , more advanced central nodes were developed that are able to keep track of the identities of the nodes that are connected to the network . | eng_Latn | 24,063 |
Make a BGP Topology in Network | This document will give you an exact picture of how BGP topology is configured in networks. | Ever ran out of Mod Podge half-way through your project and need more? Luckily, it is easy to make your very own. This wikiHow will show you a few simple ways in which to make Mod Podge. | kor_Hang | 24,064 |
Find made in the middle and upper troposphere, the airy layer five to nine miles above the Earth's surface .
Team say bacteria could affect cloud formation - and even spread disease around the globe . | By . Mark Prigg . PUBLISHED: . 15:21 EST, 28 January 2013 . | . UPDATED: . 03:22 EST, 29 January 2013 . Bacteria get everywhere - even nine miles high among the clouds, a study has found. Scientists discovered 'significant' numbers of living bugs in the middle and upper troposphere, the airy layer five to nine miles above the Earth's surface. The microbes could have a previously unrecognised impact on cloud formation, according to the research. Georgia Tech graduate student Natasha DeLeon-Rodriguez shows an agar plate on which bacteria taken from tropospheric air samples are growing. Researchers say there are far more bacteria above the clouds than previously thought . Terry Lathem, a graduate student in Georgia Tech's School of Earth and Atmospheric Sciences, takes notes aboard a NASA DC-8 gathering samples of microorganisms in the atmosphere . Long distance travel by the airborne organisms may also help spread infections around the world. The bugs were discovered in air samples scooped up by a DC-8 aircraft flying over both land and sea across the US, Caribbean and western Atlantic. Samples were collected at altitudes of eight to 15 kilometres (five to nine miles) before and after two major tropical hurricanes in 2010. Scientists are still unsure whether the bacteria and fungi they found routinely inhabit the sky, living off carbon compounds, or are continually borne aloft by winds and air currents. Lead researcher Dr Kostas Konstantinidis, from the Georgia Institute of Technology in the US, said: 'We did not expect to find so many micro-organisms in the troposphere, which is considered a very difficult environment for life. 'There seems to be quite a diversity of species, but not all bacteria make it into the upper atmosphere.' DNA analysis revealed that bacteria made up 20% of particles previously thought to consist of nothing but sea salt or dust. The findings appear today in the journal Proceedings of the National Academy of Sciences. Marine bacteria were mostly found over the ocean, while their terrestrial cousins tended to occupy the air above land. Georgia Tech researchers study microorganisms gathered from air masses in the middle and upper troposphere. Shown are Natasha DeLeon-Rodriguez (seated), Kostas Konstantinidis, Athanasios Nenes, and Michael Bergin. There was strong evidence that hurricanes affected the distribution and dynamics of microbial populations. Around 17 different families of bacteria were detected. The bugs can help trigger cloud formation by supplying the particles around which ice crystals form. 'In the absence of dust or other materials that could provide a good nucleus for ice formation, just having a small number of these micro-organisms around could facilitate the formation of ice at these altitudes and attract surrounding moisture,' said co-author Professor Athanasios Nenes, also from the Georgia Institute of Technology. The scientists now want to look more closely at how the bugs survive so high above the ground. 'For these organisms, perhaps, the conditions may not be that harsh," said Dr Konstantinidis. 'I wouldn't be surprised if there is active life and growth in clouds, but this is something we cannot say for sure now.' | The FireChat app, pictured, uses Apple's iOS 7 Multipeer Connectivity Framework to turn create a network of phone users without using mobile signal . Buried within the settings of Apple’s iOS 7 is a feature that could revolutionise how we communicate. Called the Multipeer Connectivity Framework (MCF), it lets you send messages and photos even when a person has no signal. Now a group of developers has created a free iPhone app called FireChat that takes advantage of this feature - and it even works over long distances. The FireChat app was developed by the crowdsourced firm Open Garden. When a user opens the app, they can pick a screen name to start sending messages. Within the app there are 'chatrooms' with 'Everyone' and 'Nearby' options. The former will search for all users, while the latter option applies to people within Bluetooth and Wi-Fi range who are also using the app. This is particularly useful when on a plane, or the underground. It can also be used to save money on data plans, for example. Apple added MCF to its iOS 7 software last year. It creates what is called a wireless mesh network that connects phones to each other. In 'Nearby' mode, instead . of sending messages using a mobile or data signal, the feature lets . users send messages to people in close proximity that are in Bluetooth . or Wi-Fi Direct range - up to around 30 feet (9 metres). It does this by creating a localised network in which each phone becomes a node, and the data is passed between nodes. Apple . uses the framework for its AirDrop feature, for example, which makes it . easy to send files and data to other connected iPhone users. The FireChat app, pictured left, was developed by Open Garden. In the app there are 'chatrooms' including Everyone and Nearby. The former searches for all users, while the latter applies to people within Bluetooth and Wi-Fi range. It takes advantage of the same iOS 7 tool Apple uses for its AirDrop feature, pictured right . Apple added Multipeer Connectivity Framework (MCF) to its iOS 7 software . last year. It creates what’s called a wireless mesh network that . connects phones to each other. Instead . of sending messages using mobile or data signal, the features lets . users send messages to people in close proximity that are in Bluetooth . or Wi-Fi Direct range - up to around 30 feet (9 metres). It does this by creating a localised network in which each phone becomes a node and the data is passed between nodes. Apple . uses the framework for its AirDrop feature, for example, which makes it easy to . send files and data to other connected iPhone users. These messages are sent securely, so the individual nodes can’t read them. Users can also send messages anonymously to avoid snooping, for example, because data is sent from app usernames, as opposed to mobile numbers. Elsewhere, because the feature doesn’t use an internet connection, it can’t be infiltrated by hackers. The 'Everyone' Setting allows people to send information further however. It does this by bringing all its nodes . onto one network and relaying messages from one node to another until . it reaches the final recipient. It is not known whether there is a . maximum distance the app will work within, and in theory it will work wherever there are nodes, but MailOnline has . contacted the company to find out more. The distance a message can be sent is probably dependent on whether a given region has the nodes needed to relay the messages. Nodes . are simply a vehicle for passing data along a network. On a traditional . internet network any device that’s connected to the network is also . called a node. For example, if a network has a phone, tablet, two computers and a printer connected to it there are five nodes on the network. Each . of these devices have a network address which is used to uniquely . identify each one. This helps keep track of where data is being . transferred to and from on the network. There is an Android version of the mesh networking feature, developed by Open Garden, but it is not a chat app and is instead used for file sharing. | eng_Latn | 24,065 |
Why does Facebook Messenger use long polling over WebSockets? | Does Facebook messenger use long polling or websockets? | How IEEE 802.11n is used in IEEE 802.11s wireless mesh network? | eng_Latn | 24,066 |
How can an NPC communicate with the party over long distances? | How can we communicate short messages long-distance? | Nearby objects won't move independently? | eng_Latn | 24,067 |
what is multicast routing | Multicast Routing Protocol. A multicast routing protocol is one type of service provider that functions as a client within the framework of the router architecture. The routing architecture is designed to be extended by such router client modules. multicast routing protocol manages group membership and controls the path that multicast data takes over the network. Examples of multicast routing protocols include: Protocol Independent Multicast (PIM), Multicast Open Shortest Path First (MOSPF), and Distance Vector Multicast Routing Protocol (DVMRP). | This chapter describes how to configure IP multicast routing. For a complete description of the IP multicast routing commands in this chapter, refer to the IP Multicast Routing Commands chapter of the Cisco IOS IP Command Reference, Volume 3 of 3: Multicast.o start implementing IP multicast routing in your campus network, you must first define who receives the multicast. IGMP provides a means to automatically control and limit the flow of multicast traffic throughout your network with the use of special multicast queriers and hosts. | eng_Latn | 24,068 |
Message ferry route design for sparse ad hoc networks with mobile nodes | intelligent fluid infrastructure for embedded networking . | The impact of goal achievement orientation on student technology usage in the classroom | eng_Latn | 24,069 |
OpenFlow for Wireless Mesh Networks | Interference-Aware Channel Assignment in Multi-Radio Wireless Mesh Networks | Addressing challenges in promoting healthy lifestyles: the al-chatbot approach | eng_Latn | 24,070 |
C ONTINUOUS A DAPTATION VIA M ETAL EARNING IN N ONSTATIONARY AND C OMPETITIVE E NVIRONMENTS | An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination | Enabling Technologies for Smart City Services and Applications | yue_Hant | 24,071 |
Automotive V2X on phones: Enabling next-generation mobile ITS apps | Airblue: a system for cross-layer wireless protocol development | SAM: enabling practical spatial multiple access in wireless LAN | eng_Latn | 24,072 |
On Exploiting Transient Social Contact Patterns for Data Forwarding in Delay-Tolerant Networks | Analysis of weighted networks | network routing - algorithms , protocols , and architectures . | eng_Latn | 24,073 |
A multilayer IP security protocol for TCP performance enhancement in wireless networks | Transport Protocols for Internet-Compatible Satellite Networks | TCP and explicit congestion notification | eng_Latn | 24,074 |
Classification and comparison of routing protocols in VANETs | Geographic routing in city scenarios | Vortex twins and anti-twins supported by multiring gain landscapes. | eng_Latn | 24,075 |
Modified Ant-AODV-VANET routing protocol for Vehicular Adhoc Network | IEEE 802.11ax: Next generation wireless local area networks | Spark: A Big Data Processing Platform Based on Memory Computing | eng_Latn | 24,076 |
Internet of underwater things: Challenges and routing protocols | Optimized link state routing protocol for ad hoc networks | The New Routing Algorithm for the ARPANET | eng_Latn | 24,077 |
Cloud-assisted channel selection for wireless mesh networks | A Self-Managed Distributed Channel Selection Algorithm for WLANs | DNA Methylation Analysis by Pyrosequencing | eng_Latn | 24,078 |
An efficient parallel solver for SDD linear systems | Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs | EPPN: Extended Prime Product Number based wormhole DETECTION scheme for MANETs | eng_Latn | 24,079 |
Bandwidth-Efficient Multipath Transport Protocol for Quality-Guaranteed Real-Time Video Over Heterogeneous Wireless Networks | Distributed scheduling scheme for video streaming over multi-channel multi-radio multi-hop wireless networks | A-Fast-RCNN: Hard Positive Generation via Adversary for Object Detection | eng_Latn | 24,080 |
AMPF: Application-aware Multipath Packet Forwarding using Machine Learning and SDN | Finding the K Shortest Loopless Paths in a Network | Situationally Aware In-Car Information Presentation Using Incremental Speech Generation: Safer, and More Effective | eng_Latn | 24,081 |
Routing protocol of low-power and lossy network: Survey and open issues | Routing in multi-radio, multi-hop wireless mesh networks | Simulation Analysis of SVPWM Inverter Fed Induction Motor Drives | eng_Latn | 24,082 |
Routing protocols in Vehicular Delay Tolerant Networks: A comprehensive survey | A routing strategy for vehicular ad hoc networks in city environments | Hybrid Partitioned SRAM-Based Ternary Content Addressable Memory | eng_Latn | 24,083 |
All your network are belong to us: a transport framework for mobile network selection | CoolSpots: reducing the power consumption of wireless mobile devices with multiple radio interfaces | A measurement study of available bandwidth estimation tools | eng_Latn | 24,084 |
Improving Security and Performance Parameter using Social Skeleton in heterogeneous VDTN | Friendship Based Routing in Delay Tolerant Mobile Social Networks | Lung cancer combination therapy: co-delivery of paclitaxel and doxorubicin by nanostructured lipid carriers for synergistic effect | eng_Latn | 24,085 |
High-dimensional sequence transduction | Random search for hyper-parameter optimization | Comparative Study of AODV, DSDV and DSR Routing Protocols in MANET Using Network Simulator-2 | eng_Latn | 24,086 |
A two-way time of flight ranging scheme for wireless sensor networks | The flooding time synchronization protocol | A smart QoS- based traffic management for WBANs | eng_Latn | 24,087 |
A new test set compression scheme for circular scan | Test-cost optimization in a scan-compression architecture using support-vector regression | Robustness of the routing protocol for low-power and lossy networks (RPL) in smart grid's neighbor-area networks | eng_Latn | 24,088 |
Multicast routing protocols in wireless mesh networks: a survey | The capacity of wireless networks | Rewarding creativity: when does it really matter? | eng_Latn | 24,089 |
Light Weight VANET using Multi-Hop Cluster Based WAVE and LTE | A New Aggregate Local Mobility (ALM) Clustering Algorithm for VANETs | A mobility based metric for clustering in mobile ad hoc networks | eng_Latn | 24,090 |
A Survey on Bio-inspired Networking | Wireless mesh networks: a survey | An Improved Definition of Blossoms and a Simpler Proof of the MV Matching Algorithm | eng_Latn | 24,091 |
Ranking with multiple hyperplanes | Rank aggregation methods for the Web | Flexible SDN control in tactical ad hoc networks | eng_Latn | 24,092 |
Aspen: a domain specific language for performance modeling | A framework for performance modeling and prediction | IEEE 802.11aa: Improvements on video transmission over wireless LANs | eng_Latn | 24,093 |
An On-Demand Rate-Adaptation Mechanism For IEEE 802.11 Networks | Cabernet: vehicular content delivery using WiFi | adaptive frame length control for improving wireless link throughput , range and energy efficiency . | yue_Hant | 24,094 |
Mesh networks: commodity multihop ad hoc networks | Routing in multi-radio, multi-hop wireless mesh networks | Agent-based computing from multi-agent systems to agent-based Models: a visual survey | eng_Latn | 24,095 |
Link Cost and Reliability of Frame Preamble MAC Protocols | Versatile low power media access for wireless sensor networks | Server-Side Bot Detection in Massively Multiplayer Online Games | eng_Latn | 24,096 |
Vehicular Communications for 5G Cooperative Small-Cell Networks | on the computation offloading at ad hoc cloudlet : architecture and service modes . | Frequency Analysis of Temporal Graph Signals | eng_Latn | 24,097 |
A brief survey of blackhole detection and avoidance for ZRP protocol in MANETs | A survey of black hole attacks in wireless mobile ad hoc networks | Optimized link state routing protocol for ad hoc networks | eng_Latn | 24,098 |
Prefetching-Based Data Dissemination in Vehicular Cloud Systems | Base Station Operation and User Association Mechanisms for Energy-Delay Tradeoffs in Green Cellular Networks | An energy-efficient SDN based sleep scheduling algorithm for WSNs | kor_Hang | 24,099 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.