Independent set-based coarse-grid selection algorithms for algebraic multigrid are defined by their policies for weight initialization, independent set selection, and weight update. In this paper, we develop theory demonstrating that algorithms employing the same policies produce identical coarse grids, regardless of the implementation. The coarse-grid invariance motivates a new coarse-grid sel...

infantile haemangiomas (ih) are the most common vascular tumors occurring in early childhood, with a prevalence of approximately 5-10% of infants. these vascular tumors are divided into two main groups including infantile haemangioma and vascular malformations. although, haemangioma of infancy are common, benign and self-limited tumors, a significant percent of these lesions are associated with...

sepsis is the most common cause of neonatal mortality. as per national neonatal-perinatal database (nnpd), 2002-2003, the incidence of neonatal sepsis in india was 30 per 1000 live births. signs and symptoms of sepsis are nonspecific; therefore empirical antimicrobial therapy is promptly initiated after obtaining appropriate cultures. the early manifestations of neonatal sepsis are vague and il...

Recurrent neural networks (RNNs) are notoriously difficult to train. When the eigenvalues of the hidden to hidden weight matrix deviate from absolute value 1, optimization becomes difficult due to the well studied issue of vanishing and exploding gradients, especially when trying to learn long-term dependencies. To circumvent this problem, we propose a new architecture that learns a unitary wei...

The paper presents a modified least squares despread respread multitarget constant modulus algorithm (LS-DRMTCMA). The cost function of the original algorithm was modified by the minimum bit error rate (MBER) criterion. The novel algorithm tries to optimize weight vectors by directly minimizing bit error rate (BER) of code division multiple access (CDMA) mobile communication system. In order to...

On a complete weighted graph that changes dynamically by edge weight updates, we consider the problem of maintaining efficiently a minimum value b, such that the set of edges with weights less than b induces a 2-vertex connected graph (in the undirected case) and a strongly connected graph (in the directed case) on the same vertex set. These problems find application in minimizing power consump...

A novel adaptive and distributed fair scheduling (ADFS) scheme for wireless sensor networks (WSN) in the presence of multiple channels (MC-ADFS) is developed. The proposed MC-ADFS increases available network capacity and focuses on quality-of-service (QoS) issues. When nodes access a shared channel, the proposed MC-ADFS allocates the channel bandwidth proportionally to the packet’s weight which...

Dynamic shortest path algorithms update the shortest paths to take into account a change in an edge weight. This paper describes a new technique that allows the reduction of heap sizes used by several dynamic shortest path algorithms. For unit weight change, the updates can be done without heaps. These reductions almost always reduce the computational times for these algorithms. In computationa...

We study the weight dynamics of the floating-gate pFET synapse and the effects of the pFET’s gate and drain voltages on these dynamics. We show that we can derive a weight update rule such that the equilibrium weight value is proportional to the correlation between the gate and drain voltages. In particular, we want a rule of the form _ = + [ ], where is a voltage signal on the gate terminal an...

In this paper we introduce a Givens-weight representation for rank structured matrices, where the rank structure is defined by certain low rank submatrices starting from the bottom left matrix corner. This representation will be compared to the (block) quasiseparable representations occurring in the literature. We will then provide some basic algorithms for the Givens-weight representation, in ...