International Telemetering Conference Proceedings / October 17-20, 1994 / Town & Country Hotel and Conference Center, San Diego, California / In order to meet the high-speed and high-density recording requirements for today's development and testing environments, we are seeking to merge the cutting edge technologies of tiny, high-performance disk drives and field programmable gate arrays (FPGAs) to build a high-speed compact disk recorder (CHSDR). Specifically, we designed, built, and tested a multi-drive controller that handles the interleaving of data to eight inexpensive IDE drives. These drives and controller comprise a "cell" capable of transferring data at 2.45 MB/sec (4 to 5 times the rate of a single drive). Furthermore, these "cells" can be run in parallel (with a single controller interleaving data between the cells). This "tree" effect multiplies the data rate by the number of cells employed. For example, 8 cells (of 8 drives each) can reach nearly 20 MB/second (sustained) and can be built for less than $30,000. The drives we used are the size of match boxes (the Hewlett Packard KittyHawk). These tiny drives hold 42 megabytes each and can withstand 150 Gs while operating. The cell controller is a Xilinx 4005 FPGA. Furthermore, we've designed a 120 MB/sec RAM FIFO to buffer data entering the system (to account for unavoidable drive seek latencies). In short, the compact high-speed disk array is a small, relatively low cost recording solution for anyone requiring high data speed but modest data volume. Missile shots, nuclear tests, and other short-term experiments are good examples of such requirements.

ITC/USA 2011 Conference Proceedings / The Forty-Seventh Annual International Telemetering Conference and Technical Exhibition / October 24-27, 2011 / Bally's Las Vegas, Las Vegas, Nevada / The higher bandwidth capacities available with the adoption of Ethernet technology for networked FTI data acquisition systems enable more data to be acquired. However, this puts increased demands on the network recorder to be able to support such data rates. During any given flight, the network recorder may log hundreds of GigaBytes of data, which must be processed and analyzed in real-time or in post-flight. This paper describes several approaches that may be adopted to facilitate data-on-demand data mining and data reduction operations. In particular, the use of filtering and indexing techniques that may be adopted to address this challenge are described.

<p>Regular inference is a research direction in machine learning. The goal of regular inference is to construct a representation of a regular language in the form of deterministic finite automaton (DFA) based on the set of positive and negative examples. DFAs take strings of symbols (words) as input, and produce a binary classification as output, indicating whether the word belongs to the language or not. There are two types of learning algorithms for DFAs: passive and active learning algorithms. In passive learning, the set of positive and negative examples is given and not chosen by inference algorithm. In contrast, in active learning, the learning algorithm chooses examples from which a model is constructed.</p><p>Active learning was introduced in 1987 by Dana Angluin. She presented the L* algorithm for learning DFAs by asking membership and equivalence queries to a teacher who knows the regular language accepted by DFA to be learned. A membership query checks whether a word belongs to the language or not. An equivalence query checks whether a hypothesized model is equivalent to the DFA to be learned.The L* algorithm has been found to be useful in different areas, including black box checking, compositional verification and integration testing. There are also other algorithms similar to L* for regular inference. However, the learning of timed systems has not been studied before. This thesis presents algorithms for learning timed systems in an active learning framework.</p><p>As a model of timed system we choose event-recording automata (ERAs), a determinizable subclass of the widely used timed automata. The advantages of ERA in comparison with timed automata, is that it is known priori the set of clocks of an ERA and when clocks are reset. The contribution of this thesis is four algorithms for learning deterministic event-recording automaton (DERA). Two algorithms learn a subclass of DERA, called event-deterministic ERA (EDERA) and two algorithms learn general DERA.</p><p>The problem with DERAs that they do not have canonical form. Therefore we focus on subclass of DERAs that have canonical representation, EDERA, and apply the L* algorithm to learn EDERAs. The L* algorithm in timed setting requires a procedure that learns clock guards of DERAs. This approach constructs EDERAs which are exponentially bigger than automaton to be learned. Another procedure can be used to lean smaller EDERAs, but it requires to solve NP-hard problem.</p><p>We also use the L* algorithm to learn general DERA. One drawback of this approach that inferred DERAs have a form of region graph and there is blow-up in the number of transitions. Therefore we introduce an algorithm for learning DERA which uses a new data structure for organising results of queries, called a timed decision tree, and avoids region graph construction. Theoretically this algorithm can construct bigger DERA than the L* algorithm, but in the average case we expect better performance.</p>

Multi-track run-length-limited (d,k) modulation codes were recently introduced as a method to increase storage densities in magnetic and optical recording systems. These codes are a generalization of the usual run-length-limited (d,k) codes and provide for increased storage density by relaxing the k-constraint and encoding multiple tracks in parallel. This dissertation focuses on methods of constructing such codes. Two methods are presented. The first uses state-splitting to construct multi-track (d,k) trellis codes. An example is presented in which a (1,3) trellis code is constructed having a code rate of R = 2/3. The second method results in the construction of multi-track (d,k) block codes which are implemented via an enumeration scheme based on the trellis description of the (d,k) constraints. This implementation results in memory requirements which increase only linearly with block length as opposed to the exponential increases arising from look-up table implementations. Additionally, a new class of multi-track codes referred to as redundant multi-track (d,k) codes, is introduced. These redundant codes, unlike the original multi-track (d,k) codes which are completely intolerant of faulty tracks, allow for r faulty tracks while maintaining synchronization.

Low-density parity check (LDPC) codes have experienced tremendous popularity due to their capacity-achieving performance. In this dissertation, several different aspects of LDPC coding and its applications to magnetic storage are investigated. One of the most significant issues that impedes the use of LDPC codes in many systems is the error-rate floor phenomenon associated with their iterative decoders. By delineating the fundamental principles, we extend to partial response channels algorithms for predicting the error rate performance in the floor region for the binary-input AWGN channel. We develop three classes of decoding algorithms for mitigating the error floor by directly tackling the cause of the problem: trapping sets. In our experiments, these algorithms provide multiple orders of improvement over conventional decoders at the cost of various implementation complexity increases.Product codes are widely used in magnetic recording systems where errors are both isolated and bursty. A dual-mode decoding technique for Reed-Solomon-code-based product codes is proposed, where the second decoding mode involves maximum-likelihood erasure decoding of the binary images of the Reed-Solomon codewords. By exploring a tape storage application, we demonstrate that this dual-mode decoding system dramatically improves the performance of product codes. Moreover, the complexity added by the second decoding mode is manageable. We also show the performance of this technique on a product code which has an LDPC code in the columns.Run-length-limited (RLL) codes are ubiquitous in today's disk drives. Using RLL codes has enabled drive designers to pack data very efficiently onto the platter surface by ensuring stable symbol-timing recovery. We consider a concatenation system design with an LDPC code and an RLL code as components to simultaneously achieve desirable features such as: soft information availability to the LDPC decoder, the preservation of the LDPC code's structure, and the capability of correcting long erasure bursts.We analyze the performance of LDPC-coded magnetic recording channel in the presence of media noise. We employ advanced signal processing for the pattern-dependent-noise-predictive channel detectors, and demonstrate that a gain of over 1 dB or a linear density gain of about 8% relative to a comparable Reed-Solomon is attainable by using an LDPC code.

The marketing and distribution of pre-recorded music for sale and public consumption is a cultural development as profound as any in the twentieth-century musical world. It is especially relevant to late-1950s American rock and roll, in terms of the music's capture in the rapidly-evolving environment of the recording studio, its release into the marketplace via independent record labels, and its enthusiastic embrace by the burgeoning youth culture of the era. Within this multi-dimensional context, Zoom Records, a tiny, independent record label, was born in Tucson, Arizona. A unique convergence of technological, artistic, and commercial developments and historical events gives special import to the Zoom Records story, as a lesson in entrepreneurship, artistic expression and personal transformation.

Antidepressants are generally believed to exert their clinical efficacy by enhancing 5-HT transmission. Interestingly, sustained administration of selective serotonin (5-HT) reuptake inhibitors (SSRIs) strongly suppresses in the first few days the firing activity of 5-HT neurons in the dorsal raphe nucleus (DRN), thereby severely hampering the increase of 5-HT in target regions. Remarkably, the firing activity of 5-HT neurons gradually recovers over the time course of treatment and this recovery is believed to be accounted for by the desensitization of 5-HT1A somatodendritic autoreceptors. Here, we sought to investigate whether additional mechanisms might contribute to the dynamic regulation of excitability of 5-HT neurons during the course of SSRI treatments. Borrowing from the well-described homeostatic strengthening of glutamatergic synapses onto cortical pyramidal neurons following prolonged periods of inactivity, we hypothesized that a similar homeostatic-like regulation of synaptic strength might be operant on 5-HT cells during an SSRI treatment. To test this possibility, we used whole-cell electrophysiological recordings on acute midbrain slices to monitor glutamatergic synapses onto 5-HT neurons. We found that a two-day treatment with the SSRI citalopram induced a robust reduction in both the amplitude and frequency of AMPAR-mediated mEPSCs. We also show that this depression in synaptic strength, induced by an SSRI, is transient since excitatory drive onto 5-HT neurons was enhanced by 7 days of treatments. Altogether, these results document a dynamic regulation of glutamatergic synaptic transmission during the time course of a prolonged treatment with an SSRI. Further elucidation of the cellular and molecular mechanisms driving this synaptic plasticity might identify novel pharmacological target to shorten the delay of antidepressant action.

Shingled Magnetic Recording (SMR) has been recognised as one of the alternative technologies to achieve an areal density beyond the limit of the perpendicular recording technique, 1 Tb/in2, which has an advantage of extending the use of the conventional method media and read/write head. This work presents SMR system subject to both Inter Symbol Interference (ISI) and Inter Track Interference (ITI) and investigates different equalisation/detection techniques in order to reduce the complexity of this system. To investigate the ITI in shingled systems, one-track one-head system model has been extended into two-track one-head system model to have two interfering tracks. Consequently, six novel decoding techniques have been applied to the new system in order to find the Maximum Likelihood (ML) sequence. The decoding complexity of the six techniques has been investigated and then measured. The results show that the complexity is reduced by more than three times with 0.5 dB loss in performance. To measure this complexity practically, perpendicular recording system has been implemented in hardware. Hardware architectures are designed for that system with successful Quartus II fitter which are: Perpendicular Magnetic Recording (PMR) channel, digital filter equaliser with and without Additive White Gaussian Noise (AWGN) and ideal channel architectures. Two different hardware designs are implemented for Viterbi Algorithm (VA), however, Quartus II fitter for both of them was unsuccessful. It is found that, Simulink/Digital Signal Processing (DSP) Builder based designs are not efficient for complex algorithms and the eligible solution for such designs is writing Hardware Description Language (HDL) codes for those algorithms.

International Telemetering Conference Proceedings / October 30-November 02, 1995 / Riviera Hotel, Las Vegas, Nevada / The Telemetry Data Distribution System (TDDS) solves the need to record, archive, and distribute sounding rocket and satellite data on a compact, user-friendly medium, such as CD-Recordable discs. The TDDS also archives telemetry data on floppy disks, nine-track tapes, and magneto-optical disc cartridges. The PC-based, semi-automated, TDDS digitizes, time stamps, formats, and archives frequency modulated (FM) or pulse code modulated (PCM) telemetry data. An analog tape or a real-time signal may provide the telemetry data source. The TDDS accepts IRIG A, B, G, H, and NASA 36 analog code sources for time stamp data. The output time tag includes time, frame, and subframe status information. Telemetry data may be time stamped based upon a user-specified number of frames, subframes, or words. Once recorded, the TDDS performs data quality testing, formatting, and validation and logs the results automatically. Telemetry data is quality checked to ensure a good analog source track was selected. Raw telemetry data is formatted by dividing the data into records and appending header information. The formatted telemetry data is validated by checking consecutive time tags and subframe identification counter values (if applicable) to identify data drop-outs. After validation, the TDDS archives the formatted data to any of the following media types: CD-Recordable (CD-R) Disc (650 megabytes capacity); nine track tape (180 megabytes capacity); and erasable optical disc (499 megabytes capacity). Additionally, previously archived science data may be re-formatted and archived to a different output media.

Transient receptor potential vanilloid 2 channel (TRPV2) is a Ca2+-permeable ion channel that is highly expressed in leukocytes but is also present in skeletal and cardiac muscle and endocrine cells. The TRPV2 function is implicated in a number of physiological processes, including bacterial phagocytosis, pro-inflammatory cytokine production, cardiac hypertrophy, and cancer development. TRPV2 knockout mice exhibit a high incidence of perinatal mortality, arguing that the channel plays essential roles in physiology. Despite the importance of TRPV2 for normal homeostasis, the mechanisms that control TRPV2 gating in response to pharmacological agonists, heating, membrane stretch, bioactive lipids and reactive oxygen species (ROS) remain poorly understood. Here we demonstrate that TRPV2 is functionally expressed in microglia (i.e., ‘brain macrophages’) and the microglia-like BV-2 cell line, and demonstrate that the gating of an endogenous TRPV2-like conductance is positively modulated by the bacterial toxin lipopolysaccharide (LPS), which is known to cause pro-inflammatory (M1) activation and increase ROS production by NADPH oxidase. To determine how TRPV2 gating is modulated by ROS, we recorded single channel activity in inside-out patches excised from HEK-293 cells expressing GFP-rTRPV2. Unitary currents elicited by the TRPV2 agonist 2-aminophenyl borinate (2-APB) or cannabidiol (CBD) are linear in monovalent recording solutions and give rise to an estimated unitary conductance of ~100pS, which is similar to TRPV1 but significantly smaller than TRPV3. Intriguingly, we find that although TRPV2 is insensitive to ROS (in the form of exogenously applied H2O2) alone, apparent open probability is synergistically enhanced when H2O2 is applied together with CBD. We identify two intracellular Cys residues that are necessary for TRPV2 responses to H2O2 sensitivity and find that these residues are located close to one another, albeit in different subunits, in the TRPV2 structure, suggesting that ROS promote the formation of an inter-subunit disulfide bond that alters sensitivity to pharmacological agonists. We hypothesize that ROS-dependent modulation of TRPV2 activity may be an important contributor to pro-inflammatory activation of microglia underline central nervous system diseases and that TRPV2 antagonism could be a useful therapeutic strategy in the treatment of neuroinflammation.