Institutional Repository

Browsing Theses and Dissertations by Author "Chedid, Fouad, Ph.D."

Browsing Theses and Dissertations by Author "Chedid, Fouad, Ph.D."

Sort by: Order: Results:

  • Shammas, Shady J. (Notre Dame University-Louaize, 1999)
    Over the last few years, LAN technologies have been driven by the need to support an increasing number of users as well as bandwidth intensive applications. As new and existing network applications evolve to embrace high-resolution graphics, video and other rich media types, pressure is growing at the desktop, the server, the hub and the switch for increased bandwidth. All this has led to new network protocols needed to support the amount of information required. In this thesis, we will briefly review conventional networking protocols and internetworking devices. Then we present a table comparing ...
  • Maroun, Bashir M. (Notre Dame University-Louaize, 2001)
    This thesis uses the link structure of the World Wide Web as a basis to create better search engines. It focuses on the HITS algorithm, which was the first algorithm to up the link topology. HITS is implemented with slight modifications and tested with variations of its input parameters. It is also used in order to discover emerging communities in cyberspace. Other related algorithms, which use the link structure of the web as an undirected graph are described and compared with HITS. Finally, an attempt to combine link-based with text-based analysis in order to create more accurate search methods ...
  • Wakim, Tony H. (Notre Dame University-Louaize, 2000)
    Geographic Information Systems (GIS) have gone a great way since it has started as a science. GIS is making headlines in a number of disciplines and, through its advancement, has improved our ability to model our real world. In the past years the need to support the storage and retrieval of dynamic changes, which occur to our data, has increased which consequently led to the interest in spatio-temporal behavior in GIS. These years have also seen the birth of several spatio-temporal data Models, whose aim is to support this spatio-temporal behavior. The main aim behind Spatio-Temporal support is ...
  • Ibrahim, Rita Jack (Notre Dame University-Louaize, 2000-06)
    In this thesis, we investigate the use of neural networks for solving the Traveling Salesman Problem (TSP). First, we review the main elements of the theory of NP-completeness. Then, we explain what makes some problems computationally intractable. We review some heuristic approaches used to provide near-optimal solutions to NP-complete problems. Then, we introduce the topic of neural networks and describe some of the most popular neural network models. We pay a special attention to a recent model, named the Hybrid Neural Network model (HNN), used for solving optimization problems and the Hybrid ...
  • Abdel Massih, Hisham (Notre Dame University-Louaize, 2000)
    Recent research in Geographic Information Systems (GISs) has created the kind of systems capable of modeling a number of interesting real world phenomena. Some applications where GISs have made significant contribution include routing, scheduling, dispatching, transportation logistics, vehicle tracking, market research, construction Planning, facility management and resource distribution. However, there seems to exist little connection between GIS solutions and much related research being carried out in other disciplines. This thesis studies the advantages of integrating recent research in ...
  • Boutros, Rania A. (Notre Dame University-Louaize, 1999)
    A well known problem with wormhole-routed packet networks is the potentially large amount of blocking that packets can experience due to link contention. Because of the very limited amount of buffering in such networks, blocked packets remain in the network and keep using network resources. Thus, blocked packets may in turn cause other packets to be blocked. This may affect a large number of packets over a large portion of the network. Proper connection management strategies and appropriate protocols must be devised to ensure that blocking of packets due to link contention is bounded. In [3], ...
  • Karam, Rita (Notre Dame University-Louaize, 2002)
    This thesis discusses Artificial Economy with applications to Reinforcement Learning. It focuses first on Reinforcement Learning, comparing it to other types of learning such as Supervised Learning. It then covers a historical overview of the field and summarizes the current works. The work described in this thesis has a psychological approach as we focus on reward and punishment. We experiment Artificial Economy with a prototype which solves the Blocks World problem. We then show how the Artificial Economy approach can be integrated with other concepts of Reinforcement Learning techniques.
  • Karaa, George Emile (Notre Dame University-Louaize, 2001)
    This thesis addresses the problem of analysis the Web hyperlink structure in order to locate authoritative web pages relevant to a certain query subject. In particular, we discuss the HITS algorithm, a pioneering method that exploits the web link structure in order to locate important information sources, as well as other algorithms based on HITS such as ARC and Page Rank. We experiment with different aspects of HITS, and introduce new heuristics for assigning the link weights based on textual contexts.
  • Soueidy, Amine (Notre Dame University-Louaize, 2001)
    This thesis discusses the topic of learning in a complex environment. Both the historical basis of the field and a broad selection of the current works are summarized. Reinforcement learning is the problem faced by an agent that learns behavior through trial-and-error interactions with a dynamic environment. The work described here has a resemblance to work in psychology, but considerably in the details and in the use of the word "reinforcement". We describe the foundations of new field of reinforcement learning named artificial economy. We experiment with a prototype based on the artificial ...
  • Mina, Jean G. (Notre Dame University-Louaize, 1998-07)
    The allocation problem is known to be NP-Hard in the most general case where both the number of modules and the number of processors is arbitrary, and it is also Np-Complete in some of the restricted cases. Also, the general scheduling problem, where no restrictions are imposed on the interconnection structure between modules, on the modules processing time and on the number of parallel processors, is NP-Hard in the strong sense. Even under some restrictions, the scheduling problem is NP-Hard. In some other restricted cases, it is known to be NP-Complete. In this thesis, we first review fifty ...
  • Mouawad, Pauline (Notre Dame University-Louaize, 2004)
    This thesis is motivated by the latest work related to differential compression algorithms as it appears in the work of Ajtai, et al. - 2002. In particular, we pay special attention to delta encoding algorithms that achieve got compression in linear time and constant space. This is important because previous work in this area uses either quadratic time and constant space or linear time and linear space, which is unacceptable for large inputs. In delta encoding, the algorithm reads two different copies of the same file as input, termed the reference copy and the version copy. The output of the ...
  • Akl, Imad M. (Notre Dame University-Louaize, 2002-06)
    This thesis uses the HITS algorithm as a basis to propose an interactive internet search engine. With the Web becoming a major source of information for many users, it became a necessity to be able to search the Web efficiently. The main problem resides with broad topic queries. These are queries for which a typical text-based search engine like AltaVista would return thousands of pages. A remedy for these situations was proposed by Kleinberg in his 1-IITS algorithm in which he uses the hyperlink structure of the Web as a major source of information about the contents of the Web. In this thesis, ...

Search DSpace


Advanced Search

Browse

My Account