Consider a large number n of neurons, each being connected to approximately N other ones, chosen at random. When a neuron spikes, which occurs randomly at some rate depending on its electric potential, its potential is set to a minimum value vmin, and this initiates, after a small delay, two fronts on the (linear) dendrites of all the neurons to which it is connected. Fronts move at constant sp...

The purpose of this dissertation is to study certain classes of permutations and plane partitions of truncated shapes. We establish some of their enumerative and combinatorial properties. The proofs develop methods and interpretations within various fields of algebraic combinatorics, most notably the theory of symmetric functions and their combinatorial properties. The first chapter of this the...

objective: to examine the inter-rater reliability of triages performed by the electronic triage system (ets) which has recently developed and used in hospital emergency department (ed). methods: this cross-sectional study was conducted prospectively and studied 408 visitors of tabriz imam reza hospital’s ed. the variables of interest were age, sex, nurse-assigned triage category, physician-assi...

in this paper, optimum location of power system stabilizers in order to damp inter-area oscillations has been investigated by using modal series method. nonlinear effects grow in dynamical behaviors of heavily loaded stressed power systems significantly. hence linear based methods and techniques no longer present clear and exact response of the systems. in this article by defining new nonlinear...

This paper discusses the interconnection requirements between management systems over the TMN X interface in terms of security and integrity, as well as the relationship between these two issues. A testing approach is developed in order to assess the impact of introducing security policies in the inter-domain communication between two independent TMN OSs, on the basic functional and performance...

In this paper, we construct a data structure using a forest of redblack trees to efficiently compute the longest increasing subsequence of a dynamically updated sequence. Our data structure supports a query for the longest increasing subsequence in O(r + logn) worst case time and supports inserts anywhere in the sequence in O (r logn/r) worst case time, where r is the length of the longest incr...

Given a random permutation of the numbers 1, 2, . . . . n, let L, be the length of the longest descending subsequence of this permutation. Let F, be the minimal header (first element) of the descending subsequences having maximal length. It is known that EL,/&,,,, c and that c=2. However, the proofs that r=2 are far from elementary and involve limit processes. Several relationships between thes...

BACKGROUND AND OBJECTIVES In this study we examined whether prestorage leucocyte reduction prevents the accumulation of bioreactive substances in red cell units. MATERIALS AND METHODS Measurements were performed in the supernatants of buffy-coat-depleted (standard red cells) and leucocyte-reduced (filtered red cells) red cell units. The effect of storage was evaluated by taking repetitive sam...

We investigate partitioning of integer sequences into heapable subsequences (previously defined and established by Mitzenmacher et al. [BHMZ11]). We show that an extension of patience sorting computes the decomposition into a minimal number of heapable subsequences (MHS). We connect this parameter to an interactive particle system, a multiset extension of Hammersley’s process, and investigate i...