Dynamic Distribution-Sensitive Point Location

We propose a dynamic data structure for the distribution-sensitive point location problem in the plane. Suppose that there is a fixed query distribution within a convex subdivision S , and we are given an oracle that can return in O (1) time the probability of a query point falling into a polygonal region of constant complexity. We can maintain S such that each query is answered in O opt (S) ) expected time, where opt ( S ) is the expected time of the best linear decision tree for answering point location queries in S . The space and construction time are O(n log 2 n ), where n is the number of vertices of S . An update of S as a mixed sequence of k edge insertions and deletions takes O(k log 4 n) amortized time. As a corollary, the randomized incremental construction of the Voronoi diagram of n sites can be performed in O(n log 4 n ) expected time so that, during the incremental construction, a nearest neighbor query at any time can be answered optimally with respect to the intermediate Voronoi diagram at that time.

Expectation violations produce error signals in mouse V1

Repeated exposure to visual sequences changes the form of evoked activity in the primary visual cortex (V1). Predictive coding theory provides a potential explanation for this, namely that plasticity shapes cortical circuits to encode spatiotemporal predictions and that subsequent responses are modulated by the degree to which actual inputs match these expectations. Here we use a recently developed statistical modeling technique called Model-Based Targeted Dimensionality Reduction (MbTDR) to study visually-evoked dynamics in mouse V1 in context of a previously described experimental paradigm called "sequence learning". We report that evoked spiking activity changed significantly with training, in a manner generally consistent with the predictive coding framework. Neural responses to expected stimuli were suppressed in a late window (100-150ms) after stimulus onset following training, while responses to novel stimuli were not. Omitting predictable stimuli led to increased firing at the expected time of stimulus onset, but only in trained mice. Substituting a novel stimulus for a familiar one led to changes in firing that persisted for at least 300ms. In addition, we show that spiking data can be used to accurately decode time within the sequence. Our findings are consistent with the idea that plasticity in early visual circuits is involved in coding spatiotemporal information.

Two clinical cases of unintentionally prolonged sciatic nerve block

This study describes two clinical cases of unexpectedly long duration of motor block after anterior sciatic nerve block. In two patients who underwent total knee replacement, the motor block reversion in the area of sciatic nerve innervation did not occur at the expected time. Ultrasound examination revealed the deposition of a local anesthetic near the sciatic nerve. In these two clinical cases, unintentionally prolonged sciatic nerve blockade was caused by combined age-related factors of reduced tissue perfusion and the vasoconstrictor properties of levobupivacaine. Subsequently, the block was successfully resolved in 3638 h without any neurological consequences.

Cross-Border Internet of Things E-Commerce Warehouse Control System Based on TRIZ Theory

Cross-border e-commerce of the Internet of Things is affected by international situations and political factors. Supply chain interruption and returns will cause violent fluctuations in commodity inventory, making the inventory control of cross-border e-commerce very difficult. The TRIZ principle is utilized to solve the problem of the difficulty to evaluate the suppliers comprehensively in e-commerce warehouse management. The Markov algorithm is used to describe the change of inventory level. The cyclic expected time and cost function are constructed by the horizontal crossing method, updating the process and Martingale theory. The effect of the correlation between the demand and supply interruption on the optimal inventory control strategy is studied by simulation. The change of the optimal control strategy under the different interrupt and return types is analyzed, and the validity of the management system is verified.

Beta Distribution for Estimating Risk Associated Time Schedule of Hydropower Projects in Nepal

Background: Risk is associated with every kind of project work whether it is related to engineering construction project, software development project, financial transaction process or business process. There isn't any project which is free of risks. It is inherent in all types of projects. Observing risk associated with a project can help in successful completion of projects in expected time and expected cost with good assurance of quality. This article is concerned with quantitative analysis of risks coined with hydropower construction project in Nepal. Objective: The main objective of this paper is (a) to identify different activities involved in hydropower construction projects (b) to estimate risk associated time schedule of the identified project activities. Materials and Methods: Data required for the fulfillment of the objective are obtained by interview and discussion with executives of “Shiva Shree Hydropower Limited” and by using project schedule charts of projects won by the company. In this article quantitative analysis of schedule risk of hydropower project is studied by simulation method. Results: Different activities involved in hydropower construction project are identified. Also, risk associated with time schedule of project are observed quantitatively by simulation using beta-PERT distribution. Conclusion: Estimation of time schedule associated with project activities is more realistic when it is analyzed by using beta-PERT distribution compared to other statistical distributions.

Brain Cellular Senescence in Mouse Models of Alzheimer's Disease

The accumulation of senescent cells contributes to aging pathologies, including neurodegenerative diseases, and its selective removal improves physiological and cognitive function in wild type mice as well as in Alzheimer’s disease (AD) models. AD models recapitulate some, but not all components of disease and do so at different rates. Whether brain cellular senescence is recapitulated in some or all AD models, and whether the emergence of cellular senescence in AD mouse models occurs before or after the expected onset of AD-like cognitive deficits in these models is not yet known. The goal of this study was to identify mouse models of AD and AD-related dementias that develop measurable markers of cellular senescence in brain and thus may be useful to study the role of cellular senescence in these conditions. We measured levels of cellular senescence markers in brains of P301S(PS19), P301L, hTau, and 3xTg-AD mice that model amyloidopathy and/or tauopathy in AD and related dementias, and in wild type, age-matched control mice for each strain. Expression of cellular senescence markers in brains of transgenic P301L and 3xTg-AD mice was largely indistinguishable from that in WT control age-matched mice. In contrast, markers of cellular senescence were significantly increased in brains of transgenic P301S and hTau mice as compared to WT control mice at the expected time of onset of AD-like cognitive deficits. Taken together, our data suggest that P301S(PS19) and hTau mice may be useful for the study of brain cellular senescence in tauopathies including, but not limited to, AD.

Diffusion approximations in population genetics and the rate of Muller's ratchet

Diffusion theory is a central tool of modern population genetics, yielding simple expressions for fixation probabilities and other quantities that are not easily derived from the underlying Wright-Fisher model. Unfortunately, the textbook derivation of diffusion equations as scaling limits requires evolutionary parameters (selection coefficients, mutation rates) to scale like the inverse population size---a severe restriction that does not always reflect biological reality. Here we note that the Wright-Fisher model can be approximated by diffusion equations under more general conditions, including in regimes where selection and/or mutation are strong compared to genetic drift. As an illustration, we use a diffusion approximation of the Wright-Fisher model to improve estimates for the expected time to fixation of a strongly deleterious allele, i.e. the rate of Muller's ratchet.

Dealing with Dry Waste Disposal Issues Associated with 177mLu Impurities: A Long-Term Challenge for Nuclear Medicine Departments

Purpose: A strategy for management of radioactive waste associated with 177 Lu-dotatate (Lutathera ® ) treatments was established in our institution based on predicted storage times of 3 to 5 years extrapolated from the results of a 2-year measurement study. The aim of this work was to validate the model used by identifying contaminants and confirming disposal based on the clearance level twice-the-background was within expected time frames. Methods: We conducted a prospective series of measurements of radioactive waste associated with the first 65 treatments administered. Sequential measurements of the first 45 vials used were performed on a dose calibrator to identify contaminants. Exposure rates in contact were monitored with a dose ratemeter on a 6-monthly basis for all types of waste stored: 46 empty vials, 19 vials partially used and 67 biohazard containers. Results: Initial median activity of the first vials used was 118 MBq (4 - 4188 MBq). For each vial, the decay curve of activity obtained was adjusted to a bi-exponential model. The major component, representing 99.7 % of activity, has a half-life of 6.5 ± 0.2 days, corresponding to 177 Lu. The second, representing only 0.3 % of the activity and having a half-life of 156 ± 24 days corresponding to 177m Lu, determines necessary storage times. Partially used vials can be disposed of after 5 years, other waste after 3 years. Compliance with the regulatory clearance level is achieved within expected time frames. Conclusion: Although only present as traces, 177m Lu results in major radioactive waste disposal issues for hospitals. Availability of radiopharmaceuticals without impurities appears to be crucial for an expanding use of targeted radionuclide therapy.

Efficient Multiuser Computation for Mobile-Edge Computing in IoT Application Using Optimization Algorithm

Mobile edge computing (MEC) is a paradigm novel computing that promises the dramatic effect of reduction in latency and consumption of energy by computation offloading intensive; these tasks to the edge clouds in proximity close to the smart mobile users. In this research, reduce the offloading and latency between the edge computing and multiusers under the environment IoT application in 5G using bald eagle search optimization algorithm. The deep learning approach may consume high computational complexity and more time. In an edge computing system, devices can offload their computation-intensive tasks to the edge servers to save energy and shorten their latency. The bald eagle algorithm (BES) is the advanced optimization algorithm that resembles the strategy of eagle hunting. The strategies are select, search, and swooping stages. Previously, the BES algorithm is used to consume the energy and distance; to improve the better energy and reduce the offloading latency in this research and some delays occur when devices increase causes demand for cloud data, it can be improved by offering ROS (resource) estimation. To enhance the BES algorithm that introduces the ROS estimation stage to select the better ROSs, an edge system, which offloads the most appropriate IoT subtasks to edge servers then the expected time of execution, got minimized. Based on multiuser offloading, we proposed a bald eagle search optimization algorithm that can effectively reduce the end-end time to get fast and near-optimal IoT devices. The latency is reduced from the cloud to the local; this can be overcome by using edge computing, and deep learning expects faster and better results from the network. This can be proposed by BES algorithm technique that is better than other conventional methods that are compared on results to minimize the offloading latency. Then, the simulation is done to show the efficiency and stability by reducing the offloading latency.