• Design and implement connectors in distributed system 

  Mcheick H.; Qi Y.; Safa H.; Karam M. (, 2011)

  Software connectors play an important role in distributed system. In recent years, software developers have been facing more challenges of connectors which are used to connect distributed components. Design of connectors ...
• Survey of security issues in cognitive radio networks 

  El-Hajj W.; Safa H.; Guizani M. (HUALIENNATIONAL DONG HWA UNIV, JIT, COMPUTER and IT CENTER, HUALIEN, 00000, TAIWAN, 2011)

  Cognitive Radio (CR) is a novel technology that promises to solve the spectrum shortage problem by allowing secondary users to coexist with primary users without causing interference to their communication. Although the ...
• A simulated annealing algorithm for the capacitated vehicle routing problem 

  Harmanani H.; Azar D.; Helal N.; Keirouz W. (, 2011)

  The Capacitated Vehicle Routing Problem (CVRP) is a combinatorial optimization problem where a eet of delivery vehicles must service known customer demands from a common depot at a minimum transit cost without exceeding ...
• On the refinement of liveness properties of distributed systems 

  Attie P.C. (DORDRECHTVAN GODEWIJCKSTRAAT 30, 3311 GZ DORDRECHT, NETHERLANDS, 2011)

  We present a new approach, based on simulation relations, for reasoning about liveness properties of distributed systems. Our contribution consists of (1) a formalism for defining liveness properties, (2) a proof method ...
• Early adaptation aspects extraction in web development 

  Dargham J.; Aoude L.; Karam M. (, 2011)

  One important issue that pleases the web applications' users and draws their attention is the adaptability of the application manipulated, where web pages can change content upon user's needs and characteristics. Some ...
• A Policy-Based Trust-Aware Adaptive Monitoring Scheme to enhance WiMax QoS 

  Safa H.; Shahla F.A. (AMSTERDAMPO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS, 2011)

  The IEEE 802.16 standard does not define or recommend any algorithm for measuring whether a flow exceeds its maximum sustained traffic rate. However, in this standard the Service Data Units deemed to exceed the granted ...
• The impossibility of boosting distributed service resilience 

  Attie P.; Guerraoui R.; Kuznetsov P.; Lynch N.; Rajsbaum S. (SAN DIEGO525 B ST, STE 1900, SAN DIEGO, CA 92101-4495 USA, 2011)

  We study f-resilient services, which are guaranteed to operate as long as no more than f of the associated processes fail. We prove three theorems asserting the impossibility of boosting the resilience of such services. ...
• A transport layer interoperability model for mobile ad-hoc environment 

  Safa H.; Karam M.; Assi R.A.; Mcheick H. (, 2011)

  Mobile ad-hoc networks (MANETs) are dynamic in nature. Links between nodes may constantly change due to mobility. The performance of the transmission control protocol (TCP) degrades in such an environment mainly due to its ...
• Mesh cutting during real-time physical simulation 

  Turkiyyah G.M.; Karam W.B.; Ajami Z.; Nasri A. (OXFORDTHE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD OX5 1GB, OXON, ENGLAND, 2011)

  The ability to cut through meshes in real-time is an essential ingredient in a number of practical interactive simulations. Surgical simulation, cloth design, clay sculpting and many other related VR applications require ...
• Trust-aware monitoring scheme for WiMAX networks 

  Safa H.; Shahla F.A. (, 2010)

  The IEEE 802.16 standard, the service data units deemed to exceed the granted bandwidth may be delayed or dropped. In addition, nodes would behave maliciously by requesting more resources than their requirements just to ...
• An empirical study of cache-oblivious polygon indecomposability testing 

  Abu Salem F.K.; Soudah R.N. (WIENSACHSENPLATZ 4-6, PO BOX 89, A-1201 WIEN, AUSTRIA, 2010)

  We implement and undertake an empirical study of the cache-oblivious variant of the polygon indecomposability testing algorithm of Gao and Lauder, based on a depth-first search (DFS) traversal of the computation tree. ...
• Cache-oblivious polygon indecomposability testing 

  Salem F.K.A. (, 2010)

  We examine a cache-oblivious reformulation of the (iterative) polygon indecomposability test of [19]. We analyse the cache complexity of the iterative version of this test within the ideal-cache model and identify the ...
• Reactive localization in underwater wireless sensor networks 

  Watfa M.K.; Nsouli T.; Al-Ayache M.; Ayyash O. (, 2010)

  In this paper, we present a novel technique for localizing an event of interest in an underwater environment. The network consists of randomly deployed identical sensor nodes. Instead of proactively localizing every single ...
• A hybrid DV-Hop for localization in large scale Wireless Sensor Networks 

  Yassine F.; Safa H. (, 2009)

  Localization has been a major challenge in Wireless Sensor Networks (WSN) because without finding the position of the sensor that is reporting sensed data, the data reported will not be useful. However, most of the previous ...
• An inductive logic programming approach to validate hexose binding biochemical knowledge 

  Nassif H.; Al-Ali H.; Khuri S.; Keirouz W.; Page D. (, 2010)

  Hexoses are simple sugars that play a key role in many cellular pathways, and in the regulation of development and disease mechanisms. Current protein-sugar computational models are based, at least partially, on prior ...
• Relaxing result accuracy for performance in publish-subscribe systems 

  Bashir E.; Boulos J. (, 2005)

  Since the evaluation of XPath expressions is highly dependent upon their size and navigational structures that include ancestor-descendant relationships (--) and wildcard steps (-*), we introduce a novel and complementary ...
• Generating B-spline curves with points, normals and curvature constraints: A constructive approach 

  Abbas A.; Nasri A.; Maekawa T. (NEW YORK233 SPRING ST, NEW YORK, NY 10013 USA, 2010)

  This paper presents a constructive method for generating a uniform cubic B-spline curve interpolating a set of data points simultaneously controlled by normal and curvature constraints. By comparison, currently published ...
• Operating system design in future wireless sensor networks 

  Watfa M.K.; Moubarak M.; Kashani A. (, 2010)

  Traditional operating systems do not take into consideration the limitations in space and energy of wireless sensor networks. Thus, contemporary architectural demands in terms of power, heat, size and cost will not be ...
• Assisting students with typical programming errors during a coding session 

  Karam M.; Awa M.; Carbone A.; Dargham J. (, 2010)

  Typical programming errors that introductory students make are known to stall and frustrate them during their first few lab coding sessions. Traditionally, lab instructors help with the process of correcting these errors; ...
• Dominating set-based location management architecture for mobile IP networks 

  Safa H.; Kassab W. (, 2009)

  Mobile IPv4 and Mobile IPv6 were proposed to extend the IP protocol to support mobility. They use two IP addresses: a home network address that is used as a permanent identification address, and a care-of-address acquired ...

View more