Institutional Repository

Browsing Theses and Dissertations by Issue Date

Browsing Theses and Dissertations by Issue Date

Sort by: Order: Results:

  • Abou-Jaoude, Abdo Milad (Notre Dame University-Louaize, 1998-05)
  • 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 ...
  • 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 ...
  • Balian, Armen A. (Notre Dame University-Louaize, 1999)
    In this thesis, automatic segmentation of liver veins from ultrasound slices is implemented and further rendered into 3D image to assist the medical doctor to more accurately apply any study intended on the liver. The main part of this study is the texture analysis since it is the hardest problem in common. As a start, 4 different techniques in texture analysis have been introduced, the Spatial Gray-level Dependence Matrices (SGLDM), The Fourier Power Spectrum (FPS), The Gray- Level Difference Statistics (GLD), and Law's Texture Energy Measure (TEM). Each of these methods have been discussed ...
  • 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], ...
  • Al-Halaby, Ramzi R. (Notre Dame University-Louaize., 1999-06)
  • 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 ...
  • Kamouh, Walid A. (Notre Dame University-Louaize., 2000-07)
    The internet is once again suffering from its own success. Since 1995, there has been a massive increase in demand for internet services, resulting in an exponential growth of the Internet. We have entered now an era where the users of the Internet are unable to obtain the bandwidth needed to support their applications, and they are experiencing high packet loss. Packet loss problem arises whenever the number of packets arriving at a given router is much higher than its buffering space. The main goal of this thesis is to find adaptive schemes capable of optimizing the communication network ...
  • Yazbeck, Khalil Nazih (Notre Dame University-Louaize, 2001)
    This thesis deals with the communication network performance of the Automatic Vehicle Location (AVL) distributed database system. The Automatic Vehicle Location system is used to real-time track the movement of vehicles, traveling along a large geographical area. The full control of the movement of these vehicles requires the use of many communication systems such as Global Positioning system, Packet switching network and distributed database systems including vehicle position databases. The main goal of this thesis is to minimize the update response time in a real-time fully replicated distributed ...
  • El Daccache, Walid (Notre Dame University-Louaize, 2001)
    The World Wide Web is considered by far to be a simple and universal standard for exchanging information. This information that started to be manually composed and human readable, needed to grow more to reach dynamic composition and machine readability. Static web documents starved for a light breeze to release it from data and presentation mixture and lift it to a higher level of data representation and organization. XML "the extensible markup language'' as a standard of data representation on the web offered flexibility and simplicity in representing self describing electronic documents. This ...
  • 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 ...
  • Ghanem, Pascale Y. (Notre Dame University-Louaize, 2001)
    The global Internet has experienced many years of sustained exponential growth doubling in size every nine months or faster [8]. Millions of users at tens of thousands of sites around the world depend on the global Internet as part of their daily work environment. This massive use of the Internet as well as the continuous interconnection of new groups arises many problems such as: packet loss, network congestion, insufficient bandwidth, increase in delay... In this thesis, we focus mainly on the problem of communication delay and bandwidth allocation. Our main goal is to find a way to minimize ...
  • 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.
  • 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 ...
  • Samia, Mireille I. (Notre Dame University-Louaize, 2001-06)
    Internet Multicast service extends the Internet point-to-point unicast delivery to a multi-point delivery. Multicasting means that a datagram is sent to multiple sites at more or less the same time. To support real-time multimedia, the minimization of delay without loosing the reliability of the network is required. To achieve this goal, we have proposed to change the architecture of a multicast one-stage network to a multicast hierarchical two-stage network. We have proved that by giving additional functionalities (such as back-up and error correction) to the intermediate sites (i.e. mrouters) ...
  • Mouawad, Maurice T. (Notre Dame University-Louaize, 2001-06)
    The web is a vast source of information. However, due to the divisiveness and unlikeness of web pages' contents, this information is covered in the chaotic structure of the World Wide Web. At the same time, with the spread of web access, search engines are being, if not the sole utility, one of the most mechanisms used by the increasing number of users, to find interesting information. We are interested in identifying how pieces of information represented by URL pages, sharing common topics, are related as they are represented on the web. One such problem is studying patterns of occurrences of ...
  • Mansour, Emile N. (Notre Dame University-Louaize, 2002)
    Mobility attracts many developers and system designers; it will give us the ability to use our computers with no physical limitations with respect to connections. This thesis will try to introduce the main concepts that define mobile computing in our days. It will identify the challenges that face mobile computing and their impact on current developments in this area. Location management and how the cellular networks function is defined and described. We will conduct a comparison between protocols in location management with respect to network messages and database operations. In the IS-41 model ...
  • Jurascovitch, Elie M. (Notre Dame University-Louaize, 2002)
    The purpose of this thesis is to study distributed applications in the context of heterogeneous clients (Web browser, mobile) and business-to-business (B2B) integration. Two distributed architectures, leaders of the distributed applications market are presented and compared: Microsoft's .NET, and Sun's Java Enterprise Java Beans (J2EE). After this comparative study, we chose .NET to develop an e- commerce application (Jurasco Style electronic shop) in order to outline the major application architectural issues and solutions offered by .NET technology. Our study also shows how the .NET Jurasco ...
  • Aad, Elie (Notre Dame University-Louaize, 2002)
    Mining association rules has been an important topic in data mining research in recent years from the standpoint of supporting human-centered discovery of knowledge. The present day model of mining association rules suffers from the following shortcomings: (i) lack of user exploration and control, (ii) lack of focus, (iii) huge number of rules technically unreadable. All data mining researchers, have given a high importance on developing fast algorithms for rules discovery, and have applied different types of constraints in different algorithms to prune item sets, that do not occur frequently ...

Search DSpace


Advanced Search

Browse

My Account