Ahmed Wasfy

American University of Sharjah, Ash Shāriqah, Ash Shāriqah, United Arab Emirates

Are you Ahmed Wasfy?

Claim your profile

Publications (5)1.05 Total impact

  • Fadi Aloul · Imad Zabalawi · Ahmed Wasfy
    [Show abstract] [Hide abstract]
    ABSTRACT: The faculty course scheduling problem is concerned with assigning time slots to courses while taking into consideration some departmental and university constraints and instructor preferences. The problem also aims at optimizing the performance criteria and distributing the courses evenly among the available time slots. The problem is a classic scheduling problem and has received some research during the past few years due to its wide use in academic institutions. Most of the proposed solutions were based on local search techniques. In this paper, we present a complete approach to solving the course scheduling problem using Boolean Satisfiability (SAT). Experimental results show the effectiveness of the proposed approach.
    No preview · Conference Paper · Sep 2013
  • [Show abstract] [Hide abstract]
    ABSTRACT: Large software systems are constantly monitored so that audits can be initiated, once a failure occurs or when maintenance operations are performed. However, the log files are usually sizeable, and require filtering and reduction in order to be processed efficiently. In this paper, we define the concept of the Event Dependency Graph, and we discuss an event filtering and a use case identification technique, that is based on event clustering. This technique can be used to reduce the size of system logs and assist on system analysis and, program understanding.
    No preview · Conference Paper · Jan 2011
  • [Show abstract] [Hide abstract]
    ABSTRACT: Recent developments in ad-hoc wireless networks, single-chip embedded systems and the wide-spread availability of Internet in homes has made it possible to remotely monitor status of external data sources and home appliances using small, independent wireless devices. This paper presents an open-architecture and an implementation of such a system called the IPnfopods System. This architecture is based on a Zigbee-based controller. The architecture allows multiple family members to simultaneously monitor their home appliances as well as external Internet resources using cheap, stand-alone hand-held mobile wireless devices. The proposed architecture can be easily integrated with existing smart-home systems. The architecture is implemented and demonstrated in the context of an existing Java-based smarthome architecture.
    No preview · Article · Sep 2009 · IEEE Transactions on Consumer Electronics
  • [Show abstract] [Hide abstract]
    ABSTRACT: Ad-hoc sensor networks provide a cheap and scalable technology for constructing pervasive learning assessment systems that are embedded in physical environments. This paper proposes an extension to the QTI assessment standard that supports localized sensor data from sensor networks by incorporating the Sensor-ML notation. This extension can lead to a new class of pervasive learning environments where learning is enhanced by interacting with a large number of ad-hoc wireless nodes in a physical environment. Each wireless node can present various questions related to the current physical context. An architecture and a prototype implementation using the Jennic Zigbee toolkit is also presented.
    No preview · Conference Paper · Jan 2008
  • Source
    Ahmed Wasfy · Fadi A Aloul
    [Show abstract] [Hide abstract]
    ABSTRACT: The University Class Scheduling Problem (UCSP) is concerned with assigning a number of courses to classrooms taking into consideration constraints like classroom capacities and university regulations. The problem also attempts to optimize the performance criteria and distribute the courses fairly to classrooms depending on the ratio of classroom capacities to course enrollments. The problem is a classical scheduling problem and considered to be NP-complete. It has received some research during the past few years given its wide use in colleges and universities. Several formulations and algorithms have been proposed to solve scheduling problems, most of which are based on local search techniques. In this paper, we propose a complete approach using integer linear programming (ILP) to solve the problem. The ILP model of interest is developed and solved using the three advanced ILP solvers based on generic algorithms and Boolean Satisfiability (SAT) techniques. SAT has been heavily researched in the past few years and has lead to the development of powerful 0-1 ILP solvers that can compete with the best available generic ILP solvers. Experimental results indicate that the proposed model is tractable for reasonable-sized UCSP problems.
    Full-text · Article · Jan 2007