Abstract We analyzed the three parts of Dante’s Divina Commedia using word frequencies as style markers for statistical analysis. Partial least square discriminant analysis was used to provide separation among the cantos of the three parts of the Comedy, Inferno, Purgatorio and Paradiso; the statistical models were able to successfully discriminate the poetic tones used by Dante to characterize and diversify... We analyzed the three parts of Dante’s Divina Commedia using word frequencies as style markers for statistical analysis. Partial least square discriminant analysis was used to provide separation among the cantos of the three parts of the Comedy, Inferno, Purgatorio and Paradiso; the statistical models were able to successfully discriminate the poetic tones used by Dante to characterize and diversify the three parts, demonstrating the existence of a particular stylistic substratum in each cantica of the Commedia. Read More Read Less

Abstract Automated negotiation is a process by which competitors aim to reach agreement by using suitable strategies. This paper aims to enhance negotiation process by using theoretical techniques that help agents to reach final agreement with shorten trade time. The purpose is to succeed negotiation process with better resource utilization. The proposed techniques are based on game theory to support the... Automated negotiation is a process by which competitors aim to reach agreement by using suitable strategies. This paper aims to enhance negotiation process by using theoretical techniques that help agents to reach final agreement with shorten trade time. The purpose is to succeed negotiation process with better resource utilization. The proposed techniques are based on game theory to support the decision of rational agents to offer the better acceptable proposal in a specific negotiation thread. The designed model has been evaluated by extensive experiments. Read More Read Less

Abstract In recent decades, our computers tolerate multidimensional data to be stored and maintained depending on the high computational strength of these computers. As a result, the two-dimensional pattern matching considered as one of the hot research areas. In this paper, we investigate the exact two dimensional pattern matching problem. A new algorithm to solve the main problem in this field... In recent decades, our computers tolerate multidimensional data to be stored and maintained depending on the high computational strength of these computers. As a result, the two-dimensional pattern matching considered as one of the hot research areas. In this paper, we investigate the exact two dimensional pattern matching problem. A new algorithm to solve the main problem in this field is proposed which converts the two dimensional problem into one dimensional problem before searching process which required high computational cost in preprocessing phase. The proposed algorithm deals with white and black images, specifically, with text images. Experimental results show the superiority of the proposed algorithm when comparing with (Brute-force algorithm, RK-KMP algorithm). The results of our algorithm point to the number of comparisons have been reduced in many cases. In another side, when we apply the proposed algorithm on one dimensional text, its time is proportional to θ (n), that means our time in this case is linear. Read More Read Less