The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Websites of universities have become vital in evaluating universities' performance. These websites may face some weaknesses, including poor design, insecure system, bad performance or usability. There is a limited research work that evaluates the universities' websites performance. In this paper, a new approach is proposed in order to evaluate the Jordanian universities based on data envelopment analysis...
Map Reduce (MP) Is an efficient programming model for processing big data. However, MR has some limitations in performing the join operation. Recent researches have been made to alleviate this problem, such as Bloom join. The idea of the Bloom join lies in constructing a Bloom filter to remove redundant records before performing the join operation. The size of the constructed filter is very critical...
Lately, the large increasing in data amount results in compound and large data-sets that caused the appearance of “Big Data” concept which gained the attention of industrial organizations as well as academic communities. Big data APIs that need large memory can benefit from Phoenix MapReduce implementation for shared-memory machines, instead of large, distributed clusters of computers. This paper...
This paper presents an in-place pseudo linear average case radix sorting algorithm. The proposed algorithm, MSL (Map Shuffle Loop) is a modification of the ARL algorithm. The MSL permutation loop is faster than the ARL counterpart since it searches for the root of the next permutation cycle group by group. The permutation cycle loop maps a key to its target group and shuffles the input array. The...
The traditional method for detecting the tumor diseases in the human MRI brain images is done manually by physicians. Automatic classification of tumors of MRI images requires high accuracy, since the non-accurate diagnosis and postponing delivery of the precise diagnosis would lead to increase the prevalence of more serious diseases. To avoid that, an automatic classification system is proposed for...
Generally, one spatial index structure (called Single Big Index SBI) is built for the whole data space; therefore most of the index nodes are prone to be checked during query execution. In this paper, we proposed a technique to partition the space into groups and construct a set of small indices (called Multi Small-Index MSI), one for each group. Such that we can quickly access query-relevant objects...
Arabic has a complex structure, which makes it difficult to apply natural language processing (NLP). Much research on Arabic NLP (ANLP) does exist; however, it is not as mature as that of other languages. Finding Arabic roots is an important step toward conducting effective research on most of ANLP applications. The authors have studied and compared six root‐finding algorithms with success rates of...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.