361 |
Protocol conversion : an algorithmic approachRajagopal, Murali 08 1900 (has links)
No description available.
|
362 |
Advanced infrared local area networksOzugur, Timucin 08 1900 (has links)
No description available.
|
363 |
Switch scheduling in the Multimedia Router (MMR)Paul, Indrani 05 1900 (has links)
No description available.
|
364 |
Echo cancellation via neural networksBulot, Jean-Paul 08 1900 (has links)
No description available.
|
365 |
Design and analysis of fault-tolerant pipelined multicomputer networksGaughan, Patrick T. 05 1900 (has links)
No description available.
|
366 |
Impression management in computer-mediated communication : an exploratory qualitative analysisBecker, Jennifer A. January 1999 (has links)
This study investigates the phenomenon of impression management in computer-mediated communication (CMC), particularly chat rooms. Past research has overlooked the occurrence of this phenomenon; however, connections can be drawn from the body of research on impression management in face-to-face communication as well as the body of research on CMC. Indeed, impression management is an integral part of chat room interaction.A screening survey was administered to 382 college students to identify those students who interacted in chat rooms regularly and admitted to engaging in impression management and misrepresenting their identities. Ten such students were interviewed. Their accounts were recorded, transcribed, and analyzed using the grounded theory methodology. The analysis revealed that a set of antecedent conditions influence the phenomenon of impression management, which is managed by two action/interactional strategies and results in an outcome. / Department of Speech Communication
|
367 |
A comparison of file allocation decision-making schemesMaldonado, Martin Froilan 08 1900 (has links)
No description available.
|
368 |
Performance modelling of replication protocolsMisra, Manoj January 1997 (has links)
This thesis is concerned with the performance modelling of data replication protocols. Data replication is used to provide fault tolerance and to improve the performance of a distributed system. Replication not only needs extra storage but also has an extra cost associated with it when performing an update. It is not always clear which algorithm will give best performance in a given scenario, how many copies should be maintained or where these copies should be located to yield the best performance. The consistency requirements also change with application. One has to choose these parameters to maximize reliability and speed and minimize cost. A study showing the effect of change in different parameters on the performance of these protocols would be helpful in making these decisions. With the use of data replication techniques in wide-area systems where hundreds or even thousands of sites may be involved, it has become important to evaluate the performance of the schemes maintaining copies of data. This thesis evaluates the performance of replication protocols that provide differ- ent levels of data consistency ranging from strong to weak consistency. The protocols that try to integrate strong and weak consistency are also examined. Queueing theory techniques are used to evaluate the performance of these protocols. The performance measures of interest are the response times of read and write jobs. These times are evaluated both when replicas are reliable and when they are subject to random breakdowns and repairs.
|
369 |
Minimum cost design of centralized teleprocessing networks using Canadian common carrier facilitiesElias, Demetrius Z. January 1978 (has links)
No description available.
|
370 |
On buffer allocation in transport protocolsZissopoulos, Athanassios January 1987 (has links)
No description available.
|
Page generated in 0.0681 seconds