Recommender Systems are tools to understand the huge amount of data available in the internet world. Collaborative filtering (CF) is one of the most knowledge discovery methods used positively in recommendation system. Memory collaborative filtering emphasizes on using facts about present users to predict new things for the target user. Similarity measures are the core operations in collaborative filtering and the prediction accuracy is mostly dependent on similarity calculations. In this study, a combination of weighted parameters and traditional similarity measures are conducted to calculate relationship among users over Movie Lens data set rating matrix. The advantages and disadvantages of each measure are spotted. From the study, a n

Static loads exposing to mechanical components can cause cracks, which are lead to form stress concentration regions causing the failure of structure. Generally, from 80% to 90% of structure failure is due to initiation of the cracks. Therefore, it is necessary to repair the crack and reduce its effect on the structure where the effect of the crack is modelled as an additional flexibility to the structure. In the last few years, piezoelectric materials have been considered as one of the most favourable repairing techniques. The piezoelectric material converts the applied voltage on it to a bending moment to counter the bending moment caused by the external load on the beam at the crack location. In this study, the design of the piez

This paper describes the digital chaotic signal with ship map design. The robust digital implementation eliminates the variation tolerance and electronics noise problems common in analog chaotic circuits. Generation of good non-repeatable and nonpredictable random sequences is of increasing importance in security applications. The use of 1-D chaotic signal to mask useful information and to mask it unrecognizable by the receiver is a field of research in full expansion. The piece-wise 1-D map such as ship map is used for this paper. The main advantages of chaos are the increased security of the transmission and ease of generation of a great number of distinct sequences. As consequence, the number of users in the systems can be increased. Rec

0

          The aim of this paper is to present a new methodology to find the private key of RSA. A new initial value which is generated from a new equation is selected to speed up the process. In fact, after this value is found, brute force attack is chosen to discover the private key. In addition, for a proposed equation, the multiplier of Euler totient function to find both of the public key and the private key is assigned as 1. Then, it implies that an equation that estimates a new initial value is suitable for the small multiplier. The experimental results show that if all prime factors of the modulus are assigned larger than 3 and the multiplier is 1, the distance between an initial value and the private key

In this paper a modified approach have been used to find the approximate solution of ordinary delay differential equations with constant delay using the collocation method based on Bernstien polynomials.

The work includes synthesis and characterization of some new heterocyclic compounds, as flow: The compound (3) (5-(4-chlorophenyl) -2-hydrazinyl-1,3,4-oxadiazole was synthesized by using two methods; the first method includes the direct reaction between hydrazine hydrate 80% and 5-(4-chlorophenyl)-2- (ethylthio) 1,3,4-oxadiazole (1), the second method involves converting 5-(4-chlorophenyl)-1,3,4-oxadiazol-2-amine (2) to diazonium salt then reducing this salt to compound (3) by stannous chloride. Compound (3) was used as starting material for synthesizing several fused heterocyclic compounds. The compound 6-(4-chlorophenyl)[1,2.4] triazolo [3,4,b][1,3,4] oxadiazole-3-(2H) thione (compound 4) was synthesized from the reaction of compound (3)

The university course timetable problem (UCTP) is typically a combinatorial optimization problem. Manually achieving a useful timetable requires many days of effort, and the results are still unsatisfactory. unsatisfactory. Various states of art methods (heuristic, meta-heuristic) are used to satisfactorily solve UCTP. However, these approaches typically represent the instance-specific solutions. The hyper-heuristic framework adequately addresses this complex problem. This research proposed Particle Swarm Optimizer-based Hyper Heuristic (HH PSO) to solve UCTP efficiently. PSO is used as a higher-level method that selects low-level heuristics (LLH) sequence which further generates an optimal solution. The proposed a