Soheir Mohamed Khamis

Soheir Mohamed Khamis

Auto-generated profile, based on publicly available information

Soheir Mohamed Khamis

Department of Mathematics, Faculty of Science, Ain Shams University, Cairo, Egypt

Research Focus & Metrics

Academic Career Length

38Years (1989-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 November 2015 in Journal of Advanced Research
Verified
Journal Article
Open access
NRNaglaa Mohammed Reda
Naglaa Mohammed Reda
ATAbdel Tawfik
Abdel Tawfik
MMMohamed A. Marzok
Mohamed A. Marzok
SKSoheir M. Khamis
Soheir M. Khamis
Scheduling tasks on heterogeneous resources distributed over a grid computing system is an NP-complete problem. The main aim for several researchers is to develop variant scheduling algorithms for achieving optimality, and they have shown a good performance for tasks scheduling regarding resources selection. However, using of the full power of resources is still a challenge. In this paper, a new heuristic algorithm called Sort-Mid is proposed. It aims to maximizing the utilization and minimizing the makespan. The new strategy of Sort-Mid algorithm is to find appropriate resources. The base step is to get the average value via sorting list of completion time of each task. Then, the maximum average is obtained. Finally, the task has the maximum average is allocated to the machine that has the minimum completion time. The allocated task is deleted and then, these steps are repeated until all tasks are allocated. Experimental tests show that the proposed algorithm outperforms almost other algorithms in terms of resources utilization and makespan.

15 February 2007 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
MEM.H. El-Zahar
M.H. El-Zahar
SKS.M. Khamis
S.M. Khamis
KNKh.M. Nazzal
Kh.M. Nazzal

1 January 2004 in Discrete Mathematics
Verified
Journal Article
Closed access
SKSoheir M. Khamis
Soheir M. Khamis


1 March 2016 in Journal of Advanced Research
Verified
Journal Article
Open access
HLHewayda M.S. Lotfy
Hewayda M.S. Lotfy
SKSoheir M.S. Khamis
Soheir M.S. Khamis
MAMaie M. Aboghazalah
Maie M. Aboghazalah
Characterization of user activities is an important issue in the design and maintenance of websites. Server weblog files have abundant information about the user's current interests. This information can be mined and analyzed therefore the administrators may be able to guide the users in their browsing activity so they may obtain relevant information in a shorter span of time to obtain user satisfaction. Web-based technology facilitates the creation of personally meaningful and socially useful knowledge through supportive interactions, communication and collaboration among educators, learners and information. This paper suggests a new methodology based on learning techniques for a Web-based Multiagent-based application to discover the hidden patterns in the user's visited links. It presents a new approach that involves unsupervised, reinforcement learning, and cooperation between agents. It is utilized to discover patterns that represent the user's profiles in a sample website into specific categories of materials using significance percentages. These profiles are used to make recommendations of interesting links and categories to the user. The experimental results of the approach showed successful user pattern recognition, and cooperative learning among agents to obtain user profiles. It indicates that combining different learning algorithms is capable of improving user satisfaction indicated by the percentage of precision, recall, the progressive category weight and F 1-measure.

5 August 1994 in Discrete Mathematics
Verified
Journal Article
Open access
PDF file
BBBayoumi I. Bayoumi
Bayoumi I. Bayoumi
MEMohamed H. El-Zahar
Mohamed H. El-Zahar
SKSoheir M. Khamis
Soheir M. Khamis
The number of unlabeled 2-dimensional posets is recursively calculated. This counting makes use of the relationship between permutations and posets of dimension two.