10631202
Real-time scheduling in a programmable radar signal processor
The new trend of designing radar digital signal processors is not only to improve their processing speed by adopting the parallel multi-processor architecture but also to make their infrastructure flexible so that one generic digital signal processor framework can be applied to a variety of different radar systems. The key technology to make such radar digital signal processor architecture programmable, or flexible, is the scheduler which manages resources of digital signal processing in real-time according to system requirements. In this paper, the architecture of the programmable radar signal processor (PRSP) is presented, and a real-time scheduling algorithm used in PRSP is thoroughly discussed.
44378446
Component-Oriented Digital Signal Processors
6881358
Probabilistic real-time guarantees for component-oriented phased array radars
In recent years, many modern phased array radars are built with commercial-off-the-shelf components, and the functions of many hardware components are also re-implemented by software modules. In such systems, radar tasks could be modelled as distributed real-time tasks, which require end-to-end deadline guarantees and have precedence constraints. Different from most previous work on either algorithms with restrictions in resource utilization or heuristics without analytical ways for schedulability guarantees, the objective of This work is to propose a joint real-time scheduling algorithm for both transmitter/receiver and signal processor workloads with an analytical framework for off-line probabilistic analysis and online admission control. The strength of our approach is verified by analysis results and a series of experiments based on a real phased array radar for air defense frigates [A. G. Huizing et al. (1996)].
42929157
Real-Time Digital Signal Processing of Phased Array Radars
With the advance of hardware and software technology, modern phased array radars are now built with commercial-off-the-shelf (COTS) components, and it opens up a new era in real-time resource scheduling of digital signal processing. This paper targets the essential issues in building a component-oriented signal processor (SP), which is one of the two major modules in modern phased array radars. We propose a simple but effective task allocation policy and a real-time scheduling algorithm to address the design objectives of SPs. We are able to bound the number of processing units needed for a component-oriented SP in the design time, while everything was done empirically in the past. A series of experiments was done to demonstrate the strength of our methodology.
111915458
A new model for engineering transaction
Engineering software systems, like CAD and CASE, are popular and important for today''s industry. As applications of engineering software system are getting more complex, engineering database systems, like CAD and CASE databases, which support concurrency control, access control, recovery, and versioning, are also on demand. Data modeling of engineering applications by using the object-oriented paradigm has been investigated in the past. However, a sufficient and complete transaction model to support the engineering databases is still under discussion. Transaction processing in the context of {\em traditional database} applications, such as banking and airline reservation systems, has been thoroughly studied. However, the concept of the traditional transaction can not be used in {\em engineering database} environments, such as CAD and CASE databases, because of some constraints imposed by the traditional transaction''s ACID properties. In this thesis, I thoroughly studied the requirements of engineering transactions, formally defined an engineering transaction model, and prudently showed that the proposed transaction model has the desired properties. Moreover, I designed a transaction system architecture to realize my transaction model.
16280666
Component-oriented radars with probabilistic timing guarantees
In recent years, many modern phased-array radars are built with commercial off-the-shelf components, and the functions of many hardware components are also reimplemented by software modules. In such systems, radar tasks could be modeled as distributed real-time tasks which require end-to-end deadline guarantees and have precedence constraints. Different from most previous work on either algorithms with restrictions in resource utilization or heuristics without analytical ways for schedulability guarantees, the objective of this paper is to propose a joint real-time scheduling algorithm for both transmitter/receiver and signal processor workloads with an analytical framework for offline probabilistic analysis and online admission control. The strength of our approach is verified by analysis results and a series of experiments based on a real phased-array radar for air defense frigates
12575767
Universal Quadratic Lower Bounds on Source Coding Error Exponents
We consider the problem of block-size selection to achieve a desired probability of error for universal source coding. While Baron, et al. (2004; 1973) studied this question for rates in the vicinity of entropy for known distributions using central-limit-theorem techniques, we are interested in all rates for unknown distributions and use error-exponent techniques. By adapting a technique of Gallager from the exercises of Gallager (1971), we derive a universal lower bound to the source-coding error exponent that depends only on the alphabet size and is quadratic in the gap to entropy.
18355867
Multi-granularity Visualization of Trajectory Clusters Using Sub-trajectory Clustering
With the surging of the requirements of location-based services, mining various interesting patterns from the spatial data becomes more and more important. In this paper, we propose an approach for visualizing the trajectory clustering results based on sub-trajectory clusters discovered from large-scale trajectory data. At first, we segment each trajectory into a set of sub-trajectories by detecting its corner points. And then, we choose Fréchet distance to compute the similarity between sub-trajectories, and use a density-based clustering method to cluster sub-trajectories and get an augmented order of the sub-trajectories. The visualization method can support multi-granularity views of the generated sub-trajectory clusters. Experiments have demonstrated the applicability and benefits of the proposed approach.
18226410
Real-time tracking with multiple cues by set theoretic random search
Conventional treatment of visual tracking has been to optimize an objective function in a probabilistic framework. In this formulation, efficient algorithms employing simple prior distributions are usually insufficient to handle clutters (e.g., Kalman filter). On the other hand, distributions that are complex enough to incorporate all a priori knowledge can make the problem computationally intractable (e.g., particle filters (PF)). This paper proposes a new formulation of visual tracking where every piece of information, be it from a priori knowledge or observed data, is represented by a set in the solution space and the intersection of these sets, the feasibility set, represents all acceptable solutions. Based on this formulation, we propose an algorithm whose objective is to find a solution in the feasibility set. We show that this set theoretic tracking algorithm performs effective face tracking and is computationally more efficient than standard PF-based tracking.
16124776
Interference channel capacity region for randomized fixed-composition codes
The randomized fixed-composition codes with optimal decoding error exponents are recently studied in [11], [12] for the finite alphabet interference channel with two transmitter-receiver pairs. In this paper we investigate the capacity region for randomized fixed-composition codes. A complete characterization of the capacity region of the said coding scheme is given. The inner bound is derived by showing the existence of a positive error exponent within the capacity region. A simple universal decoding rule is given. The tight outer bound is derived by extending a technique first developed in [10] for single input output channels to interference channels. It is shown that even with a sophisticated time-sharing scheme among randomized fixed-composition codes, the capacity region of the randomized fixed-composition coding is not bigger than the known Han-Kobayashi [24] capacity region. This suggests that the study of the average behavior of randomized codes are not sufficient in finding new capacity regions.
1776041
The design of distributed real-time video analytic system
Video has become an indispensable carrier of information and requires extremely computation expensive analysis to understand high level semantics. The computational difficulties in extracting embedded information and bridging the semantic gap present the major challenges in interoperability, scalability and real-time response of video analytic systems. In this paper, we propose a distributed scalable infrastructure VAP (Video Analytic Platform) for supporting real-time video stream analysis. In VAP, the application requirements are represented as a Directed Acrylic Graph (DAG), where nodes stand for video analysis computation modules and links show data flow and dependencies between nodes. VAP leverages UIMA (Unstructured Information Management Architecture) framework as the data flow control engine and multiple commodity databases as the storage and computation resources. The actual executions of video analysis computation modules have been pushed down into database engines to minimize the data movement cost. We initially choose video surveillance in retail store as a representative application domain. As a case study, a prototype system has been developed to achieve fundamental functions of real-time video surveillance, including video capture/store, human detection/tracking and customer shopping trajectory analysis.