.

Browsing School of Arts and Sciences by Title

LAUR Repository

Browsing School of Arts and Sciences by Title

Sort by: Order: Results:

  • On hierarchical collaborative content distribution over communication networks 
    Mouawad, Amer; Sharafeddine, Sanaa (IEEE, 2018-07-05)
    Content distribution applications such as video streaming, file sharing, and network gaming are posing strict requirements on the development and enhancement of communications technologies, architectures, and protocols. ...
  • On Hughes' Model for Pedestrian Traffic 
    Kaldawi, Fadi J (Lebanese American University, 2020-07-09)
    In this thesis, we explore the modeling and application of the pedestrian fl w model proposed by Roger L. Hughes in 2002, a system of a hyperbolic conservation law to describe crowd densities (ρ) and an Eikonal equation ...
  • On Leveraging the Computational Potential of Fog-Enabled Vehicular Networks 
    Sorkhoh, Ibrahim; Ebrahimi, Dariush; Sharafeddine, Sanaa; Assi, Chadi (ACM, 2019-12-10)
    The advent of autonomous vehicles demands powerful processing capabilities of on-board units to handle the dramatic increase of sensor data used to make safe self-driving decisions. Those com- putational resources, being ...
  • On Network Planning for Video Services Over IP Networks 
    Sharafeddine, S. (2016-03-02)
    Video transmission over IP requires very high data rate for a good performance. Variable bit rate (VBR)-coded video is more popular than constant bit rate (CBR)-coded video due to its statistical multiplexing gain and ...
  • On Power-Constrained System-on-chip Test Scheduling Using Precedence Relationships 
    Harmanani, Haidar M.; Salamy, Hassan A. (IEEE, 2017-03-29)
    This paper presents an efficient method to determine minimum SOC test schedules based on simulated annealing. The problem is solved using a partitioned testing scheme with run to completion that minimizes the number of ...
  • On scalable parallel recursive backtracking 
    Abu-Khzam, Faisal N.; Daudjee, Khuzaima; Mouawad, Amer E.; Nishimura, Naomi (2015-12-07)
    Supercomputers are equipped with an increasingly large number of cores to use computational power as a way of solving problems that are otherwise intractable. Unfortunately, getting serial algorithms to run in parallel to ...
  • On sensor selection in mobile devices based on energy, application accuracy, and context metrics 
    Taleb, Sireen; Abbas, Nadine; Hajj, Hazem; Dawy, Zaher (IEEE, 2022-11-25)
    Continuously collecting sensor data on mobile devices helps in capturing important contextual information related to the user location, activity, and surrounding environment. This contextual information is required by ...
  • On Single Source Reachability Improvement 
    Alkak, Hashem (Lebanese American University, 2023-02-02)
    The problem of augmenting a given network, or graph, via edge-additions for improved reachability from a given source node is considered. We formulate and study the following Single Source Reachability Improvement problem ...
  • On special-purpose hardware clusters for high-performance computational grids 
    Abu-Khzam, Faisal N.; Lehrter, Jeanne M.; Bouldin, Donald W.; Langston, Micheal A.; Peterson, Gregory D. (2017-03-22)
    Lehrter, J. M., Abu-Khzam, F. N., Bouldin, D. W., Langston, M. A., & Peterson, G. D. (2002, November). On Special-purpose Hardware Clusters for High-performance Computational Grids. In IASTED PDCS (pp. 1-5).
  • On the complexity of bilinear computations 
    Takche, Jean Halim (Pennsylvania State University, 2018-04-17)
    Arithmetic complexity theory is the study of the minimum number of non-scalar multiplications required to compute a set of bilinear forms. One can show that we can restrict ourselves to bilinear algorithms. Brockett and ...
  • On the complexity of multi-parameterized cluster editing 
    Abu-Khzam, Faisal (2018-04-23)
    The Cluster Editing problem seeks a transformation of a given undirected graph into a disjoint union of cliques via a minimum number of edge additions or deletions. A multi-parameterized version of the problem is studied, ...
  • On the complexity of QoS-Aware service selection problem 
    Abu-Khzam, Faisal N.; Bazgan, Cristina; El Haddad, Joyce; Sikora, Florian (Springer, 2017-03-16)
    This paper addresses the QoS-aware service selection problem considering complex workflow patterns. More specifically, it focuses on the complexity issues of the problem. The NPNP-hardness of the problem, under various ...
  • On the complexity of various parameterizations of common induced subgraph isomorphism 
    Abu-Khzam, Faisal N.; Bonnet, Edouard; Sikora, Florian (Springer, 2017-03-16)
    Maximum Common Induced Subgraph (henceforth MCIS) is among the most studied classical NPNP -hard problems. MCIS remains NPNP -hard on many graph classes including bipartite graphs, planar graphs and k-trees. Little is ...
  • On the Computations of Gas-Solid Mixture Two-Phase Flow 
    Touma, R.; Zeidan, D. (2016-04-07)
    This paper presents high-resolution computations of a two-phase gas-solid mixture using a well-defined mathematical model. The HLL Riemann solver is applied to solve the Riemann problem for the model equations. This ...
  • "On the Death of my Dear Friend Nada Adib Haddad" 
    Aghacy, Samira (2016-11-14)
    She's dead, dead, and all the city, her city, weeps for her.
  • On the Detection of Passive Malicious Providers in Cloud Federations 
    Hammoud, Ahmad; Otrok, Hadi; Mourad, Azzam; Abdel Wahab, Omar; Bentahar, Jamal (2021-04-15)
    Cloud federation has emerged as a new business architecture which aims to help cloud providers cope with the increased waves of demands on their resources and services. Although plenty of solutions have been proposed trying ...
  • On the disk dimension of planar graphs 
    Abu-khzam, Faisal (2018-04-26)
    The disk dimension problem was introduced by Fellows and Langston in 1987. The disk dimension of a graph, G, is the least k for which G embeds in the plane minus k open disks, with every vertex of G on a boundary of one ...
  • On the effects of user ratings on the profitability of cloud services 
    Taghavi, Mona; Bentahar, Jamal; Otrok, Hadi; Abdel Wahab, Omar; Mourad, Azzam (IEEE Xplore, 2018-08-14)
    In todays cloud market, providers are taking advantage of consumer reviews and ratings as a new marketing tool to establish their credibility. However, to achieve higher ratings, they need to enhance their service quality ...
  • On the Issue of Oil. (c2017) 
    El-Chammas, Diana (Lebanese American University, 2018-03-06)
    Tensions between Lebanon and Israel have lately been on the rise due to the two countries’ opposing proposals for the delineation of their respective Exclusive Economic Zones (EEZ), and the resulting overlapping maritime ...
  • On the parameterized complexity of dynamic problems 
    Abu-Khzam, Faisal N.; Egan, Judith; Fellows, Michael R.; Rosamond, Frances A.; Shaw, Peter (2016-11-08)
    In a dynamic version of a (base) problem X it is assumed that some solution to an instance of X is no longer feasible due to changes made to the original instance, and it is required that a new feasible solution be obtained ...

Search LAUR


Advanced Search

Browse

My Account