Search

Muscular dystrophy, also known as Duchenne muscular dystrophy (DMD), is a fatal muscle disorder, changes to the DMD gene be the cause of this disease, DMD primarily impacts boys during childhood. For DMD there was no treatment available up until, in recent years, a range of curative approaches to Muscular Dystrophy have been under research; a few among them are development of corticosteroids, viral vector mediated gene therapy, exon skipping, etc. exon-skipping is the one of the optimistic approaches for correcting DMD, this therapy's main aim is to transform an out-of-frame mutation to convert an out-of-frame mutation into an in-frame mutation, to change of a severe DMD phenotype into a mild phenotype by restoration of reduced dystrophin aspect. [ABSTRACT FROM AUTHOR]

A typical search engine's response to a query is a ranked list of documents along with their partial content (snippets) Search results clustering problem is defined as an automatic, on-line grouping of similar documents in a search hits list, returned from a search engine. In this paper we discuss how to cluster the snippets and generate the label for them, further the results of the experimental evaluation of a Lingo algorithm using singular value decomposition [ABSTRACT FROM AUTHOR]

In the context of the IEEE 802.11e standard for WLANs, we provide an analytical model for obtaining the maximum number of VoIP calls that can be supported on HCCA, such that the delay QoS constraint of the accepted calls is met, when TCP downloads are coexistent on EDCA. In this scenario, we derive the TCP download throughput by using an analytical model for the case where only TCP sessions are present in the WLAN. We extend the modeling heuristic of to evaluate the performance of an IEEE 802.11e infrastructure network carrying packet telephone calls, streaming video sessions and TCP controlled file downloads, using Enhanced Distributed Channel Access (EDCA). We identify the time boundaries of activities on the channel (called channel slot boundaries) and derive a Markov Renewal Process of the contending nodes on these epochs. This is achieved by the use of attempt probabilities of the contending nodes as those obtained from the saturation fixed point analysis. [ABSTRACT FROM AUTHOR]

Clustering is a widely used technique to partition data in homogeneous groups. It finds applications to Web text and video information retrieval. The main goal of clustering algorithms is to discover the hidden structure of data and group them without any a-prior knowledge of the data domain. Clustering is often used for exploratory tasks. In this paper we survey the principal strategies for clustering, the main clustering objective functions and related algorithms, first we discussed FPF algorithm for the k-center problem then we improved the Furthest-point-first algorithm in terms of speed and quality. [ABSTRACT FROM AUTHOR]