14054770
A new approach for ground moving target indication in foliage environment
Ground moving target indication (GMTI) in foliage environment is a challenging problem, because the strong echoes from dense foliage environment and big attenuation of the radar microwave often make it difficult for traditional time frequency distributions to clearly and locally represent the Doppler frequency. This paper introduced a new approach to improve the performance of GMTI. This so-called Hilbert Huang Transform (HHT) method composes of empirical mode decomposition (EMD) and Hilbert transform technique. EMD is applied to extract target signal from interference and the associated Hilbert transform calculates the instantaneous Doppler frequency, representing a novel Hilbert spectrum in time frequency domain. Both simulative and experimental signals are used to validate the efficiency of HHT. This adaptive approach offers higher signal to disturbance ratio and higher resolution in the time frequency distribution.
27140699
Differential Algebraic Method for Aberration Analysis of Electron Optical Systems
Differential algebraic method is a powerful technique in computer numerical analysis. It presents a straightforward method for computing arbitrary order derivatives of functions with extreme high accuracy limited only by the machine error. When applied to nonlinear dynamics systems, the arbitrary high order transfer properties of the system can be derived directly. In this paper, the principle of differential algebraic method is applied to calculate high order aberrations of electron optical systems. As an example, an electrostatic lens with an analytical expression has been calculated using this method. Relative errors of the Gaussian properties and spherical aberration coefficient of the lens compared with the analytic solutions are of the order 10− 11 or smaller. It is proved that differential algebraic aberration method is very helpful with high accuracy for high order aberration analysis and computation of electron optical systems.
158009
Threshold optimization algorithm for weak signal in distributed-sensor fusion system
Distributed order statistics constant false alarm rate (OS-CFAR) detection techniques are important for nonstationary observation with varying weak narrowband random signals. However, it is very difficult to choose system parameters to obtain optimal threshold values at the fusion center because of the nonlinear property of distributed OS-CFAR detection system. This paper provides a novel solution based on an effective and flexible genetic algorithm. Using this approach, all system parameters are directly coded in decimal chromosomes and they can be optimized simultaneously. Furthermore, we also derive the more general model by implementing the K fusion rules. The simulation results show that applying the proposed approach one can achieve comparable performances with the reported methods and results.
15882697
Coupling feature selection and machine learning methods for navigational query identification
It is important yet hard to identify navigational queries in Web search due to a lack of sufficient information in Web queries, which are typically very short. In this paper we study several machine learning methods, including naive Bayes model, maximum entropy model, support vector machine (SVM), and stochastic gradient boosting tree (SGBT), for navigational query identification in Web search. To boost the performance of these machine techniques, we exploit several feature selection methods and propose coupling feature selection with classification approaches to achieve the best performance. Different from most prior work that uses a small number of features, in this paper, we study the problem of identifying navigational queries with thousands of available features, extracted from major commercial search engine results, Web search user click data, query log, and the whole Web's relational content. A multi-level feature extraction system is constructed.Our results on real search data show that 1) Among all the features we tested, user click distribution features are the most important set of features for identifying navigational queries. 2) In order to achieve good performance, machine learning approaches have to be coupled with good feature selection methods. We find that gradient boosting tree, coupled with linear SVM feature selection is most effective. 3) With carefully coupled feature selection and classification approaches, navigational queries can be accurately identified with 88.1% F1 score, which is 33% error rate reduction compared to the best uncoupled system, and 40% error rate reduction compared to a well tuned system without feature selection.
2807541
IDEA:: an infrastructure for detection-based adaptive consistency control in replicated services
In Internet-scale distributed and replicated services, poor consistency results in poor QoS or even monetary loss. Recent research focuses on enforcing a certain consistency level, instead of perfect consistency, to strike a balance between consistency guarantee and system's scalability. In this paper, we argue that it is equally, if not more, important to achieve adaptability. I.e., the system adjusts its consistency level on the fly to suit applications. ongoing need. This paper presents IDEA (an Infrastructure for DEtection-based Adaptive consistency control), a protocol that adaptively controls consistency in replicated services by detecting inconsistency among nodes in a timely manner via an inconsistency detection framework and resolving the detected inconsistencies efficiently when necessary. Through experimentation on Planet-Lab, IDEA is evaluated from two aspects: its adaptive interface and its performance of inconsistency resolution. Results show that IDEA achieves adaptability by adjusting the consistency level according to users. preference on-demand, and it achieves low inconsistency resolution delay and incurs minimal communication cost.
2412225
Dynamic Voltage Scaling for Multitasking Real-Time Systems With Uncertain Execution Time
Dynamic voltage and frequency scaling can save energy for real-time systems. Frequencies are generally assumed proportional to voltages. Previous studies consider the probabilistic distributions of tasks' execution time to assist dynamic voltage scaling in task scheduling. These studies use probability information for intratask voltage scheduling but do not sufficiently explore the opportunities for intertask scheduling to save more energy. This paper presents a new approach to combine intra- and intertask voltage scheduling for better energy savings in hard real-time systems with uncertain task execution time. Our approach takes three steps: 1) We calculate statistically the optimal voltage schedules for multiple concurrent tasks, using earliest deadline first scheduling for an ideal processor that can change the frequency continuously; 2) we then adapt the solution to a processor with a limited range of discrete frequencies, using a polynomial-time heuristic algorithm; and 3) finally, we improve our solution, considering the time and energy overheads of frequency switching for schedulability and energy reduction. Our simulation shows that the new approach can save more energy than existing solutions while meeting hard deadlines.
7140152
Energy Reduction by Workload Adaptation in a Multi-Process Environment
Reducing energy consumption is an important issue in modern computers. Dynamic power management (DPM) has been extensively studied in recent years. One approach for DPM is to adjust workloads, such as clustering or eliminating requests, as a way to trade-off energy consumption and quality of services. Previous studies focus on single processes. However, when multiple concurrently running processes are considered, workload adjustment must be determined based on the interleaving of the processes' requests. When multiple processes share the same hardware component, adjusting one process may not save energy. This paper presents an approach to assign energy responsibility to individual processes based on how they affect power management. The assignment is used to estimate potential energy reduction by adjusting the processes. We use the estimation to guide runtime adaptation of workload behavior. Experiments demonstrate that our approach can save more energy and improve energy efficiency
1882756
Automatic Run-Time Selection of Power Policies for Operating Systems
A significant volume of research has concentrated on operating-system directed power management (OSPM). The primary focus of previous research has been the development of OSPM policies. Under different conditions, one policy may outperform another and vice versa. In this paper, we explain how to select the best policies at run-time without user or administrator intervention. We present a hardware-neutral architecture portable across different platforms running Linux. Our experiments reveal that changing policies at run-time can adapt to workloads more quickly than using any of the policies individually