about.jpg

Filter by

A fully automated approach for Arabic slang lexicon extraction from microblogs

With the rapid increase in the volume of Arabic opinionated posts on different social media forums, comes an increased demand for Arabic sentiment analysis tools and resources. Social media posts, especially those made by the younger generation, are usually written using colloquial Arabic and include a lot of slang, many of which evolves over time. While some work has been carried out to build

Artificial Intelligence
Software and Communications

Enhanced customer churn prediction using social network analysis

There were 6.8 billion estimates for mobile subscriptions worldwide by end of 2013 [11]. As the mobile market gets saturated, it becomes harder for telecom providers to acquire new customers, and makes it essential for them to retain their own. Due to the high competition between different telecom providers and the ability of customers to move from one provider to another, all telecom service

Artificial Intelligence

VAFLE: Visual analytics of firewall log events

In this work, we present VAFLE, an interactive network security visualization prototype for the analysis of firewall log events. Keeping it simple yet effective for analysts, we provide multiple coordinated interactive visualizations augmented with clustering capabilities customized to support anomaly detection and cyber situation awareness. We evaluate the usefulness of the prototype in a use

Artificial Intelligence

Accurate estimation of the myocardium global function from reduced magnetic resonance image acquisitions

Evaluating the heart global function from magnetic resonance images is based on estimating a number of functional parameters such as the left ventricular (LV) volume, LV mass, ejection fraction, and stroke volume. Estimating these parameters requires accurate calculation of the volumes enclosed by the inner and outer surfaces of the LV chamber at the max contraction and relaxation states of the

Artificial Intelligence

Using the sadakane compressed suffix tree to solve the all-pairs suffix-prefix problem

The all-pairs suffix-prefix matching problem is a basic problem in string processing. It has an application in the de novo genome assembly task, which is one of the major bioinformatics problems. Due to the large size of the input data, it is crucial to use fast and space efficient solutions. In this paper, we present a space-economical solution to this problem using the generalized Sadakane

Artificial Intelligence

Practical distributed computation of maximal exact matches in the cloud

Computation of maximal exact matches (MEMs) is an important problem in comparing genomic sequences. Optimal sequential algorithms for computing MEMs have been already introduced and integrated in a number of software tools. To cope with large data and exploit new computing paradigms like cloud computing, it is important to develop efficient and ready-to-use solutions running on distributed

Artificial Intelligence

A new cloud computing governance framework

Nowadays, most service providers adopt Cloud Computing technology. Moving to Cloud creates new risks and challenges. The Cloud era is to outsource our services to Cloud Service Provider (CSP). However, we have to develop a strong governance framework to review the service level, to manage risk effectively and to certify that our critical information is secure. In this paper, we develop an

Artificial Intelligence

Convergence study of IPv6 tunneling techniques

IPv4 address exhaustion pushed IETF to create IPv6, the improved substitute of IPv4. The Internet complexity and its enormous size prolong the transition from IPv4 to IPv6 process. This means that both versions will necessarily co-exist. Meanwhile, tunneling appears as a solution trend. The tunneling is a transition technique that is considered temporary till all ISPs would support IPv6. At this

Artificial Intelligence
Software and Communications

Computing the Burrows-Wheeler transform of a string and its reverse in parallel

The contribution of this article is twofold. First, we provide new theoretical insights into the relationship between a string and its reverse: If the Burrows-Wheeler transform (BWT) of a string has been computed by sorting its suffixes, then the BWT, the suffix array, and the longest common prefix array of the reverse string can be derived from it without suffix sorting. Furthermore, we show that

Software and Communications

Cloud-based parallel suffix array construction based on MPI

Massive amount of genomics data are being produced nowadays by Next Generation Sequencing machines. The suffix array is currently the best choice for indexing genomics data, because of its efficiency and large number of applications. In this paper, we address the problem of constructing the suffix array on computer cluster in the cloud. We present a solution that automates the establishment of a

Software and Communications