• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 228
  • 78
  • 38
  • 24
  • 20
  • 18
  • 10
  • 6
  • 6
  • 5
  • 4
  • 4
  • 2
  • 2
  • 1
  • Tagged with
  • 544
  • 77
  • 65
  • 64
  • 60
  • 59
  • 51
  • 51
  • 48
  • 47
  • 42
  • 39
  • 37
  • 37
  • 36
  • 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.
191

Application Adaptive Bandwidth Management Using Real-Time Network Monitoring.

Grover, Amit 01 August 2003 (has links)
Application adaptive bandwidth management is a strategy for ensuring secure and reliable network operation in the presence of undesirable applications competing for a network’s crucial bandwidth, covert channels of communication via non-standard traffic on well-known ports, and coordinated Denial of Service attacks. The study undertaken here explored the classification, analysis and management of the network traffic on the basis of ports and protocols used, type of applications, traffic direction and flow rates on the East Tennessee State University’s campus-wide network. Bandwidth measurements over a nine-month period indicated bandwidth abuse of less than 0.0001% of total network bandwidth. The conclusion suggests the use of the defense-in-depth approach in conjunction with the KHYATI (Knowledge, Host hardening, Yauld monitoring, Analysis, Tools and Implementation) paradigm to ensure effective information assurance.
192

Kernel Density Estimation of Reliability With Applications to Extreme Value Distribution

Miladinovic, Branko 16 October 2008 (has links)
In the present study, we investigate kernel density estimation (KDE) and its application to the Gumbel probability distribution. We introduce the basic concepts of reliability analysis and estimation in ordinary and Bayesian settings. The robustness of top three kernels used in KDE with respect to three different optimal bandwidths is presented. The parametric, Bayesian, and empirical Bayes estimates of the reliability, failure rate, and cumulative failure rate functions under the Gumbel failure model are derived and compared with the kernel density estimates. We also introduce the concept of target time subject to obtaining a specified reliability. A comparison of the Bayes estimates of the Gumbel reliability function under six different priors, including kernel density prior, is performed. A comparison of the maximum likelihood (ML) and Bayes estimates of the target time under desired reliability using the Jeffrey's non-informative prior and square error loss function is studied. In order to determine which of the two different loss functions provides a better estimate of the location parameter for the Gumbel probability distribution, we study the performance of four criteria, including the non-parametric kernel density criterion. Finally, we apply both KDE and the Gumbel probability distribution in modeling the annual extreme stream flow of the Hillsborough River, FL. We use the jackknife procedure to improve ML parameter estimates. We model quantile and return period functions both parametrically and using KDE, and show that KDE provides a better fit in the tails.
193

Importance of high frequency audibility on speech recognition with and without visual cues in listeners with normal hearing

Silberer, Amanda Beth 01 January 2014 (has links)
Purpose: To study the impact of visual cues, speech materials and age on the frequency bandwidth necessary for optimizing speech recognition performance in listeners with normal hearing. Method: Speech recognition abilities of adults and children with normal hearing were assessed using three speech perception tests that were low-pass (LP) filtered and presented in quiet and noise. The speech materials included the Multimodal Lexical Sentence Test (MLST) that was presented in auditory-only and auditory-visual modalities for the purpose of determining the listener's visual benefit. In addition, The University of Western Ontario Plurals Test (UWO) assessed listeners' ability to detect high frequency acoustic information (e.g., /s/ and /z/) in isolated words and The Maryland CNC test that assessed speech recognition performance using isolated single words. Speech recognition performance was calculated as percent correct and was compared across groups (children and adults), tests (MLST, UWO, and CNC) and conditions (quiet and noise). Results: Statistical analyses revealed a number of significant findings. The effect of visual cues was significant in adults and children. The type of speech material had significant impact on the frequency bandwidth required for adults and children to optimize speech recognition performance. The children required significantly more bandwidth to optimize performance than adults across speech perception tests and conditions of quiet and noise. Adults and children required significantly more bandwidth in noise than in quiet across speech perception tests. Conclusion: The results suggest that children and adults require significantly less bandwidth for optimizing speech recognition performance when assessed using sentence materials which provide visual cues. Children, however, showed less benefit from visual cues in the noise condition than adults. The amount of bandwidth required by both groups decreased as a function of the speech material. In other words, the more ecologically valid the speech material (e.g., sentences with visual cues versus single isolated words), the less bandwidth was required for optimizing performance. In all, the optimal bandwidth (except for the noise condition of the UWO test) is achievable with current amplification schemes.
194

Performance Evaluation of TCP over Optical Channels and Heterogeneous Networks

Xu, Jianxuan 30 March 2004 (has links)
Next generation optical networks will soon provide users the capability to request and obtain end-to-end all optical 10 Gbps channels on demand. Individual users will use these channels to exchange large amounts of data and support applications for scientific collaborative work. These new applications, which expect steady transfer rates in the order of Gbps, will very likely use either TCP or a new transport layer protocol as the end-to-end communication protocol. This thesis investigates the performance of TCP and newer TCP versions over High Bandwidth Delay Product Channels (HBDPC), such as the on demand optical channels described above. In addition, it investigates the performance of these new TCP versions over wireless networks and according to old issues such as fairness. This is particularly important to make adoption decisions. Using simulations, it is shown that 1) the window-based mechanism of current TCP implementations is not suitable to achieve high link utilization and 2) congestion control mechanisms, such as the one utilized by TCP Vegas and Westwood are more appropriate and provide better performance. Modifications to TCP Vegas and Scalable TCP are introduced to improve the performance of these versions over HBDPC. In addition, simulation results show that new TCP proposals for HBDPC, although they perform better than current TCP versions, still perform worse than TCP Vegas. Also, it was found that even though these newer versions improve TCP's performance over their original counterparts in HBDPC, they still have performance problems in wireless networks and present worse fairness problems than their old counterparts. The main conclusion of this thesis is that all these versions are still based on TCP's AIMD strategy or similar and therefore continue to be fairly blind in the way they increase and decrease their transmission rates. TCP will not be able to utilize the foreseen optical infrastructure adequately and support future applications if not redesigned to scale.
195

Equalisation for carrierless amplitude and phase modulation

Gao, Jason January 2002 (has links)
Carrierless amplitude and phase (CAP) modulation is generally regarded as a bandwidth efficient two-dimensional (2-D) passband line code. It is closely related to the pulse amplitude modulation (PAM) and quadrature amplitude modulation (QAM) schemes. CAP has been proposed for various digital subscriber loop (DSL) systems over unshielded twisted pairs of copper wires. In this thesis, our main focus is on the minimum mean-square error (MMSE) performance of the ideal (i.e., infinite length) linear and non-linear (decision feedback) CAP receivers/equalisers in the presence of additive, coloured Gaussian noise, and/or data-like cross-talks. An in-depth analysis is given on the performance of both receiver structures. In the case of the linear receiver, one possible view of the overall CAP transceiver system which includes both data and cross-talk transmission paths is that it is a linear multiple-input multiple-output (MIMO) system. Accordingly, the existing MMSE results for a general MIMO system are applicable also to CAP systems. However, up to date, this approach was shown to be unsuccessful in the sense that the derived MMSE expressions are too complex and offer little insights. In our analysis, in order to find a more incisive MMSE expression, we reconsider the problem of minimisation of the MSEs at slicers. By exploiting the Hilbert transform pair relationship between the impulse responses of the inphase and quadrature transmit shaping filters, we are able to obtain an elegant and more meaningful MMSE expression, as well as the corresponding transfer functions of the optimum linear receive filters. In the case of the nonlinear, or decision feedback equaliser (DFE), receiver, we start our analysis with the receiver structure of a generic multidimensional (>/= 3) CAP-type system. / This receiver consists of a bank of analog receive filters, the number of which equals the dimension of the CAP line code, and a matrix of cross-connected, infinite-length, baud-spaced feedback filters. It is shown that the optimum filters and the corresponding MMSE of the DFE receiver require the factorisation of a discrete-time channel spectral matrix. This mathematically intractable step can be avoided, however, when the DFE results are specialised to a standard 2-D CAP system where we are able to again exploit the Hilbert transform pair relationship to derive a further and more useful MMSE expression. Three sets of numerical studies are given on the MMSE performance of the CAP receivers. In the first set of studies. we model the sum of all crosstalks as an additive, Gaussian noise source and select three test transmission channels over which we compare the MMSE performance of the linear and DFE receiver structures. In the second set of studies, we compare the performance of the two receiver structures, but in a data-like cross-talk environment. The results demonstrate the importance of NEXT equalisation in the design of CAP receivers operating in a NEXT dominant environment. In the final set of studies which follows from the second set of studies, we investigate the relationship between the MMSE performance of the DFE receiver and system parameters which include excess bandwidth, data rate, CAP scheme. and relative phase between the received signal and the NEXT signal. The results show that data-like cross-talks can be effectively suppressed by using a large excess bandwidth (alpha > 1 in the case of a RC transmit shaping filter) alone. / The relative phase also affect; the receiver performance. but to a lesser degree. In addition to the MMSE performance analysis. implementation issues of an adaptive linear CAP receiver are also considered. We propose a novel linear receiver by appending two fixed analog filters to the front-end of the existing adaptive linear receiver using fractionally-spaced equalisers (FSE). We show that if the analog filters are matched to the transmit shaping filters, then inphase and quadrature finite-length FSEs in the proposed receiver have the same NINISE solution. We further propose a modified least-mean-square (LMS) algorithm which takes advantage of this feature. The convergence analysis of the proposed LMS algorithm is also given. We show that the modified LMS algorithm converges approximately twice as fast as the standard LMS algorithm, given the same misadjustment, or alternatively, it halves the misadjustment, given the same initial convergence rate.
196

Asynchronous transfer mode security

Shankaran, Rajan, University of Western Sydney, School of Computing and Information Technology January 1999 (has links)
There is a growing interest in the development of broadband services and networks for commercial use in both local area and wide area networks. The primary reasons for this is a pressing need to meet the demand for increased bandwidth for remote sites interconnection, and in high speed data transfer of bulk data such as images etc. There has also been a significant change in the characteristics of network traffic. It is increasingly taking the form of bursty traffic characterized by an unpredictable demand for bandwidth of several megabytes. A new generation of networking technologies have emerged to meet the demand of growing and uncertain bandwidth requirements. One such technology is called Asynchronous Transfer Mode (ATM) for use on broadband networks under the banner of broadband ISDN. ATM enables interconnection at high speeds in the range of Mbit/s or Gbit/s over wide areas, which effectively moves the bottleneck from networks to end systems. Furthermore, the user is able to access bandwidth on demand and the user is only charged for the bandwidth actually used. As more and more information (audio, image and data) is transferred over ATM networks, security issues are becoming increasingly critical. The rapidly growing use of the Internet to transfer confidential and sensitive information only enhances the importance of security services. One may even argue that the success of ATM will be determined not by its cost effectiveness but also to the level of trust that can be placed on its performance, security and availability. The objective of this dissertation is to address the issues involved in the design of security services for ATM networks. / Master of Science (Hons)
197

Investigation of silicon PIN-detector for laser pulse detection

Chau, Sam January 2004 (has links)
<p>This report has been written at SAAB Bofors Dynamics (SBD) AB in Gothenburg at the department of optronic systems.</p><p>In military observation operations, a target to hit is chosen by illumination of a laser designator. From the targetpoint laser radiation is reflected on a detector that helps identify the target. The detector is a semiconductor PIN-type that has been investigated in a laboratory environment together with a specially designed laser source. The detector is a photodiode and using purchased components, circuits for both the photodiode and the laserdiode has been designed and fabricated. The bandwidth of the op-amp should be about 30 MHz, in the experiments a bandwidth of 42 MHz was used. Initially the feedback network, which consists of a 5.6 pF capacitor in parallel with a 1-kohm resistor determined the bandwidth. To avoid the op-amp saturate under strong illuminated laser radiation the feedback network will use a 56-pF capacitor and a 100-ohm resistor respectively.</p><p>The laser should be pulsed with 10-20 ns width, 10 Hz repetition frequency, about 800 nm wavelength and a maximum output power of 80 mW. To avoid electrical reflection signals at measurement equipment connections, the laser circuit includes a resistor of about 50 ohm, that together with the resistance in the laserdiode forms the right termination that eliminate the reflection signals. The wire-wound type of resistor shall be avoided in this application and instead a surface mounted type was beneficial with much lower inductance. The detector showed a linear behaviour up to 40-mW optical power. Further investigation was hindered by the breakdown of the laserdiodes. The function generator limits the tests to achieve 80 mW in light power. In different experiments the responsivity of the photodiode is different from the nominal value, however it would have required more time to investigate the causes.</p>
198

Utility-based Optimisation of Resource Allocation for Wireless Networks

Curescu, Calin January 2005 (has links)
<p>From providing only voice communications, wireless networks aim to provide a wide range of services in which soft real-time, high priority critical data, and best effort connections seamlessly integrate. Some of these applications and services have firm resource requirements in order to function properly (e.g. videoconferences), others are flexible enough to adapt to whatever is available (e.g. FTP). Providing differentiation and resource assurance is often referred to as providing quality of service (QoS). In this thesis we study how novel resource allocation algorithms can improve the offered QoS of dynamic, unpredictable, and resource constrained distributed systems, such as a wireless network, during periods of overload.</p><p>We propose and evaluate several bandwidth allocation schemes in the context of cellular, hybrid and pure ad hoc networks. Acceptable quality levels for a connection are specified using resource-utility functions, and our allocation aims to maximise accumulated systemwide utility. To keep allocation optimal in this changing environment, we need to periodically reallocate resources. The novelty of our approach is that we have augmented the utility function model by identifying and classifying the way reallocations affect the utility of different application classes. We modify the initial utility functions at runtime, such that connections become comparable regardless of their flexibility to reallocations or age-related importance.</p><p>Another contribution is a combined utility/price-based bandwidth allocation and routing scheme for ad hoc networks. First we cast the problem of utility maximisation in a linear programming form. Then we propose a novel distributed allocation algorithm, where every flow bids for resources on the end-to-end path depending on the resource ``shadow price'', and the flow's ``utility efficiency''. Our periodic (re)allocation algorithms represent an iterative process that both adapts to changes in the network, and recalculates and improves the estimation of resource shadow prices.</p><p>Finally, problems connected to allocation optimisation, such as modelling non-critical resources as costs, or using feedback to adapt to uncertainties in resource usage and availability, are addressed.</p>
199

A digital multiplying delay locked loop for high frequency clock generation

Uttarwar, Tushar 21 November 2011 (has links)
As Moore���s Law continues to give rise to ever shrinking channel lengths, circuits are becoming more digital and ever increasingly faster. Generating high frequency clocks in such scaled processes is becoming a tough challenge. Digital phase locked loops (DPLLs) are being explored as an alternative to conventional analog PLLs but suffer from issues such as low bandwidth and higher quantization noise. A digital multiplying delay locked loop (DMDLL) is proposed which aims at leveraging the benefit of high bandwidth of DLL while at the same time achieving the frequency multiplication property of PLL. It also offers the benefits of easier portability across process and occupies lesser area. The proposed DMDLL uses a simple flip-flop as 1-bit TDC (Time Digital Converter) for Phase Detector (PD). A digital accumulator acts as integrator for loop filter while a ��-�� DAC in combination with a VCO acts like a DCO. A carefully designed select logic in conjunction with a MUX achieves frequency multiplication. The proposed digital MDLL is taped out in 130nm process and tested to obtain 1.4GHz output frequency with 1.6ps RMS jitter, 17ps peak-to-peak jitter and -50dbC/Hz reference spurs. / Graduation date: 2012
200

Design Aspects of Fully Integrated Multiband Multistandard Front-End Receivers

Adiseno, January 2003 (has links)
In this thesis, design aspects of fully integrated multibandmultistandard front-end receivers are investigated based onthree fundamental aspects: noise, linearity and operatingfrequency. System level studies were carried out to investigatethe effects of different modulation techniques, duplexing andmultiple access methods on the noise, linearity and selectivityperformance of the circuit. Based on these studies and thelow-cost consideration, zero-IF, low-IF and wideband-IFreceiver architectures are promising architectures. These havea common circuit topology in a direct connection between theLNA and the mixer, which has been explored in this work toimprove the overall RF-to-IF linearity. One front-end circuitapproach is used to achieve a low-cost solution, leading to anew multiband multistandard front-end receiver architecture.This architecture needs a circuit whose performance isadaptable due to different requirements specified in differentstandards, works across several RF-bands and uses a minimumamount ofexternal components. Five new circuit topologies suitable for a front-endreceiver consisting of an LNA and mixer (low-noise converter orLNC) were developed. A dual-loop wide-band feedback techniquewas applied in all circuits investigated in this thesis. Threeof the circuits were implemented in 0.18 mm RF-CMOS and 25 GHzbipolar technologies. Measurement results of the circuitsconfirmed the correctness of the design approach. The circuits were measured in several RF-bands, i.e. in the900 MHz, 1.8 GHz and 2.4 GHz bands, with S11 ranging from–9.2 dB to–17 dB. The circuits have a typicalperformance of 18-20 dB RF-to-IF gain, 3.5-4 dB DSB NF and upto +4.5 dBm IIP3. In addition, the circuit performance can beadjusted by varying the circuit’s first-stage biascurrent. The circuits may work at frequencies higher than 3GHz, as only 1.5 dB of attenuation is found at 3 GHz and nopeaking is noticed. In the CMOS circuit, the extrapolated gainat 5 GHz is about 15 dB which is consistent with the simulationresult. The die-area of each of the circuits is less than 1mm2.

Page generated in 0.0403 seconds