A Statistical Learning Approach to Evidence the Acoustic Miracles in the Holy Quran Using Audio Features

This paper presents a novel approach for exploring the intrinsic acoustic properties of the Holy Quran, in an attempt to provide yet one more evidence of the miraculous nature of the Quran. The study uses a dataset composed of recitations made by seven prominent reciters and three chapters of the Quran. A novel statistical approach is used to detect the correlation between the recitations of the reciters for three different Chapters (Quranic Surah). The study utilizes the Mel-Frequency Cepstral Coefficients (MFCCs) feature to detect certain common patterns among the recitations. The main measurement indexes used in this study are the correlation and the Euclidian Distance (ED) between the mean of the MFCCs Cepstral Coefficients, and deltadelta MFCCs. The study reveals a strong correlation and short distance between all recitations for one verse at a time, and relatively high correlation and short distance for two or more verses. Furthermore, the study lays down a foundation to detect and formulate acoustic clusters for sequential verses in the Holy Quran

Investigating international new product diffusion speed: A semiparametric approach

Global marketing managers are interested in understanding the speed of the new product diffusion process and how the speed has changed in our ever more technologically advanced and global marketplace. Understanding the process allows firms to forecast the expected rate of return on their new products and develop effective marketing strategies. The most recent major study on this topic [Marketing Science 21 (2002) 97--114] investigated new product diffusions in the United States. We expand upon that study in three important ways. (1) Van den Bulte notes that a similar study is needed in the international context, especially in developing countries. Our study covers four new product diffusions across 31 developed and developing nations from 1980--2004. Our sample accounts for about 80% of the global economic output and 60% of the global population, allowing us to examine more general phenomena. (2) His model contains the implicit assumption that the diffusion speed parameter is constant throughout the diffusion life cycle of a product. Recognizing the likely effects on the speed parameter of recent changes in the marketplace, we model the parameter as a semiparametric function, allowing it the flexibility to change over time. (3) We perform a variable selection to determine that the number of internet users and the consumer price index are strongly associated with the speed of diffusion.Comment: Published in at http://dx.doi.org/10.1214/11-AOAS519 the Annals of Applied Statistics (http://www.imstat.org/aoas/) by the Institute of Mathematical Statistics (http://www.imstat.org

Improving route discovery in on-demand routing protocols using local topology information in MANETs

Most existing routing protocols proposed for MANETs use flooding as a broadcast technique for the propagation of network control packets; a particular example of this is the dissemination of route requests (RREQs), which facilitate route discovery. In flooding, each mobile node rebroadcasts received packets, which, in this manner, are propagated network-wide with considerable overhead. This paper improves on the performance of existing routing protocols by reducing the communication overhead incurred during the route discovery process by implementing a new broadcast algorithm called the adjusted probabilistic flooding on the Ad-Hoc on Demand Distance Vector (AODV) protocol. AODV [3] is a well-known and widely studied algorithm which has been shown over the past few years to maintain an overall lower routing overhead compared to traditional proactive schemes, even though it uses flooding to propagate RREQs. Our results, as presented in this paper, reveal that equipping AODV with fixed and adjusted probabilistic flooding, instead, helps reduce the overhead of the route discovery process whilst maintaining comparable performance levels in terms of saved rebroadcasts and reachability as achieved by conventional AODV\@. Moreover, the results indicate that the adjusted probabilistic technique results in better performance compared to the fixed one for both of these metrics

An efficient processor allocation strategy that maintains a high degree of contiguity among processors in 2D mesh connected multicomputers

Two strategies are used for the allocation of jobs to processors connected by mesh topologies: contiguous allocation and non-contiguous allocation. In non-contiguous allocation, a job request can be split into smaller parts that are allocated to non-adjacent free sub-meshes rather than always waiting until a single sub-mesh of the requested size and shape is available. Lifting the contiguity condition is expected to reduce processor fragmentation and increase system utilization. However, the distances traversed by messages can be long, and as a result the communication overhead, especially contention, is increased. The extra communication overhead depends on how the allocation request is partitioned and assigned to free sub-meshes. This paper presents a new Non-contiguous allocation algorithm, referred to as Greedy-Available-Busy-List (GABL for short), which can decrease the communication overhead among processors allocated to a given job. The simulation results show that the new strategy can reduce the communication overhead and substantially improve performance in terms of parameters such as job turnaround time and system utilization. Moreover, the results reveal that the Shortest-Service-Demand-First (SSD) scheduling strategy is much better than the First-Come-First-Served (FCFS) scheduling strategy

Non-contiguous processor allocation strategy for 2D mesh connected multicomputers based on sub-meshes available for allocation

Contiguous allocation of parallel jobs usually suffers from the degrading effects of fragmentation as it requires that the allocated processors be contiguous and has the same topology as the network topology connecting these processors. In non-contiguous allocation, a job can execute on multiple disjoint smaller sub-meshes rather than always waiting until a single sub-mesh of the requested size is available. Lifting the contiguity condition in non-contiguous allocation is expected to reduce processor fragmentation and increase processor utilization. However, the communication overhead is increased because the distances traversed by messages can be longer. The extra communication overhead depends on how the allocation request is partitioned and allocated to free sub-meshes. In this paper, a new non-contiguous processor allocation strategy, referred to as Greedy-Available-Busy-List, is suggested for the 2D mesh network, and is compared using simulation against the well-known non-contiguous and contiguous allocation strategies. To show the performance improved by proposed strategy, we conducted simulation runs under the assumption of wormhole routing and all-to-all communication pattern. The results show that the proposed strategy can reduce the communication overhead and improve performance substantially in terms of turnaround times of jobs and finish times

The effect of real workloads and stochastic workloads on the performance of allocation and scheduling algorithms in 2D mesh multicomputers

The performance of the existing non-contiguous processor allocation strategies has been traditionally carried out by means of simulation based on a stochastic workload model to generate a stream of incoming jobs. To validate the performance of the existing algorithms, there has been a need to evaluate the algorithms' performance based on a real workload trace. In this paper, we evaluate the performance of several well-known processor allocation and job scheduling strategies based on a real workload trace and compare the results against those obtained from using a stochastic workload. Our results reveal that the conclusions reached on the relative performance merits of the allocation strategies when a real workload trace is used are in general compatible with those obtained when a stochastic workload is used

Autonomous Camera Movement for Robotic-Assisted Surgery: A Survey

In the past decade, Robotic-Assisted Surgery (RAS) has become a widely accepted technique as an alternative to traditional open surgery procedures. The best robotic assistant system should combine both human and robot capabilities under the human control. As a matter of fact robot should collaborate with surgeons in a natural and autonomous way, thus requiring less of the surgeons\u27 attention. In this survey, we provide a comprehensive and structured review of the robotic-assisted surgery and autonomous camera movement for RAS operation. We also discuss several topics, including but not limited to task and gesture recognition, that are closely related to robotic-assisted surgery automation and illustrate several successful applications in various real-world application domains. We hope that this paper will provide a more thorough understanding of the recent advances in camera automation in RSA and offer some future research directions

BULLING BEHAVIOURS, SELF-ESTEEM AND ACADEMIC ACHIEVEMENT AMONG JORDANIAN SCHOOL STUDENTS

This study investigated the differences among bullies, victims and uninvolved in self-esteem and academic achievement. The sample of the study consisted of 641 students (303 males, 338 females) in grades from seventh to tenth. For achieving the aim of this study, the following scales were used: bullying scale, victimization scale, self-esteem scale, and GPAs. The results showed that both Univolved students and bullies had significantly higher self-esteem than did victims. Univolved students had significantly higher academic performance than did bullies or victims. Implications were discussed