• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1963
  • 183
  • 182
  • 147
  • 36
  • 25
  • 25
  • 25
  • 25
  • 25
  • 24
  • 16
  • 11
  • 9
  • 7
  • Tagged with
  • 2877
  • 2877
  • 750
  • 637
  • 506
  • 499
  • 393
  • 336
  • 314
  • 300
  • 299
  • 289
  • 288
  • 277
  • 276
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
631

Objects for interprocess communication

Mujumdar, Swati January 1994 (has links)
A new approach is presented for object based interprocess communication in this study. UNIX is a conventional operating system, and this study presents a new approach for representing processes as objects.Object based programming at the system level is discussed. The thesis presents motivation for supporting and implementing process objects with UNIX system calls, message passing and shared memory. Interprocess communication can be simulated using objects to represent processes.Related work in the area of system supported objects in conventional operating systems is also presented. / Department of Computer Science
632

The price of anarchy and a priority-based model of routing /

Olver, Neil. January 2006 (has links)
The price of anarchy, a concept introduced by Koutsoupias and Papadimitriou [9], is the main topic of this thesis. It is a measure of the loss of efficiency that occurs when there is no central control over a system consisting of many "selfish" agents. We will be particularly interested in this in the context of network games, which can be used to model congestion in traffic and communication networks. / After an introduction of the relevant concepts and review of related work, we proceed with the new results of this thesis. We provide a new upper bound for the price of anarchy in the case of atomic unsplittable agents with polynomial cost functions, and demonstrate that it is tight by an explicit construction. We then introduce a new model for network routing that introduces priorities; users with a higher priority on a link will be able to traverse the link more quickly. Our model is fairly general, and allows various different priority schemes for modelling different situations. One particularly interesting version, which we have dubbed the timestamp game, assigns priorities according to the order of arrival at the start of the link. / We derive tight upper bounds for the price of anarchy in our model in the case of polynomial cost functions and nonatomic agents. We also obtain tight results in the unsplittable case with linear cost functions, and an upper bound with polynomial cost functions. / While we concentrate on network games, most of the results carry through to the more general class of congestion games, which we also discuss.
633

L'espace transnational et la localité : le réseautage et la sédimentation du passage

Roberge, Claire. January 2007 (has links)
Conceptualizing the locality today in the global context means to be able to consider a level of denationalisation of the actor (of a locality) participating in a networked situation with actors from other localities. This thesis introduces a new conceptualization of the locality participating in a transnational network. The network, CEARENAD, involved six localities (Brazil, Chili, Costa-Rica, Senegal, Mauritius and Canada) who co-constructed contents for five years. This research is about presenting not a "mode d'emploi" about whether this particular network was successful or not. What truly motivated me, during and about this research, was to reflect on my observations of this network to build a new conceptualisation about the intertwinments of a locality and another space. This is what this thesis is about. "La sedimentation du passage" renders a rigorous description of the numerous processes which bring the locality to the front line. / This study shows the description (Latour: 1987, 1999) of the participative actions of the actors involved in the network. The sedimentation of the passage reveals the repercussions of the mediations between the localities. This theorization activates, in other ways, the denationalization of actors, and, adds to the cultural construct of the network as well as to the possibilities of the Politic (Sassen: 2006). / This is an example of a networked knowledge production while, at the same time, and this may be of most importance, it is also an example of how today's reading of the locality deepens the necessity of participative actions in the mediations and mediatizations (Darbellay: 2006) of materialities in the contemporary globalization. The sedimentation of the passage allows one to read what circulation(s) are actually chosen to be materialized in and for the locality.
634

Time-slotted scheduling for agile all-photonics networks : performance and complexity

Bilbeisi, Hana. January 2007 (has links)
Schedulers in optical switches are still electronic, the performance of these units has a significant impact on the performance of the network and could form a bottleneck in high speed networks, such as AAPN. Four time-slotted scheduling algorithms are investigated in this study, PIM, iSlip, PHM and Adapted-SRA. The study addresses the performance of AAPN for each of the algorithms, and evaluates the hardware complexity, estimating the running time of the algorithms. Performance measures were collected from an OPNET model, designed to emulate AAPN. Furthermore, hardware complexity and timing constraints were evaluated through hardware simulations, for iSlip, and through analysis for the rest of the algorithms. iSlip confirmed its feasibility by meeting the 10us timing constraint set by AAPN. The study revealed the superiority of iSlip and PHM over PIM and Adapted-SRA.
635

On the choice of packet size in computer communication networks

Evequoz, Claude. January 1986 (has links)
No description available.
636

Efficient placement schemes to fully utilize peer upstream bandwidth

Zeng, Hui min January 2006 (has links)
Thesis (M.S.)--University of Hawaii at Manoa, 2006. / Includes bibliographical references (leaves 61-63). / ix, 63 leaves, bound ill. 29 cm
637

Resource Discovery and Fair Intelligent Admission Control over Scalable Internet

January 2004 (has links)
The Internet currently supports a best-effort connectivity service. There has been an increasing demand for the Internet to support Quality of Service (QoS) to satisfy stringent service requirements from many emerging networking applications and yet to utilize the network resources efficiently. However, it has been found that even with augmented QoS architecture, the Internet cannot achieve the desired QoS and furthermore, there are concerns about the scalability of any available QoS solutions. If the network is not provisioned adequately, the Internet is not capable to handle congestion condition. This is because the Internet is unaware of its internal network QoS states therefore it is not possible to provide QoS when the network state changes dynamically. This thesis addresses the following question: Is it possible to deliver the applications with QoS in the Internet fairly and efficiently while keeping scalability? In this dissertation we answer this question affirmatively by proposing an innovative service architecture: the Resource Discovery (RD) and Fair Intelligent Admission Control (FIAC) over scalable Internet. The main contributions of this dissertation are as follows: 1. To detect the network QoS state, we propose the Resource Discovery (RD) framework to provide network QoS state dynamically. The Resource Discovery (RD) adopts feedback loop mechanism to collect the network QoS state and reports to the Fair Intelligent Admission Control module, so that FIAC is capable to take resource control efficiently and fairly. 2. To facilitate network resource management and flow admission control, two scalable Fair Intelligent Admission Control architectures are designed and analyzed on two levels: per-class level and per-flow level. Per-class FIAC handles the aggregate admission control for certain pre-defined aggregate. Per-flow FIAC handles the flow admission control in terms of fairness within the class. 3. To further improve its scalability, the Edge-Aware Resource Discovery and Fair Intelligent Admission Control is proposed which does not need the core routers involvement. We devise and analyze implementation of the proposed solutions and demonstrate the effectiveness of the approach. For the Resource Discovery, two closed-loop feedback solutions are designed and investigated. The first one is a core-aware solution which is based on the direct QoS state information. To further improve its scalability, the edge-aware solution is designed where only the edges (not core)are involved in the feedback QoS state estimation. For admission control, FIAC module bridges the gap between 'external' traffic requirements and the 'internal' network ability. By utilizing the QoS state information from RD, FIAC intelligently allocate resources via per-class admission control and per-flow fairness control. We study the performance and robustness of RD-FIAC through extensive simulations. Our results show that RD can obtain the internal network QoS state and FIAC can adjust resource allocation efficiently and fairly.
638

Developing and implementing a user-centred intranet organisational culture, communication and knowledge management

Thorn, Warwick Unknown Date (has links)
The research recorded in this thesis tells the story of developing and implementing a user-centred intranet in the organisation where I work in a senior management position. My management support of the process led to adopting a networked model in our organisation, and also to my embracing the role of communications management.The organisation in which I work has a high rate of change and an entrepreneurial culture which is sometimes chaotic. This challenging environment was a good testing ground for the project, which sought to explore a number of propositions affirming the value of user-centred intranets.Developing and implementing the intranet encouraged collaboration amongst staff members. The intranet became a new channel of communication, which usefully enhanced the staff's ability to share and find out what was going on, who did what and how to contact them. My interventions as a manager, which occurred in parallel with the technological development of the intranet, led to spin-off organisational improvements such as an improved collaborative reporting system, the restructuring of the organisation manual files, and the establishment of a collaboratively-focussed full monthly staff meeting. Developing and implementing a user-centred intranet was a dynamic way to effect change in the organisation and orient it towards a networked organisational model, one which is communication rich, both collaborative and participative.The project was driven by my belief that a user-centred emphasis in intranet design is necessary in today's knowledge-based global economy, where there is a high rate of change. The networked organisational model should be embraced as a flexible model catering for change by promoting organic and dynamic networking within an organisation. This environment is communication-rich and collaborative, and a user-centred intranet is a communication channel well suited to support this model.A user-centred intranet should not be seen merely as an organisational artefact, but also as the a process of developing and implementing it will open up an organisation's culture, communication, and knowledge management in a participatory way. However, the degree that this will be achieved depends on a number of factors. For instance, the leaders of an organisation need to embrace a networked organisational model, encouraging and resourcing communication management for a culture of participation and collaboration.
639

Scalable and robust stream processing

Shkapenyuk, Vladislav. January 2007 (has links)
Thesis (Ph. D.)--Rutgers University, 2007. / "Graduate Program in Computer Science." Includes bibliographical references (p. 156-165).
640

Digital receipts : a system to detect the compromise of digital certificates /

Seeley, Nathaniel January 2006 (has links) (PDF)
Thesis (M.S.)--Brigham Young University. Dept. of Computer Science, 2006. / Includes bibliographical references (p. 55-57).

Page generated in 0.0556 seconds