Detection of aircraft below the horizon for vision‐based detect and avoid in unmanned aircraft systems

Vision‐based aircraft detection technology may provide a credible sensing option for automated detect and avoid in small‐to‐medium size fixed‐wing unmanned aircraft systems (UAS). Reliable vision‐based aircraft detection has previously been demonstrated in sky‐region sensing environments. This paper describes a novel vision‐based system for detecting aircraft below the horizon in the presence of ground clutter. We examine the performance of our system on a data set of 63 near collision encounters we collected between a camera‐equipped manned aircraft and a below‐horizon target. In these 63 encounters, our system successfully detects all aircraft, at an average detection range of 1890 m (with a standard error of 43 m and no false alarms in 1.1 h). Furthermore, our system does not require access to inertial sensor data (which significantly reduces system cost) and operates at over 12 frames per second.     

Promoting traits into model-driven development

Traits, as sets of behaviors, can provide a good mechanism for reusability. However, they are limited in important ways and are not present in widely used programming and modeling languages and hence are not readily available for use by mainstream developers. In this paper, we add UML associations and other modeling concepts to traits and apply them to Java and C++ through model-driven development. We also extend traits with required interfaces so dependencies at the semantics level become part of their usage, rather than simple syntactic capture. All this is accomplished in Umple, a textual modeling language based upon UML that allows adding programming constructs to the model. We applied the work to two case studies. The results show that we can promote traits to the modeling level along with the improvement in flexibility and reusability.     

Pattern matching in the Hamming distance with thresholds

It has long been known that pattern matching in the Hamming distance metric can be done in time, where n is the length of the text, m is the length of the pattern, and Σ is the alphabet. The classic algorithm for this is due to Abrahamson and Kosaraju. This paper considers the following generalization, motivated by the situation where the entries in the text and pattern are analog, or distorted by additive noise, or imprecisely given for some other reason: in any alignment of the pattern with the text, two aligned symbols a and b contribute +1 to the similarity score if they differ by no more than a given threshold θ, otherwise they contribute zero. We give an time algorithm for this more general version of the problem; the classic Hamming distance matching problem is the special case of θ=0.     

Implementation of a prototype VoIP system

VoIP(Voice over IP) is a rapidly growing area with great market potential.To promote it for both commerical and research purposes,a prototype VoIP system based on state-of -the -art otorola communication techniques has been developed.It is a gateway system integrating a PBX and a VoIP module.All components that H.323 defines to supprot VoIP are implemented in the VoIP module,though in a simplified manner,As an embedded system,the system features realtimeness and task distributiveness.A number of addiitonal techniques are used to improve the performance,including noise suppression,zero copy,and buffer structure optimization.When refined in interoperability,the system will also readily serve as a product.     

Analysis of biofluids for biomarker research

While many of the developments made in high-throughput proteomics were originally applied to procaryotic and simple eucaryotic organisms, the analysis of biofluids became increasingly important as the prospect of using proteomics to discover novel biomarkers became realized. Biofluids have represented a unique challenge to proteomics as they are often present only in small amounts and, particularly in the cases of serum and plasma, can have protein concentration ranges that differ by ten orders of magnitude. While the discovery of authentic, clinically useful biomarkers in the proteomics era has been lacking, there have been a number of significant developments in the ability to more comprehensively characterize biofluid proteomes. The rapid pace of these developments suggest that the eventual discovery of clinically validate biomarkers using proteomic technologies still has a bright future.     

Screening of serum samples from Wegener's granulomatosis patients using antibody microarrays

Wegener's Granulomatosis (WG) is an idiopathic granulomatosis autoimmune vasculitis that primarily affects small vessels and is associated with glomerulonephritis and pulmonary granulomatous vasculitis. Anti‐neutrophil cytoplasmic auto‐antibodies (cANCA) against proteinase‐3 are used to identify WG, but ANCA titers are not present in some patients with the localized disease. The objective of this study was to develop an antibody array to help identify protein expression patterns in serum from patients with WG as compared to normals. The arrays were tested for limits of detection, background, and cross reactivity using standard proteins. The arrays were hybridized with either normal patient serum (n = 30) or with serum samples from a population of WG patients (n = 26) that were age and sex matched. Data analysis and curve fitting of the standard dilution series calculated r² values and determined a sensitivity of <50 pg/mL for the majority of proteins. A total of 24 proteins were assessed. Several statistically significant increases (p<0.05) were seen in the expression of: angiotensin converting enzyme‐I, IFN‐γ, IL‐8, s‐ICAM‐1 and s‐VCAM in WG patients as compared to controls. Utilizing the antibody microarray technology has led to the identification of potential biomarkers of vascular injury in the serum of WG patients.     

Exploring pre-service teachers' beliefs about using Web 2.0 technologies in K-12 classroom

This qualitative study explored pre-service teachers' behavioral, normative, and control beliefs regarding their intentions to use Web 2.0 technologies in their future classrooms. The Theory of Planned Behavior (TPB) was used as the theoretical framework (Ajzen, 1991) to understand these beliefs and pre-service teachers' intentions for why they want to use Web 2.0 technologies. According to Ajzen's TPB, the behavioral beliefs are based on attitude toward outcomes or consequences of using Web 2.0, the normative beliefs depend on social support and social pressure to use Web 2.0, and the control beliefs lay the foundation of perceived behavioral control over using Web 2.0 in a classroom. Data were collected from open-ended survey questions (n = 190), semi-structured interviews (n = 12) and end of semester reflections (n = 12). Findings suggest that pre-service teachers' intentions to use Web 2.0 technologies are related to their beliefs about the value of these technologies for improving student learning and engagement, its ease of use (behavioral beliefs), its ability to meet the needs/expectations of digital age students (normative beliefs), the participants' high self-efficacy in use, and its potential for affording students anytime/anywhere access to learning and interaction (control beliefs). From these results, we recommend that teacher educators should target these beliefs within teacher development programs to prepare pre-service teachers for successful use of Web 2.0 technologies in their future K-12 classrooms.     

Statistical topic models for multi-label document classification

Machine learning approaches to multi-label document classification have to date largely relied on discriminative modeling techniques such as support vector machines. A?drawback of these approaches is that performance rapidly drops off as the total number of labels and the number of labels per document increase. This problem is amplified when the label frequencies exhibit the type of highly skewed distributions that are often observed in real-world datasets. In this paper we investigate a class of generative statistical topic models for multi-label documents that associate individual word tokens with different labels. We investigate the advantages of this approach relative to discriminative models, particularly with respect to classification problems involving large numbers of relatively rare labels. We compare the performance of generative and discriminative approaches on document labeling tasks ranging from datasets with several thousand labels to datasets with tens of labels. The experimental results indicate that probabilistic generative models can achieve competitive multi-label classification performance compared to discriminative methods, and have advantages for datasets with many labels and skewed label frequencies.