Ahstrort-We introduce an ad hoc wireless mobile network that employs a hierarchical networking architecture. The network uses high capacity and IOU, capacity nodes. We present a topological synthesis algorithm that selects a subset of high capacity nodes to fomi a backbone nehvork. The latter consists of interconnected backbone nodes that intercommunicate across high power links, and also makes use of (airhome, ground and underwater) Uiimanned Vehicles (UVs). Each backbone node manages the allocation of communications resources for transport of messages frondto itself and among nodes that reside in its managed cluster of nodes (access net). Backhone nodes also interact to coordinate the allocation of MAC layer communications s e t s (such a? time slots) in their access nets to prevent (cross net) interferences. When covered by a backbone node, a mobile node is granted a proper set of time slots (or, equivalently, YDMA andior COMA slots) for direct communications to a local destination, or for accessing the dynamically contigured hackhone netvvork Cor long-range communications. When uncovered, a node uses a flat multi-hop ad hoc networking scheme. We introduce the TBONE protocol to implement the key networking schemes for such a Mobile Backbone Network (MBN). It includes combined network layer operation, i.e. mobile backbone network topological synthesis, and MAC layer resource allocation schemes. The TBONE protocol serves lo allocate resources across the network to ensure that user applications are granted acceptable quality-of-service (QoS) performance, while striving to ensure a highly ,survivable and robust backhoneoriented networking architecture. We present elements ofthe protocol and key involved algorithms, and illustrate the distinctive advantages offered by the TBONE based mobile backbone nehvork.Key event class 4 (RN covering)-If an unassociated RN hears at least a single node that is identilied as a BN or an associated BCN, it initiates the Anet association algorithm. The occurrence of any key event in this class indicates that an unassociated RN may associate with a BN.Key event class 5 (BCN covering). If an unassociated BCN hears at least a single node that is identified as a BN, it initiates the Anet association algorithm. The occurrence of any key event in this class indicates that an unassociated BCN may associate with a BN.Key event class 6 (BCN covering)-If an unassociated BCN utilizing its low power radio module cannot hear any BN for a predefined period of time. but receives information from at least one unassociated BCN, it initiates the UN election algorithm. The occurrence of any key event in this class indicates that by selecting a BCN among a certain set of nodes and converting it into a BN, a necessary condition for associating an unassociated BCN to a BN is provided. Key event class 7 (BCN covering)-If an unassociated BCN only hears KNs and/or associated BCNs or it cannot hear any node for a predefined period of time, it initiates the BN election algorithm. Note that this is a "degenera...

No abstract

Objective: To observe the effect of electroacupuncture on the morphological change of the bladder tissue and the protein expression levels of NGF, TrkA, p-TrkA, AKT, and p-AKT in the bladder tissue of rats with neurogenic bladder after suprasacral spinal cord injury and to preliminarily explore its partial mechanism of action. Methods: Eighty female Sprague-Dawley rats were randomly divided into blank group, model group, electroacupuncture group, model/siNGF group, and electroacupuncture/siNGF group according to random number table method with 16 rats in each group. Eighty Neurogenic bladder models after suprasacral spinal cord injury were established by adopting a modified spinal cord transection method. Electroacupuncture intervention was conducted on the 19th day after modeling. The bladder function was detected by bladder weight, urine output, serum BUN, and urine protein. After treatment for 7 consecutive days, the rats were killed and the bladder tissues were removed rapidly for microscopic observation of morphological change after hematoxylin and eosin stain and for determination of the protein expression levels of NGF, TrkA, p-TrkA, AKT, and p-AKT via Western blot analysis. The transcription of NGF was measured by reverse-transcription polymerase chain reaction. Results: After treatment, compared with the blank group, the bladder weight of model and electroacupuncture groups were significantly increased (P < 0.05). Compared with the model group, the bladder weight of the electroacupuncture group was decreased (P > 0.05). Compared with the blank group, the urine output of the model group was increased (P < 0.05). Compared with the blank group, the urine output of the electroacupuncture group was increased (P > 0.05). Compared with the blank group, the serum BUN of the model group was increased (P < 0.05). Compared with the blank group, the serum BUN of the electroacupuncture group was increased (P > 0.05). Compared with the blank group, the urine protein of the model group was increased (P < 0.05). Compared with the blank group, the urine protein of the electroacupuncture group was increased (P > 0.05). The expression of NGF, p-TrkA, and p-AKT in the model and electroacupuncture groups was obviously higher than that in the J Cell Biochem. 2019;120:9900-9905. wileyonlinelibrary.com/journal/jcb How to cite this article: Zhang T, Yu J, Huang Z, Wang G, Zhang R. Electroacupuncture improves neurogenic bladder dysfunction through activation of NGF/TrkA signaling in a rat model. J Cell Biochem. 2019;120:9900-9905.

No abstract

SUMMARYA regional central manager is employed to set aside, for the regional (or back-bone) network that it manages, for each fl ow class, communications capacity resources for a specifi c future time horizon. In the context of such a traffi c management operation, a longer temporal scale is involved in controlling the admission and distribution of fl ows across the network. For management scal-ability purposes, fl ows are aggregated into fl ow classes. Furthermore, we consider a network operation under which multiple simultaneously activated routes are employed, across possibly distinct segments, to distribute traffi c between identifi ed source-destination pairs. We aim to ensure that the utility assigned to each class is as high as feasibly possible while striving to raise the utility gained by all classes in a maxmin fair manner. In doing so, we incorporate the communications capacity constraints that are imposed by the underlying hybrid of directional and/or multiple-access wireline and wireless communications media employed across the network system. We develop and present in this paper an optimal algorithm for solving such a traffi c management problem. It yields multi-utility-based max-min fair distributions of fl ow rates, per each class, across the specifi ed multitude of simultaneously activated multi-segment routes. To guarantee that admitted fl ows are granted their desired capacity resources (and targeted corresponding utility levels), the selection of optimal fl ow distributions across the network routes is combined with the use of a fl ow admission control scheme that serves to optimally limit the aggregate rate of fl ows admitted for each fl ow class. As illustrative examples, we demonstrate the effectiveness of our solution in comparing its performance with that obtained under the use of a traffi c regulation scheme that is not overlaid with a traffi c management mechanism that serves to set aside resources for the support of fl ow classes. We also illustrate the use of our optimal algorithm for determining the optimal placement of unmanned aerial vehicle platforms that serve to supplement a terrestrial transport segment with a space-based one.