Randomized range-maxima in nearly-constant parallel time

Given an array ofn input numbers, therange-maxima problem is that of preprocessing the data so that queries of the type what is the maximum value in subarray [i..j] can be answered quickly using one processor. We present a randomized preprocessing algorithm that runs inO(log^* n) time with high probability, using an optimal number of processors on a CRCW PRAM; each query can be processed in constant time by one processor. We also present a randomized algorithm for a parallel comparison model. Using an optimal number of processors, the preprocessing algorithm runs inO( (n)) time with high probability; each query can be processed inO ( (n)) time by one processor. (As is standard, (n) is the inverse of Ackermann function.) A constant time query can be achieved by some slowdown in the performance of the preprocessing stage.     

Inconsistent heuristics in theory and practice

In the field of heuristic search it is usually assumed that admissible heuristics are consistent, implying that consistency is a desirable attribute. The term “inconsistent heuristic” has, at times, been portrayed negatively, as something to be avoided. Part of this is historical: early research discovered that inconsistency can lead to poor performance for A^? (nodes might be re-expanded many times). However, the issue has never been fully investigated, and was not re-considered after the invention of IDA^?.This paper shows that many of the preconceived notions about inconsistent heuristics are outdated. The worst-case exponential time of inconsistent heuristics is shown to only occur on contrived graphs with edge weights that are exponential in the size of the graph. Furthermore, the paper shows that rather than being something to be avoided, inconsistent heuristics often add a diversity of heuristic values into a search which can lead to a reduction in the number of node expansions. Inconsistent heuristics are easy to create, contrary to the common perception in the AI literature. To demonstrate this, a number of methods for achieving effective inconsistent heuristics are presented.Pathmax is a way of propagating inconsistent heuristic values in the search from parent to children. This technique is generalized into bidirectional pathmax (BPMX) which propagates values from a parent to a child node, and vice versa. BPMX can be integrated into IDA^? and A^?. When inconsistent heuristics are used with BPMX, experimental results show a large reduction in the search effort required by IDA^?. Positive results are also presented for A^? searches.     

Deterministic Resource Discovery in Distributed Networks

The resource discovery problem was introduced by Harchol-Balter, Leighton, and Lewin. They developed a number of algorithms for the problem in the weakly connected directed graph model. This model is a directed logical graph that represents the vertices’ knowledge about the topology of the underlying communication network. The current paper proposes a deterministic algorithm for the problem in the same model, with improved time, message, and communication complexities. Each previous algorithm had a complexity that was higher at least in one of the measures. Specifically, previous deterministic solutions required either time linear in the diameter of the initial network, or communication complexity $O(n^3)$ (with message complexity $O(n^2)$), or message complexity $O(|E_0| \log n)$ (where $E_0$ is the arc set of the initial graph $G_0$). Compared with the main randomized algorithm of Harchol-Balter, Leighton, and Lewin, the time complexity is reduced from $O(\log^2n)$ to\pagebreak[4] $O(\log n )$, the message complexity from $O(n \log^2 n)$ to $O(n \log n )$, and the communication complexity from $O(n^2 \log^3 n)$ to $O(|E_0|\log ^2 n )$. \par Our work significantly extends the connectivity algorithm of Shiloach and Vishkin which was originally given for a parallel model of computation. Our result also confirms a conjecture of Harchol-Balter, Leighton, and Lewin, and addresses an open question due to Lipton.     

An Ultra-Low Dose of ∆9-Tetrahydrocannabinol Alleviates Alzheimer’s Disease-Related Cognitive Impairments and Modulates TrkB Receptor Expression in a 5XFAD Mouse Model

Alzheimer’s disease (AD) is the most common form of dementia, but there is still no available treatment. Δ9-tetrahydrocannabinol (THC) is emerging as a promising therapeutic agent. Using THC in conventional high doses may have deleterious effects. Therefore, we propose to use an ultra-low dose of THC (ULD-THC). We previously published that a single injection of ULD-THC ameliorated cognitive functioning in several models of brain injuries as well as in naturally aging mice. Here, 5xFAD AD model mice received a single treatment of ULD-THC (0.002 mg/kg) after disease onset and were examined in two separate experiments for cognitive functions, neurotropic, and inflammatory factors in the hippocampus. We show that a single injection of ULD-THC alleviated cognitive impairments in 6- and 12-month-old 5xFAD mice. On the biochemical level, our results indicate an imbalance between the truncated TrkB receptor isoform and the full receptor, with AD mice showing a greater tendency to express the truncated receptor, and ULD-THC improved this imbalance. We also investigated the expression of three AD-related inflammatory markers and found an ameliorating effect of ULD-THC. The current research demonstrates for the first time the beneficial effects of a single ultra-low dose of THC in a mouse model of AD after disease onset.     

Ring-type plasmon resonance in metallic nanoshells

A simple, approximate theoretical model of surface plasmon resonance in two-dimensional metal nanoshells is developed. The model is based on the concept of short-range surface plasmons propagating around closed circular metal nanotubes. In this model, the plasmon resonance in a metal nanotube is treated as a propagating, self-interfering plasmonic wave, in a ring-type resonance, at plasmonic wavelengths matching an integer fraction of the nanotube's effective circumference. The model is validated by detailed computer simulations based on the finite-difference time-domain method and is shown to be in full agreement with the widely used plasmon hybridization model, which is based on the quasi-static approximation.     

Evolution of social learning when high expected payoffs are associated with high risk of failure

In an environment where the availability of resources sought by a forager varies greatly, individual foraging is likely to be associated with a high risk of failure. Foragers that learn where the best sources of food are located are likely to develop risk aversion, causing them to avoid the patches that are in fact the best; the result is sub-optimal behaviour. Yet, foragers living in a group may not only learn by themselves, but also by observing others. Using evolutionary agent-based computer simulations of a social foraging game, we show that in an environment where the most productive resources occur with the lowest probability, socially acquired information is strongly favoured over individual experience. While social learning is usually regarded as beneficial because it filters out maladaptive behaviours, the advantage of social learning in a risky environment stems from the fact that it allows risk aversion to be circumvented and the best food source to be revisited despite repeated failures. Our results demonstrate that the consequences of individual risk aversion may be better understood within a social context and suggest one possible explanation for the strong preference for social information over individual experience often observed in both humans and animals.     

Cycle time distribution in circulating systems

The cycle time distribution (CTD) within closed, continuously circulating systems is defined and related to the residence time distributions of flow regions which make up such systems. Examples of the application of the CTD are noted and experimental methods for determining CTDs for various systems are summarized.     

Isolation and characterization of the high-density lipoproteins from the hemolymph and ovary of the penaeid shrimp Penaeus semisulcatus (de Haan): apoproteins and lipids

The high-density lipoproteins (HDLs) found in the male and female hemolymph of Penaeus semisulcatus de Haan were isolated by NaBr (1.22 g/ml) followed by sucrose gradient (5-25%) ultracentrifugation. The male HDL contained one protein, lipoprotein 1 (LP1), composed of one 110-kDa peptide subunit. The female HDL contained two proteins: 1) the LP1 that was immunoidentical to the male LP1 and was similarly composed of one 110-kDa peptide subunit and 2) vitellogenin (Vg), reacting positively with the rabbit antiserum generated against vitellin (Vt) that was isolated from vitellogenic ovaries. Both Vg and Vt consisted mainly of three polypeptide subunits (200, 120, and 80 kDa) as revealed by denatured PAGE and Western blot. The LP1 from males or females did not react with the Vt rabbit antiserum. Similarly, Vg and Vt did not react with the rabbit antiserum prepared against LP1. Phospholipids (PL) constituted 71-76% of the total lipids in the hemolymph and HDLs of both male and female hemolymph. Cholesterol (Ch) amounted to 17-20%, and small amounts (5%) of diacylglycerols (DAG) were also carried by these HDLs. Both the PL and DAG contained highly unsaturated fatty acids (20:5 omega 3 and 22:6 omega 3) that are transported from the food or hepatopancreas to the tissues, including the vitellogenic ovaries in females. In the present study we show for the first time the separate lipid composition of female LP1 and Vg and compare them with the lipids attached to the Vt. Vg had a lower lipid content than LP1 (540 and 1089 mg/g protein, respectively). Differences were also found in the relative abundance of PL, Ch, and DAG classes in the LP1 in comparison with Vg. Furthermore, small amounts (approximately 3.8%) of triacylglycerols (TAG) were found only in the hemolymph of vitellogenic females, and they were associated with the Vg. Although Vg and Vt were composed of similar polypeptides, their lipid composition was different Vt, in contrast to Vg, carried considerable amounts of TAG (approximately 22%) and only trace amounts of DAG. The significance of the TAG in the hemolymph of vitellogenic females is not known, and the functional relationship between Vg and Vt requires future extensive studies. Lipids were not detected in hemocyanin that was purified from clotted hemolymph.     

The limiting residence time distribution of continuous recycle systems

The limiting residence time distribution (RTD) of continuous recycle systems as the recycle ratio approaches infinity is considered. It is shown that the RTD converges to the exponential distribution whenever the system does not consist of a “dead volume” at the limit. This limiting behavior is independent of the system configuration and flow patterns. Issues concerning the proper modeling approach and the mathematical formulation of the condition that the system has no “dead volume” are discussed in detail. Some examples illustrating the importance of selecting the proper modeling approach are also provided.