Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1981. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING. / Vita. / Bibliography: leaves 83-86. / by Moses Hsingwen Ma. / M.S.

by Tsang Yick Man, Steven. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1997. / Includes bibliographical references (leaves 94-99). / ABSTRACT --- p.i / ACKNOWLEDGMENT --- p.ii / LIST OF GLOSSARY --- p.iii / Chapter 1 --- INTRODUCTION --- p.1 / Chapter 1.1 --- What is the jitter ？ --- p.3 / Chapter 2 --- WHY DOES JITTER OCCUR IN DIGITAL AUDIO ？ --- p.4 / Chapter 2.1 --- Poorly-designed Phase Locked Loop ( PLL ) --- p.4 / Chapter 2.1.1 --- Digital data problem --- p.7 / Chapter 2.2 --- Sampling jitter or clock jitter ( Δti) --- p.9 / Chapter 2.3 --- Waveform distortion --- p.12 / Chapter 2.4 --- Logic induced jitter --- p.17 / Chapter 2.4.1 --- Digital noise mechanisms --- p.20 / Chapter 2.4.2 --- Different types of D-type flop-flip chips are linked below for ease of comparison --- p.21 / Chapter 2.4.3 --- Ground bounce --- p.22 / Chapter 2.5 --- Power supply high frequency noise --- p.23 / Chapter 2.6 --- Interface Jitter --- p.25 / Chapter 2.7 --- Cross-talk --- p.28 / Chapter 2.8 --- Inter-Symbol-Interference (ISI) --- p.28 / Chapter 2.9 --- Baseline wander --- p.29 / Chapter 2.10 --- Noise jitter --- p.30 / Chapter 2.11 --- FIFO jitter reduction chips --- p.31 / Chapter 3 --- JITTER REDUCTION TECHNIQUES --- p.33 / Chapter 3.1 --- Why using two-stage phase-locked loop (PLL ) ？ / Chapter 3.1.1 --- The PLL circuit components --- p.35 / Chapter 3.1.2 --- The PLL timing specifications --- p.36 / Chapter 3.2 --- Analog phase-locked loop (APLL ) circuit usedin second stage --- p.38 / Chapter 3.3 --- All digital phase-locked loop (ADPLL ) circuit used in second stage --- p.40 / Chapter 3.4 --- ADPLL design --- p.42 / Chapter 3.4.1 --- "Different of K counter value of ADPLL are listed for comparison with M=512, N=256, Kd=2" --- p.46 / Chapter 3.4.2 --- Computer simulated results and experimental results of the ADPLL --- p.47 / Chapter 3.4.3 --- PLL design notes --- p.58 / Chapter 3.5 --- Different of the all digital Phase-Locked Loop (ADPLL ) and the analogue Phase-Locked Loop (APLL ) are listed for comparison --- p.65 / Chapter 3.6 --- Discrete transistor oscillator --- p.68 / Chapter 3.7 --- Discrete transistor oscillator circuit operation --- p.69 / Chapter 3.8 --- The advantage and disadvantage of using external discrete oscillator --- p.71 / Chapter 3.9 --- Background of using high-precision oscillators --- p.72 / Chapter 3.9.1 --- The temperature compensated crystal circuit operation --- p.73 / Chapter 3.9.2 --- The temperature compensated circuit design notes --- p.75 / Chapter 3.10 --- The discrete voltage reference circuit operation --- p.76 / Chapter 3.10.1 --- Comparing the different types of Op-amps that can be used as a voltage comparator --- p.79 / Chapter 3.10.2 --- Precaution of separate CMOS chips Vdd and Vcc --- p.80 / Chapter 3.11 --- Board level jitter reduction method --- p.81 / Chapter 3.12 --- Digital audio interface chips --- p.82 / Chapter 3.12.1 --- Different brand of the digital interface receiver (DIR) chips and clock modular are listed for comparison --- p.84 / Chapter 4. --- APPLICATION CIRCUIT BLOCK DIAGRAMS OF JITTER REDUCTION AND CLOCK RECOVERY --- p.85 / Chapter 5 --- CONCLUSIONS --- p.90 / Chapter 5.1 --- Summary of the research --- p.90 / Chapter 5.2 --- Suggestions for further development --- p.92 / Chapter 5.3 --- Instrument listing that used in this thesis --- p.93 / Chapter 6 --- REFERENCES --- p.94 / Chapter 7 --- APPENDICES --- p.100 / Chapter 7.1.1 --- Phase instability in frequency dividers / Chapter 7.1.2 --- The effect of clock tree on Tskew on ASIC chip / Chapter 7.1.3 --- Digital audio transmission----Why jitter is important? / Chapter 7.1.4 --- Overview of digital audio interface data structures / Chapter 7.1.5 --- Typical frequency Vs temperature variations curve of Quartz crystals / Chapter 7.2 --- IC specification used in these research project

Este trabalho apresenta um novo algoritmo, denominado Intercalamento Temporal por Transformada de Fourier (FTI), desenvolvido para complementar sistemas de modulação digital. Com este processo, a informação é distribuida de forma difusa ao longo de um conjunto de símbolos, tanto no domínio do tempo como no da frequência. Constitui-se em um processo computacionalmente eficiente, especialmente adequado para operar em conjunto com a modulação OFDM, e que apresenta consideráveis ganhos de desempenho em algumas situações de degradação; por exemplo, é mais tolerante a ruídos impulsivos de longa duração do que a modulação OFDM convencional. Apresenta-se também um outro mecanismo, denominado de Realimentação de Erro, que melhora o desempenho do sistema em praticamente todas as situaçoes analisadas. Embora implique em aumento da carga computacional, este processo consiste de uma operação determinística, que dispensa etapas de iteração ou recursos computacionais distintos dos já disponíveis. Neste trabalho foi avaliada a utilização destas técnicas em um sistema OFDM com características similares ao sistema ISDB-T, adequado para radiodifusão de TV Digital . / This work introduces a new transform-based time interleaving algorithm: FTI-OFDM (Fourier Transform Interleaved OFDM), in which binary information is spread over several symbols, both in time and frequency domains. This process, designed to be included in digital modulation systems, is computationally efficient when used in conjunction with OFDM modulation. Simulations are used to show its superiority over the usual binary time interleaving used in ordinary OFDM under several impairment scenarios, that include long impulsive noise and deep fading. Also introduced in this work is the additional method of decision error feedback (ERF), that enhances the performance of FTI-OFDM in almost all situations. Furthermore, ERF is deterministic and non-iterative and employs the same computational resources found in OFDM systems. The performance of an FTI-OFDM system, similar to ISDB-T standard, is evaluated under several impairments, such as are found in Digital TV broadcasting environment.

Cryptography is the art of protecting information by encrypting the original message into an unreadable format. A cryptographic hash function is a hash function which takes an arbitrary length of the text message as input and converts that text into a fixed length of encrypted characters which is infeasible to invert. The values returned by the hash function are called as the message digest or simply hash values. Because of its versatility, hash functions are used in many applications such as message authentication, digital signatures, and password hashing [Thomsen and Knudsen, 2005]. The purpose of this study is to apply Huffman data compression algorithm to the SHA-1 hash function in cryptography. Huffman data compression algorithm is an optimal compression or prefix algorithm where the frequencies of the letters are used to compress the data [Huffman, 1952]. An integrated approach is applied to achieve new compressed hash function by integrating Huffman compressed codes in the core functionality of hashing computation of the original hash function.

Campus networks have recently experienced a proliferation of devices ranging from personal use devices (e.g. smartphones, laptops, tablets), to special-purpose network equipment (e.g. firewalls, network address translation boxes, network caches, load balancers, virtual private network servers, and authentication servers), as well as special-purpose systems (badge readers, IP phones, cameras, location trackers, etc.). To establish directives and regulations regarding the ways in which these heterogeneous systems are allowed to interact with each other and the network infrastructure, organizations typically appoint policy writing committees (PWCs) to create acceptable use policy (AUP) documents describing the rules and behavioral guidelines that all campus network interactions must abide by. While users are the audience for AUP documents produced by an organization's PWC, network administrators are the responsible party enforcing the contents of such policies using low-level CLI instructions and configuration files that are typically difficult to understand and are almost impossible to show that they do, in fact, enforce the AUPs. In other words, mapping the contents of imprecise unstructured sentences into technical configurations is a challenging task that relies on the interpretation and expertise of the network operator carrying out the policy enforcement. Moreover, there are multiple places where policy enforcement can take place. For example, policies governing servers (e.g., web, mail, and file servers) are often encoded into the server's configuration files. However, from a security perspective, conflating policy enforcement with server configuration is a dangerous practice because minor server misconfigurations could open up avenues for security exploits. On the other hand, policies that are enforced in the network tend to rarely change over time and are often based on one-size-fits-all policies that can severely limit the fast-paced dynamics of emerging research workflows found in campus networks. This dissertation addresses the above problems by leveraging recent advances in Software-Defined Networking (SDN) to support systems that enable novel in-network approaches developed to support an organization's network security policies. Namely, we introduce PoLanCO, a human-readable yet technically-precise policy language that serves as a middle-ground between the imprecise statements found in AUPs and the technical low-level mechanisms used to implement them. Real-world examples show that PoLanCO is capable of implementing a wide range of policies found in campus networks. In addition, we also present the concept of Network Security Caps, an enforcement layer that separates server/device functionality from policy enforcement. A Network Security Cap intercepts packets coming from, and going to, servers and ensures policy compliance before allowing network devices to process packets using the traditional forwarding mechanisms. Lastly, we propose the on-demand security exceptions model to cope with the dynamics of emerging research workflows that are not suited for a one-size-fits-all security approach. In the proposed model, network users and providers establish trust relationships that can be used to temporarily bypass the policy compliance checks applied to general-purpose traffic -- typically by network appliances that perform Deep Packet Inspection, thereby creating network bottlenecks. We describe the components of a prototype exception system as well as experiments showing that through short-lived exceptions researchers can realize significant improvements for their special-purpose traffic.

Most systems in HPC make use of hierarchical designs that allow multiple levels of parallelism to be exploited by programmers. The use of multiple multi-core/multi-processor computers to form a computer cluster supports both fine-grain and large-grain parallel computation. Aggregate function communications provide an easy to use and efficient set of mechanisms for communicating and coordinating between processing elements, but the model originally targeted only fine grain parallel hardware. This work shows that a hierarchical implementation of aggregate functions is a viable alternative to MPI (the standard Message Passing Interface library) for programming clusters that provide both fine grain and large grain execution. Performance of a prototype implementation is evaluated and compared to that of MPI.

To get the best prices, sweet cherry growers must supply blemish-free fruit. Unfortunately, mature cherries have a fragile composition, rendering them susceptible to damage from heat, wind, birds, and rain. Rain is particularly devastating, because cherries split when they absorb too much water. Since rainstorms are common in the otherwise arid regions where most cherries are grown, growers must have a system for quickly deploying rain removal methods. The current industry solution relies on human observation and implementation, which is error-prone and costly. This project proposes an automated cherry wetness system using a Decagon Devices leaf wetness sensor (LWS) and a wireless sensor network (WSN). The research consists of analyzing industry and literature for uses of WSNs and LWSs in orchards and testing a LWS in a prototype WSN. The system will be evaluated for its potential to provide a precision-agriculture solution to the problem of remote cherry wetness detection.

In recent years, mobile devices have played a significant role in daily life. As a result, Mobile Applications have become very popular. An increasing number of people are using mobile applications to handle an increasing number of personal tasks, as well as for amusement. To date, there are thousands of mobile applications available for a variety of purposes. However, there are very few specifically designed for local church use. Mobile applications are potentially more convenient and easier to operate than normal website for parishioners. Designing and implementing a mobile application for Crest Community Church, in Riverside, based on Android Developer Tools (ADT) and Android Software Development Kit (Android SDK) is this project’s primary objective. The objective of this project is to provide a communications platform where members of Crest Community Church can share news, discuss coming church events, promote and enhance the connectivity of this worship community, and provide mobile access to information not available on their present systems. A distinct feature of this project allows for communication between mobile application and webserver by creating a HTTP URL Connection. As a result, church members can publish news and events in a discussion forum as well as a dialog with other church members in a near real time format. The Crest users can also indicate that posted prayer request has been prayed for. In addition, this new application displays general church information, and provides the address and driving direction for potential visitors. Church members can also check the church’s calendar of events, special meetings and information about the Passion Center for Children ministry. This project has the ability to store and track pertinent information about each user, the content of all discussions, and retains member’s key contact data. This project successfully implemented a church mobile application. It demonstrated that a tailored mobile application can enhance the sense of community via internet for this congregation. It feather shows that mobile applications can greatly assist churches in community with members as well as visitors. The application also expanded the internet footprint of Crest Community Church, and offers other churches an avenue to improve their connectivity for the future.

The main aim of the project is to launch multiple processes and have those processes communicate with each other using peer to peer communication to eliminate the problems of multiple processes running on a single server, and multiple processes running on inhomogeneous servers as well as the problems of scalability. This entire process is done using MPICH which is a high performance and portable implementation of Message Passing Interface standard. The project involves setting up the passwordless authentication between two local servers with the help of SSH connection. By establishing a peer to peer communication and by using a unique shell script which is written using MPICH and its derivatives, I am going to demonstrate the process of inter-process communication between the servers.

Aim: To evaluate the ability of a publicly available facial recognition application program interface (API) to calculate similarity scores for pre- and post-surgical photographs of patients undergoing orthognathic surgeries. Our primary objective was to identify which surgical procedure(s) had the greatest effect(s) on similarity score. Methods: Standard treatment progress photographs for 25 retrospectively identified, orthodontic-orthognathic patients were analyzed using the API to calculate similarity scores between the pre- and post-surgical photographs. Photographs from two pre-surgical timepoints were compared as controls. Both relaxed and smiling photographs were included in the study to assess for the added impact of facial pose on similarity score. Surgical procedure(s) performed on each patient, gender, age at time of surgery, and ethnicity were recorded for statistical analysis. Nonparametric Kruskal-Wallis Rank Sum Tests were performed to univariately analyze the relationship between each categorical patient characteristic and each recognition score. Multiple comparison Wilcoxon Rank Sum Tests were performed on the subsequent statistically significant characteristics. P-Values were adjusted for using the Bonferroni correction technique. Results: Patients that had surgery on both jaws had a lower median similarity score, when comparing relaxed expressions before and after surgery, compared to those that had surgery only on the mandible (p = 0.014). It was also found that patients receiving LeFort and bilateral sagittal split osteotomies (BSSO) surgeries had a lower median similarity score compared to those that received only BSSO (p = 0.009). For the score comparing relaxed expressions before surgery versus smiling expressions after surgery, patients receiving two-jaw surgeries had lower scores than those that had surgery on only the mandible (p = 0.028). Patients that received LeFort and BSSO surgeries were also found to have lower similarity scores compared to patients that received only BSSO when comparing pre-surgical relaxed photographs to post-surgical smiling photographs (p = 0.036). Conclusions: Two-jaw surgeries were associated with a statistically significant decrease in similarity score when compared to one-jaw procedures. Pose was also found to be a factor influencing similarity scores, especially when comparing pre-surgical relaxed photographs to post-surgical smiling photographs.