.

Browsing SoAS - Scholarly Publications by Title

LAUR Repository

Browsing SoAS - Scholarly Publications by Title

Sort by: Order: Results:

  • Mattar, L.; Bachand, M.-P.; Hebuterne, X.; Cano, N.; Schneider, S.M. (2017-11-29)
  • Abou Ghaida, Alissar (Lebanese American University, 2022-05-14)
    Rice is one of the most consumed staple foods around the world. A. Circumdati, A. Nigri, P. verrucosum, and P. nordicum can contaminate rice in subtropical and tropical hot and humid climates, which leads to mycotoxins ...
  • Unknown author (2018-07-30)
  • Saad, Walid; Dawy, Zaher; Sharafeddine, Sanaa (IEEE, 2018-07-04)
    Wireless cellular networks are required to meet the stringent QoS requirements of emerging data services. To efficiently utilize the available radio resources, we propose a new resource allocation algorithm for services ...
  • El-Khatib, Nader; Goatin, Paola; Rosini, Massimiliano D. (2017-01-10)
    We consider a generalized version of Hughes’ macroscopic model for crowd motion in the one-dimensional case. It consists in a scalar conservation law accounting for the conservation of the number of pedestrians, coupled ...
  • 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. ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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).
  • 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 ...
  • 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, ...
  • 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 ...
  • 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 ...
  • 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 ...
  • Aghacy, Samira (2016-11-14)
    She's dead, dead, and all the city, her city, weeps for her.
  • 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 ...
  • 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 ...

Search LAUR


Advanced Search

Browse

My Account