Revisiting the Dexamethasone Suppression Test in unipolar major depression: an exploratory study

This is an Open Access article distributed under the terms of the Creative Commons Attribution Licens

Treatment of psychotic symptoms in bipolar disorder with aripiprazole monotherapy: A meta-analysis

Background: We present a systematic review and meta-analysis of the available clinical trials concerning the usefulness of aripiprazole in the treatment of the psychotic symptoms in bipolar disorder.Methods: A systematic MEDLINE and repository search concerning clinical trials for aripiprazole in bipolar disorder was conducted.Results: The meta-analysis of four randomised controlled trials (RCTs) on acute mania suggests that the effect size of aripiprazole versus placebo was equal to 0.14 but a more reliable and accurate estimation is 0.18 for the total Positive and Negative Syndrome Scale (PANSS) score. The effect was higher for the PANSS-positive subscale (0.28), PANSS-hostility subscale (0.24) and PANSS-cognitive subscale (0.20), and lower for the PANSS-negative subscale (0.12). No data on the depressive phase of bipolar illness exist, while there are some data in favour of aripiprazole concerning the maintenance phase, where at week 26 all except the total PANSS score showed a significant superiority of aripiprazole over placebo (d = 0.28 for positive, d = 0.38 for the cognitive and d = 0.71 for the hostility subscales) and at week 100 the results were similar (d = 0.42, 0.63 and 0.48, respectively).Conclusion: The data analysed for the current study support the usefulness of aripiprazole against psychotic symptoms during the acute manic and maintenance phases of bipolar illness. © 2009 Fountoulakis et al; licensee BioMed Central Ltd

The Power of Two Choices in Distributed Voting

Distributed voting is a fundamental topic in distributed computing. In pull voting, in each step every vertex chooses a neighbour uniformly at random, and adopts its opinion. The voting is completed when all vertices hold the same opinion. On many graph classes including regular graphs, pull voting requires $\Theta(n)$ expected steps to complete, even if initially there are only two distinct opinions. In this paper we consider a related process which we call two-sample voting: every vertex chooses two random neighbours in each step. If the opinions of these neighbours coincide, then the vertex revises its opinion according to the chosen sample. Otherwise, it keeps its own opinion. We consider the performance of this process in the case where two different opinions reside on vertices of some (arbitrary) sets $A$ and $B$, respectively. Here, $|A| + |B| = n$ is the number of vertices of the graph. We show that there is a constant $K$ such that if the initial imbalance between the two opinions is ?$\nu_0 = (|A| - |B|)/n \geq K \sqrt{(1/d) + (d/n)}$, then with high probability two sample voting completes in a random $d$ regular graph in $O(\log n)$ steps and the initial majority opinion wins. We also show the same performance for any regular graph, if $\nu_0 \geq K \lambda_2$ where $\lambda_2$ is the second largest eigenvalue of the transition matrix. In the graphs we consider, standard pull voting requires $\Omega(n)$ steps, and the minority can still win with probability $|B|/n$.Comment: 22 page

Fast Scalable Construction of (Minimal Perfect Hash) Functions

Recent advances in random linear systems on finite fields have paved the way for the construction of constant-time data structures representing static functions and minimal perfect hash functions using less space with respect to existing techniques. The main obstruction for any practical application of these results is the cubic-time Gaussian elimination required to solve these linear systems: despite they can be made very small, the computation is still too slow to be feasible. In this paper we describe in detail a number of heuristics and programming techniques to speed up the resolution of these systems by several orders of magnitude, making the overall construction competitive with the standard and widely used MWHC technique, which is based on hypergraph peeling. In particular, we introduce broadword programming techniques for fast equation manipulation and a lazy Gaussian elimination algorithm. We also describe a number of technical improvements to the data structure which further reduce space usage and improve lookup speed. Our implementation of these techniques yields a minimal perfect hash function data structure occupying 2.24 bits per element, compared to 2.68 for MWHC-based ones, and a static function data structure which reduces the multiplicative overhead from 1.23 to 1.03

Antidepressant efficacy of cariprazine in bipolar disorder and the role of its pharmacodynamic properties:A hypothesis based on data

The treatment of bipolar depression is one of the most challenging needs in contemporary psychiatry. Currently, only quetiapine, olanzapine-fluoxetine combination, lurasidone, cariprazine, and recently lumateperone have been FDA-approved to treat this condition. The neurobiology of bipolar depression and the possible targets of bipolar antidepressant therapy remain elusive. The current study investigated whether the pharmacodynamic properties of cariprazine fit into a previously developed model which was the first to be derived based on the strict combination of clinical and preclinical data. The authors performed a systematic review of the literature to identify the pharmacodynamic properties of cariprazine. The original model suggests that a constellation of effects on different receptors is necessary and that serotonin reuptake inhibition does not appear to play a significant role in acute bipolar depression. On the contrary, norepinephrine activity seems to be necessary. Probably the early antidepressant effect can be achieved through an agonistic activity at 5HT-1A and antagonism at alpha1 noradrenergic and 5-HT2A receptors, but the presence of a norepinephrine reuptake inhibition appears essential to sustain it. Overall, the properties of cariprazine fit well the proposed model and add to its validity. A point that needs further clarification is norepinephrine reuptake inhibition which is not yet fully studied for cariprazine.</p

On the Insertion Time of Cuckoo Hashing

Cuckoo hashing is an efficient technique for creating large hash tables with high space utilization and guaranteed constant access times. There, each item can be placed in a location given by any one out of k different hash functions. In this paper we investigate further the random walk heuristic for inserting in an online fashion new items into the hash table. Provided that k > 2 and that the number of items in the table is below (but arbitrarily close) to the theoretically achievable load threshold, we show a polylogarithmic bound for the maximum insertion time that holds with high probability

Depression, distress and their association with patterns of psychoactive substance use during the COVID-19 emergency state in Latvia

publishersversionPeer reviewe