| A Bioinformatic Approach to Inter Functional Interactions within Protein Sequences |
23-Feb-2009 |
50 pages |
| Authors:
Geoffrey I Webb; James C Whisstock; MONASH UNIV CLAYTON (AUSTRALIA)
|
 | The primary purpose of the current project was to evaluate the techniques they had developed to infer functional interactions between the sites within a protein and, if appropriate, refine them in the light of the results of evaluation. The initial results revealed significant limitations of their preliminary approaches. As a result of this project, it is now apparent that deep understanding of the significance of co-evolution between sites within a ... |
|
| Information Order Effects: Examining The Effect of Sequencing and Complexity in a Long Information Series |
01-Jun-2007 |
29 pages |
| Authors:
Ilean Keltz; Len Adelman; GEORGE MASON UNIV FAIRFAX VA
|
| As operators become dependent on systems for decision support, their decisions may be susceptible to order effects which may result in over-weighting of prior or recent information. The question this research seeks to answer is: Does the theory of anchoring & adjusting on average accurately predict the results of a long series of sequentially presented information when complexity and sequencing are manipulated? |
|
| Effective Optimization Algorithms for Fragment-Assembly Based Protein Structure Prediction |
27 MAR 2006 |
11 pages |
| Authors:
Kevin W. DeRonne; George Karypis; MINNESOTA UNIV MINNEAPOLIS DEPT OF COMPUTER SCIENCE
|
| Despite recent developments in protein structure prediction, an accurate new fold prediction algorithm remains elusive. One of the challenges facing current techniques is the size and complexity of the space containing possible structures for a query sequence. Traditionally, to explore this space fragment assembly approaches to new fold prediction have used stochastic optimization techniques. Here we examine deterministic algorithms for optimizing scoring functions in protein structure prediction. Two previously unused ... |
|
| Incremental Window-based Protein Sequence Alignment Algorithms |
23 MAR 2006 |
10 pages |
| Authors:
Huzefa Rangwala; George Karypis; MINNESOTA UNIV MINNEAPOLIS DEPT OF COMPUTER SCIENCE
|
| MOTIVATION: Protein sequence alignment plays a critical role in computational biology as it is an integral part in many analysis tasks designed to solve problems in comparative genomics, structure and function prediction, and homology modeling. METHODS: We have developed novel sequence alignment algorithms that compute the alignment between a pair of sequences based on short fixed- or variable-length high-scoring subsequences. Our algorithms build the alignments by repeatedly selecting the highest ... |
|
| Microarray-Based Resequencing of Multiple B. anthracis Isolates |
01 OCT 2005 |
21 pages |
| Authors:
Michael E. Zwick; NAVAL MEDICAL RESEARCH CENTER BETHESDA MD
|
| How can we detect and identify BW agents? (1) Genotype markers known to show variation: Fixed species specific variants, previously identified - Rapid detection of a small number of sites - Example: Real-time PCR (confirmatory Lab); (2) DNA sequence regions/genomes of interest: Maximally informative (The sequence is the genotype!) - Detects common and rare variants - Strain identification/origin (Definitive Lab); (3) The future detection and identification of BW agents will ... |
|
| Cloning and Characterization of Expanded CAG-Repeat Containing Sequence(s): Identification of Candidate Breast Cancer Predisposition (Gene(s) |
JUN 2005 |
41 pages |
| Authors:
Hilmi Ozcelik; Hamdi Jarjanazi; Noel Pabalan; MOUNT SINAI HOSPITAL TORONTO (ONTARIO)
|
| Trinucleotide repeats (TNRs) are widely present in the human genome, and their expansions have been recognized to he the cause of several genetic disorders. In a previous study, we have identified expanded (CAG) repeats in 2.4% of breast cancer cases (n=212). No expansion of the sane magnitude has been detected in 196 population controls. In the current project our objective is to identify and characterize such sequences in breast cancer ... |
|
| An Invariant Representation for Matching Trajectories Across Uncalibrated Video Streams |
MAY 2005 |
11 pages |
| Authors:
Walter Nunziati; Stan Sclaroff; Alberto Del Bimbo; BOSTON UNIV MA DEPT OF COMPUTER SCIENCE
|
| We introduce a view point invariant representation of moving object trajectories that can be used in video database applications. It is assumed that trajectories lie on a surface that can be locally approximated with a plane. Raw trajectory data is first locally approximated with a cubic spline via least squares fitting. For each sampled point of the obtained curve, a projective invariant feature is computed using a small number of ... |
|
| Sequential Task Execution in a Minimalist Distributed Robotic System |
2005 |
10 pages |
| Authors:
Chris Jones; Maja J. Mataric; UNIVERSITY OF SOUTHERN CALIFORNIA LOS ANGELES DEPT OF COMPUTER SCIENCE
|
| The collective execution of a single task, such as foraging or clustering, has received considerable research attention in the minimalist distributed robotic systems (MDRS) community. In contrast, achievement of sequential tasks by MDRS has so far been considered in only a handful of studies. Sequential task execution requires a collective system to carry out a task, and then, in a coordinated fashion, move on to another task. This paper describes ... |
|
| Classifying Noisy Protein Sequence Data: A Case Study of Immunoglobulin Light Chains |
2005 |
9 pages |
| Authors:
Chenggang Yu; Nela Zavaljevski; Fred J. Stevens; Kelly Yackovich; Jaques Reifman; ARGONNE NATIONAL LAB IL
|
| Summary: The classification of protein sequences obtained from patients with various immunoglobulin-related conformational diseases may provide insight into structural correlates of pathogenicity. However, clinical data are very sparse and, in the case of antibody-related proteins, the collected sequences have large variability with only a small subset of variations relevant to the protein pathogenicity (function). On this basis, these sequences represent a model system for development of strategies to recognize the ... |
|
| A Survey of Spatio-Temporal Grouping Techniques |
AUG 2002 |
17 pages |
| Authors:
Remi Megret; Daniel DeMenthon; MARYLAND UNIV COLLEGE PARK LANGUAGE AND MEDIA PROCESSING LAB
|
| Spatio-temporal segmentation video sequences attempts to extract backgrounds and independent objects in the dynamic scenes captured in the sequences. It is an essential step of video analysis. It has important applications in video coding, video logging, indexing and retrieval, and more generally in scene interpretation and video understanding. We classify spatio-temporal grouping techniques into three categories: (1) segmentation with spatial priority, (2) segmentation by trajectory grouping, and (3) joint spatial ... |
|
| Building Mosaics from Video using MPEG Motion Vectors |
JUL 1999 |
29 pages |
| Authors:
Ryan C. Jones; Daniel DeMenthon; David S. Doermann; MARYLAND UNIV COLLEGE PARK INST FOR ADVANCED COMPUTER STUDIES
|
| In this paper, we present a novel way of creating mosaics from an MPEG video sequence. Two original aspects of our work are that (1) we explicitly compute camera motion between frames and (2) we deduce the camera motion directly from the motion vectors encoded in the MPEG video stream. This enables us to create mosaics more simply and quickly than with other methods. |
|
| Introspective Multistrategy Learning: On the Construction of Learning Strategies |
08-Jun-1999 |
56 pages |
| Authors:
Michael T Cox; Ashwin Ram; WRIGHT STATE UNIV DAYTON OH DEPT OF COMPUTER SCIENCE AND ENGINEERING
|
| A central problem in multistrategy learning systems is the selection and sequencing of machine learning algorithms for particular situations. This is typically done by the system designer, who analyzes the learning task and implements the appropriate algorithm or sequence of algorithms for that task. The authors propose a solution to this problem that enables an Artificial Intelligence (AI) system with a library of machine learning algorithms to select and sequence ... |
|
| A New Sequential Goodness-Of-Fit-Test for the Three-Parameter Weibull Distribution with Known Shape Parameter Value Based on Skewness and Q-Statis G. O.F. Test Statistics |
MAR 1999 |
834 pages |
| Authors:
Tibet Memis; AIR FORCE INST OF TECH WRIGHT-PATTERSONAFB OH SCHOOL OF ENGINEERING
|
| Due to its flexibility, the Weibull distribution has very wide applicability in a lot of disciplines and is very prevalent in reliability theory. Thus, a lot of statistical tests that generally have a substantial degree of computional complexity have been developed to determine if the data at hand can be represented with this distribution. This research presents a new omnibus goodness-of-fit test (G.O.F.) that has less computational complexity than the ... |
|
| Learning the Grammar of Dance |
1998 |
20 pages |
| Authors:
Joshua Stuart; Elizabeth Bradley; COLORADO UNIV AT BOULDER DEPT OF COMPUTER SCIENCE
|
| Human motion sequences that are generated by computer algorithms may contain abrupt transitions: places where consecutive body positions would require physically impossible or stylistically illegal moves. We use graph--theoretic methods to learn the "grammar" of joint movements in a given corpus and then apply memory-bounded A* search to the resulting transition graphs--using an in order to reduce the search space--to find appropriate interpolation sequences. The application that motivated the development ... |
|
| Design, Testing, and Evaluation of GaAsPN Sequence Generator Circuits Implemented in DCFL and TDFL |
SEP 1997 |
96 pages |
| Authors:
Michael W. Schimpf; NAVAL POSTGRADUATE SCHOOL MONTEREY CA
|
| Spaceborne and military communications hardware demands very high speed circuitry even under high radiation exposure. GaAs field effect transistors have the desirable quality that they possess rapid switching rates and are inherently more resistant to total-dose radiation induced failure than their silicon CMOS counterparts. This thesis project involves the design. simulation, submission for fabrication. testing. and evaluation of a 1 -GHz. 7- bit, pseudo-noise sequence generator (PNSG) which has numerous ... |
|
| Atomic Layer Control of Thin Film Growth Using Binary Reaction Sequence Chemistry |
JUN 97 |
17 pages |
| Authors:
Steven M. George; COLORADO UNIV AT BOULDER DEPT OF CHEMISTRY
|
| Our research is focusing on the atomic layer control of thin film growth. Our goal is to deposit films with precise control of thickness and conformality on both flat and high aspect ratio structures. Atomic layer control of growth is crucial for many technologies that require nanoscale deposition techniques to fabricate ultrathin and conformal films with thicknesses from 10- 100 A. Examples of these films are ultrathin gate oxides, high ... |
|
| Sequence-Specific and Synergistic Binding of Drugs to DNA |
OCT 95 |
48 pages |
| Authors:
Fu-Ming Chen; TENNESSEE STATE UNIV NASHVILLE
|
| We had proposed to study the sequence specific binding and synergistic effect of three drugs having distinctly different binding modes: actinomycin D (ACTD), a guanine specific intercalator; chromomycin A3, a guanine specific minor groove binder; and distamycin A, an A.T specific groove binder. To investigate the possible synergistic effects of drugs on DNA binding, it is essential that binding characteristics of each individual drug such as binding affinities, sequence specificities, ... |
|
| Depth from Brightness of Moving Images |
12 MAR 1995 |
6 pages |
| Authors:
Stefano Soatto; Pietro Perona; CALIFORNIA INST OF TECH PASADENA CONTROL AND DYNAMICAL SYSTEMS
|
| In this report, the authors describe a method for recursively estimating the depth of a scene from a sequence of images. The input to the estimator are brightness values at a number of locations on a grid in a video image, and the output is the relative (scaled) depth corresponding to each image-point. The estimator is invariant with respect to the motion of the viewer, in the sense that the ... |
|
| On Producing Sequential Movements and Actions. An Integrative Review and an Update of the Generalized Motor Program (Over het uitvoeren van sequentiele bewegingen en acties. Een integrerende literatuurstudie en een aanpassing van het Generalized Motor Pro |
29 AUG 94 |
|
| Authors:
W. B. Verwey; HUMAN FACTORS RESEARCH INST TNO SOESTERBERG (NETHERLANDS)
|
 | This report presents a review of the literature on the rapid production of sequences of movements in general and the effects of practice on sequence production in particular. A basic notion in this chapter is that a sequence of up to five movement elements can be programmed in advance by loading information on each element into a short-term motor buffer in a step-by-step manner. Subsequently, the content of this motor ... |
|
| Derivation of the Manufacture to Target Sequence for Environmental Testing |
Aug-1994 |
|
| Authors:
Arthur G Ringer; AUSTRALIAN ORDNANCE COUNCIL CANBERRA
|
| When new or modified explosives or explosive ordnance are being procured, the Australian Ordnance Council provides advice on their safety and suitability for service (S3). This information is provided from the analysis of results from a program of tests designed to replicate the manufacture-to-target sequence of the explosive ordnance being procured. The manufacture-to-target sequence identifies the various environments the ammunition will experience from the time it is delivered from the ... |
|
| Spontaneous Discovery and Use of Categorical Structure |
15 FEB 93 |
31 pages |
| Authors:
John P. Clapper; Gordon H. Bower; STANFORD UNIV CA DEPT OF PSYCHOLOGY
|
| These experiments investigated unsupervised category learning using tasks in which subjects attempted to memorize the features of training instances from two contrasting categories. On each trial, subjects studied a verbal feature list (training instance) for 24 seconds, after which they were given multiple choice recognition tests to evaluate their memory for each list item. The amount of time spent looking at each feature during the study phase, and the accuracy ... |
|
| Dobrava Virus as a New Hantavirus: Evidenced by Comparative Sequence Analysis |
10 JUL 1992 |
4 pages |
| Authors:
Shu-Yuan Xiao; Gordana Diglisic; Tatjana Avsic-Zupanc; James W. LeDuc; ARMY MEDICAL RESEARCH INST OF INFECTIOUS DISEASES FORT DETRICK MD
|
| Dobrava virus, recently isolated from a yellow-neck mouse (Apodemus flavicollis), captured in a northern Slovenian village where severe cases of hemorrhagic fever with renal syndrome were recognized, was shown by serology and restriction enzyme digestion of PCR-amplified gene segments to be related to previously recognized hantaviruses. To investigate further the relationship of this new isolate to other hantaviruses, a portion of the medium (M) genome segment of Dobrava virus was ... |
|
| Analysis of DNA Sequences by An Optical Time-Integrating Correlator: Proof-Of-Concept Experiments |
MAY 92 |
|
| Authors:
N. Brousseau; J. W. Salt; L. Gutz; M. D. Tucker; DEFENCE RESEARCH ESTABLISHMENT OTTAWA (ONTARIO)
|
| The analysis of the molecular structure called DNA is of particular interest for the understanding of the basic processes governing life. Correlation techniques implemented on digital computers are currently used to perform the analysis but the present process is so slow that the mapping and sequencing of the entire human genome requires a computational breakthrough. This paper presents proof-of-concept experiments of a new method of performing the analysis of DNA ... |
|
| Analysis of DNA Sequences by an Optical Time-Integrating Correlator: Proof-of-Concept Experiments |
MAY 92 |
|
| Authors:
N. Brousseau; J. W. Salt; L. Gutz; M. D. Tucker; DEFENCE RESEARCH ESTABLISHMENT OTTAWA (ONTARIO)
|
| The analysis of the molecular structure called DNA is of particular interest for the understanding of the basic processes governing life. Correlation techniques implemented on digital computers are currently used to perform the analysis but the present process is so slow that the mapping and sequencing of the entire human genome requires a computational breakthrough. This paper presents proof-of-concept experiments of a new method of performing the analysis of DNA ... |
|
| Reconstruction of Evolutionary Trees from Pairwise Distributions on Current Species, |
1992 |
|
| Authors:
Joseph T. Chang; John A. Hartigan; YALE UNIV NEW HAVEN CT DEPT OF STATISTICS
|
| Suppose that the evolution of a character possessed by a number of current species is modelled as a Markov random field on an evolutionary tree. Suppose that for each pair of current species we know the joint probability distribution of the pair of characters possessed by that pair of species. We give conditions under which the evolutionary tree can be reconstructed from knowledge of these pairwise joint distributions, that is, ... |
|
| Total Screening of Bovine Brain and Bone Marrow Extracts for Active Peptides, |
1992 |
|
| Authors:
V. T. Ivanov; A. A. Karelin; E. V. Karelina; V. V. Ul'yashin; B. V. Vaskovsky; AKADEMIYA NAUK SSSR MOSCOW
|
|
| On Categorizing Sounds |
07 AUG 91 |
46 pages |
| Authors:
Gregory R. Lockhead; DUKE UNIV DURHAM NC DEPT OF PSYCHOLOGY
|
| Context is important when people judge sounds, or attributes of sounds, or other stimuli. It is shown how judgments depend on what sounds recently occurred (sequence effects), on how those sounds differ from one another (range effects), on the distribution of those differences (set effects), on what subjects are told about the situation (task effects), and on what subjects are told about their performance (feedback effects). Each of these factors ... |
|
| The Asymptotic Validity of Sequential Stopping Rules for Stochastic Simulations |
JAN 90 |
32 pages |
| Authors:
Peter W. Glynn; Ward Whitt; STANFORD UNIV CA DEPT OF OPERATIONS RESEARCH
|
| We establish general conditions for the asymptotic validity of sequential stopping rules to achieve fixed-volume confidence sets for simulation estimators of vector-valued parameters. The asymptotic validity occurs as the prescribed volume of the confidences set approaches zero. There are two requirements: a functional central limit theorem for the estimation process and strong consistency (with-probability-one convergence) for the variance or scaling matrix estimator. Applications are given for: sample means of i.i.d. ... |
|
| Classification of Acousto-Optic Correlation Signatures of Spread Spectrum Signals Using Artificial Neural Networks |
DEC 89 |
123 pages |
| Authors:
John W. DeBerry; AIR FORCE INST OF TECH WRIGHT-PATTERSON AFB OH SCHOOL OF ENGINEERING
|
| The primary goal of this research was to determine if artificial Neural Networks (ANNs) can be trained to classify the correlation signatures of direct sequence and frequency-hopped spread-spectrum signals. Secondary goals were to determine (1) if network classification performance can be modeled with a conditional probability matrix, (2) if the symmetry of the matrices can be controlled, and (3) if using a majority vote rule over independently trained networks improves ... |
|
| Adaptive, Asynchronous Stochastic Global Optimization Algorithms for Sequential and Parallel Computation |
26 OCT 89 |
31 pages |
| Authors:
Sharon Smith; Elizabeth Eskow; Robert B. Schnabel; COLORADO UNIV AT BOULDER DEPT OF COMPUTER SCIENCE
|
| We discuss new global optimization algorithms that are related to the stochastic methods of Rinnooy Kan and Timmer, and to our previous static, synchronous parallel version of this method. The new algorithms have two main new features. First, they adaptively concentrate the computation in the areas of the domain space that appear most likely to produce the global minimum. Secondly, on parallel computers, they use an asynchronous approach, combined with ... |
|
| A Unified Approach to the Synthesis of Fully Testable Sequential Machines |
OCT 89 |
11 pages |
| Authors:
Srinivas Devadas; Kurt Keutzer; MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE
|
| In this paper we attempt to unify and extend the various approaches to synthesizing fully testable sequential circuits that can be modeled as finite state machines (FSMs). We first identify classes of redundancies and isolate equivalent-state redundancies as those most difficult to eliminate. We then show that the essential problem behind equivalent-state redundancies is the creation of valid/invalid state pairs. We devote the remainder of the paper to techniques for ... |
|
| Boolean Minimization and Algebraic Factorization Procedures for Fully Testable Sequential Machines |
SEP 89 |
6 pages |
| Authors:
Srinivas Devadas; Kurt Keutzer; MASSACHUSETTS INST OF TECH CAMBRIDGE MICROSYSTEMS TECHNOLOGY LABS
|
| In this paper we continue to investigate the impact of logic synthesis on the testability of sequential circuits that can be modeled as finite state machines. Complete testability of a sequential circuit is ensured by guaranteeing that each invalid state has an unperturbable distinguishing sequence. To accomplish this we present a novel Boolean minimization procedure of prime implicant generation and constrained covering based on the Quine- McCluskey algorithm that ensures ... |
|
| Efficient on-Line Simulations of Tree Machines and Multidimensional Turing Machines by Random Access Machines |
24 AUG 89 |
33 pages |
| Authors:
Michael C. Loui; David R. Luginbuhl; ILLINOIS UNIV AT URBANA COORDINATED SCIENCE LAB
|
| The random access machine (RAM) and the Turing machine (TM) are the standard models for sequential computation. Research into the use to time and space by these and other models gives us insight into their computational power. This research includes analyzing how two different models use time and space, and comparing time and space utilization within a single model. Another avenue of investigation is determining how altering the definitions of ... |
|
| Test Generation for Highly Sequential Circuits |
AUG 89 |
6 pages |
| Authors:
Abhijit Ghosh; Srinivas Devadas; A. R. Newton; MASSACHUSETTS INST OF TECH CAMBRIDGE MICROSYSTEMS RESEARCH CENTER
|
| We address the problem of generating test sequences for stuck-at faults in non-scan synchronous sequential circuits. We present a novel test procedure that exploits both the structure of the combinational logic in the circuit as well as the sequential behavior of the circuit. In contrast to previous approaches, we decompose the problem of sequential test generation into three subproblems of combinational test generation, fault-free state justification and fault-free state differentiation. ... |
|
| Characterization of Marine Bioadhesive Proteins |
01 JUL 89 |
12 pages |
| Authors:
Richard A. Laursen; BOSTON UNIV MA DEPT OF CHEMISTRY
|
| The objective of this research is to elucidate the amino acid sequences, via gene sequencing, of the adhesive proteins from several species of mussel and of other organisms, with the aim of understanding how these organisms attach themselves to wet surfaces. During this project period, we have cloned and sequenced fragments of the adhesive protein genes from three species of mussel. Two classes of protein are now apparent: they are ... |
|
| Sequential Searching in Multidimensional Monotone Arrays |
JUN 89 |
37 pages |
| Authors:
Alok Aggarwal; James K. Park; MASSACHUSETTS INST OF TECH CAMBRIDGE MICROSYSTEMS RESEARCH CENTER
|
| Shared-memory multiprocessors commonly use shared variables for synchronization. Our simulations of real parallel applications show that large- scale cache-coherent multiprocessors suffer significant amounts of invalidation traffic due to synchronization. Large multiprocessors that do not cache synchronization variables are often more severely impacted. If this synchronization traffic is not reduced or managed adequately, synchronization references can cause sever congestion in the network. We propose a class of adaptive backoff methods that ... |
|
| The New Programming |
MAY 89 |
|
| Authors:
C. S. Phillips; B. D. Bramson; ROYAL SIGNALS AND RADAR ESTABLISHMENT MALVERN (ENGLAND)
|
| The late C S E Phillips' unfinished paper is presented. The sequential mode of thinking that underpins conventional programming is cited as being unnecessary, over-complicated and impractical for all but the most trivial of problems. In New Programming, the flow of data is the only factor of importance. A new Computer is a non-sequential machine whose elemental processors are not required to execute their processes in an ordered sequence. Such ... |
|
| Delay Test Generation for Synchronous Sequential Circuits |
MAY 89 |
|
| Authors:
Srinivas Devadas; MASSACHUSETTS INST OF TECH CAMBRIDGE MICROSYSTEMS RESEARCH CENTER
|
| We address the problem of generating tests for delay faults in non- scan synchronous sequential circuits. Delay test generation for sequential circuits is a considerably more difficult problem than delay testing of combinational circuits and has received much less attention. In this paper, we present a method for generating test sequences to detect delay faults in sequential circuits using the stuck-at fault sequential test generator STALLION. The method is complete ... |
|
| Detectability of a Direct Sequence Emitter within a Network of Direct Sequence Emitters |
JAN 88 |
|
| Authors:
David L. Nicholson; Edgar H. German Jr; M/A-COM SYSTEMS ENGINEERING CENTER VIENNA VA
|
| This report analyzes the ability of unintended intercept receivers to isolate individual Direct Sequence (DS) emitters within a network of DS emitters. The report demonstrates that interception over 1/(R to the 4th power) propagation paths requires very large, ground-based antennas in order to achieve a usable intercept Signal-to-Noise Ration (SNR). On the other hand, free space, 1/(Sqr R) propagation paths provide intercept receivers with signal power levels well above the ... |
|
| The Forbin Paper |
JUL 87 |
|
| Authors:
Thomas Dean; R. J. Firby; David Miller; YALE UNIV NEW HAVEN CT DEPT OF COMPUTER SCIENCE
|
| Planning is the process of formulating sequences of actions which, if carried out, can be expected to bring about certain situations. Search in planning involves simulating various sequences of actions to see whether or not they will bring about the desired situation. Since the space of possible sequences of actions is quite large in comparison with the set of sequences that actually bring about the desired situation, it is important ... |
|
| Doppler Tolerant Binary Phase Coded Pulse Compression System. |
28 APR 1987 |
|
| Authors:
Bernard L. Lewis; DEPARTMENT OF THE NAVY WASHINGTON DC
|
| A Doppler tolerant binary phase coded pulse compression system. An input pulse is converted to a binary coded sequence of pulses according to a phase code. The sequence pulses is used to frequency code a transmitted carrier. Echo returns are demodulated and supplied to a matched filter for comparison to the binary phase code to detect targets in the echo returns. The detection of targets is independent of target speed. ... |
|
| Large Scale C3 Systems: Experiment Design and System Improvement |
AUG 86 |
|
| Authors:
Philippe J. Martin; MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR INFORMATION AND DECISION SYSTEMS
|
| A methodology for improving a large scale C3 system in an optimal manner is developed. The first step of this methodology consists of a procedure for designing experiments to run on a large scale C3 system: it aims at determining the smallest number of experiments that enables one to evaluate the effectiveness of an actual system. The second step consists of a dynamic programming algorithm aimed at determining an optimal ... |
|
| Sequencing and Timing in Skilled Perception and Action: An Overview |
01 MAY 86 |
|
| Authors:
Steven W. Keele; OREGON UNIV EUGENE DEPT OF PSYCHOLOGY
|
| The chapters in this book section are concerned with sequencing and timing in the production and perception of language. Besides giving an overview of each contribution and relating them to some common themes, the present chapter goes a bit further. It is speculated that not only are processes in common to the various manifestations of language-reading, writing, speaking, and listening-but there may be even more general processes that encompass other ... |
|
| Spread Spectrum Acquisition and Tracking |
08 NOV 85 |
|
| Authors:
Donald L. Schilling; H. Kayser; CITY COLL NEW YORK COMMUNICATIONS SYSTEMS LAB
|
| This report discusses the following subjects: An acquisition scheme for a frequency-hopped SS signal received over a Rayleigh multipath channel with random delay time. We consider relatively fast FH with a hopping rate of 1 KHZ and 127 different hopping frequencies. The received signal is embedded in white Gaussian noise. While the above problem appears to be specific the approach given below is general and can be generalized further. In ... |
|
| Constraint-Directed Search: A Case Study of Job-Shop Scheduling |
13 DEC 1983 |
|
| Authors:
M. S. Fox; CARNEGIE-MELLON UNIV PITTSBURGH PA ROBOTICS INST
|
| This thesis investigates the problem of constraint-directed reasoning in the job-shop scheduling domain. The job-shop scheduling problem is defined as: selecting a sequence of operations whose execution results in the completion of an order, and assigning times (i.e., start and end times) and resources to each operation. The number of possible schedules grows exponentially with the number of orders, alternative production plans, substitutable resources, and possible times to assign resources ... |
|
| Determining the Instantaneous Axis of Translation from Optic Flow Generated by Arbitrary Sensor Motion |
JAN 1983 |
|
| Authors:
J. H. Rieger; D. T. Lawton; MASSACHUSETTS UNIV AMHERST DEPT OF COMPUTER AND INFORMATION SCIENCE
|
| This paper develops a simple and robust procedure for determining the instantaneous axis of translation from image sequences induced by unconstrained sensor motion. The procedure is based upon the fact that difference vectors at discontinuities in optic flow fields generated by sensor motion relative to a stationary environment are oriented along translational field lines. This is developed into a procedure consisting of three steps: (1) locally computing difference vectors from ... |
|
| Flame Propagation with a Sequential Reaction Mechanism |
05 MAR 1981 |
|
| Authors:
Stephen B. Margolis; Bernard J. Matkowsky; NORTHWESTERN UNIV EVANSTON IL DEPT OF ENGINEERING SCIENCE AND APPLIED MATHEMATICS
|
|
| Hydrogen Gas Generator as Power Supply for Fluidic Sequencer |
22 AUG 1980 |
35 pages |
| Authors:
William H. Barber; Ottmar H. Dengel; NAVAL SURFACE WEAPONS CENTER SILVER SPRING MD
|
| This report summarizes the efforts to develop a hydrogen gas generator for a fluidic event sequencing subsystem (FESS). During the course of this project, not only was a pelletized grain design successfully utilized for the first time, but an entirely new formulation had to be developed to meet the FESS operational and functional requirements. All parameters for the FESS application were met, and only slight modifications in pellet size will ... |
|
| Kronecker Sequences for Spread-Spectrum Communication |
21 JUL 1980 |
|
| Authors:
W. E. Stark; D. V. Sarwate; ILLINOIS UNIV AT URBANA
|
|
| Actors and Continuous Functionals, |
DEC 1977 |
|
| Authors:
Carl Hewitt; Henry Baker Jr; MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE
|
| This paper presents precise versions of some 'laws' that must be satisfied by computations involving communicating parallel processes. The laws take the form of stating plausible restrictions on the histories of computations that are physically realizable. The laws are very general in that they are obeyed by parallel processes executing on a time varying number of distributed physical processors. For example, some of the processors might be in orbiting satellites. ... |
|
Reports by Keyword(s)
*SEQUENCES
