15488270
Segmentation of Spectrum Map for HFSWR Based on Feature Extraction
When targets fall in different types of clutter and noise background in High Frequency Surface Wave Radar (HFSWR), uniform detection algorithms always result in poor detection and tracking performances. To solve the problem, two methods are proposed in this paper by extracting the background features according to the probability distribution and the image characteristic of the spectrum map. The first method uses Parzen window for estimating probability density function and Kullback-Leibler convergence for evaluating the difference between the Azimuth-Range-Doppler cells in spectrum map which can be used to distinguish the homogenous detection background from the non-homogenous. The second method is proposed based on the image edge feature in multi-scale space. The real data results about HFSWR show that the proposed methods can not only identify noise/clutter but also help choose appropriate detection/tracking algorithms to improve performances in such complex environments.
13044783
A New Time-domain Detection Approach with Blind Separation Based on Neural Network
In this paper a new technique is proposed for time-domain detection in energy detection. The proposed scheme is based on a independent-component analysis (ICA): blind separation of unknown source signals. This method not only improves the nicety of time-domain detection for narrow band signal and the sinusoidal signal but also reduces the power of the whole detection system.
42027884
New Approximation for Minimum-Weight Routing Backbone in Wireless Sensor Network
Our problem formulation is as follows. Given a weighted disk graph Gwhere the weight of edge represents the transmission energy consumption, we wish to determine a dominating tree Tof Gsuch that the total weight of edges in Tis minimized. To the best of our knowledge, this problem have not been addressed in the literature. Solving the dominating tree problem can yield a routing backbone for broadcast protocols since: (1) each node does not have to construct their own broadcast tree, (2) utilize the virtual backbone to reduce the message overhead, and (3) the weight of backbone is minimized. 
 
Our contributions to this problem is multi-fold: First, the paper is the first to study this problem, prove the hardness of this problem and propose an approximation framework. Second, we present a heuristic to approximate the solution with low time complexity. Third, a distributed algorithm is provided for practical implementation. Finally, we verify the effectiveness of our proposal through simulation.
14935404
Levels of Authentication Assurance: an Investigation
The ES-LoA project, funded by the UK Joint Information Systems Committee (JISC) under its e- Infrastructure Security Programme, investigates current and future needs among UK research and education community for a more fine-grained authorisation scheme that would allow service providers to take into account of the levels of confidence in identifying a remote entity requesting for service access. Such a fine-grained authorisation scheme is attractive to service providers offering resources with varying levels of sensitivity and/or wishing to tailor their security protections based upon risk levels. Service providers may wish to restrict access to more sensitive resources only to those who have gone through a more stringent authentication process, or given the same remote entity, require the use of a stronger authentication token should the access request come from a more risky environment. In this way, the quality of an authentication instance, expressed as an authentication Level of Assurance (LoA), becomes one of the parameters used in access control decision making. This paper investigates the current worldwide efforts in defining LoA and identifies gaps in existing definitions when they are applied to a federated environment.
1660866
A General Fuzzified CMAC Controller with Eligibility
This paper presents an online neural network controller. Cerebellar Model Articulation Controller (CMAC) is suitable to online control due to its fast learning speed. By integrating the CMAC address scheme with fuzzy logic concept, a general fuzzified CMAC (GFAC) is proposed. Then by incorporating the concept of eligibility into the GFAC, a GFAC controller with eligibility is presented, named FACE. A learning algorithm for the FACE is derived to tune the model parameters. To achieve online control, an efficient implementation of the proposed FACE method is presented. As an example, the proposed FACE is applied to a ship steering control system. The simulation results show that the ship course can be properly controlled under the disturbances of wave, wind and current.
1884872
A mobility monitoring based advance reservation protocol
Future wireless cellular networks will be Internet Protocol (IP) based. Users of wireless devices in these networks will expect to run real-time applications that require guarantees of Quality of Service (QoS). Such a user will expect the same seamless QoS that he would receive if he were running real-time applications on a wired network. Achieving seamless QoS in a mobile environment implies that a reservation should be re-established at the new Base Station (BS) before hand-over occurs. However, making these advance reservations is wasteful of valuable bandwidth in the wireless network. This paper proposes a protocol, called the Mobility Monitoring Based Advance Reservation Protocol (M²BARP), which aims to reduce the bandwidth overhead of making advance reservations. The protocol makes use of information about a Mobile Node's (MN) mobility to make a single advance reservation when the MN is about to hand-over. Unlike previous work, M²BARP takes advantage of overlapping cells to help to provide a more seamless QoS by reducing the number of calls dropped at hand-over
11164895
Primary-consistent soft-decision color demosaicking for digital cameras (patent pending)
Color mosaic sampling schemes are widely used in digital cameras. Given the resolution of CCD sensor arrays, the image quality of digital cameras using mosaic sampling largely depends on the performance of the color demosaicking process. A common problem with existing color demosaicking algorithms is an inconsistency of sample interpolations in different primary color channels, which is the cause of the most objectionable color artifacts. To cure the problem, we propose a new primary-consistent soft-decision framework (PCSD) of color demosaicking. In the PCSD framework, we make multiple estimates of a missing color sample under different hypotheses on edge or texture directions. The estimates are made via a primary consistent interpolation, meaning that all three primary components of a color are interpolated in the same direction. The final estimate of a color sample is obtained by testing different interpolation hypotheses in the reconstructed full-resolution color image and selecting the best via an optimal statistical decision or inference process. A concrete color demosaicking method of the PCSD framework is presented. This new method eliminates certain types of color artifacts of existing color demosaicking methods. Extensive experimental results demonstrate that the PCSD approach can significantly improve the image quality of digital cameras in both subjective and objective measures. In some instances, our gain over the competing methods can be as much as 7dB.
8279850
Analysis and Simulation Protocols Based on Slotted ALOHA for Plastic Optical Fiber Network
In this paper a novel multipriority reservation protocols for plastic optical fiber network is proposed. In conventional OCDMA system only allows finite units to transmit and access simultaneously according to the number of channels which be restricted by BER. To resolve this problem, a novel protocol based on slotted ALOHA is proposed in this paper. By using the reservation scheme and a distributed arbitration algorithm, channel collision and destination conflict can be avoided. The protocol can efficiently support the transmission of multimedia messages that require the different time-delay. The network throughput and average delay has been investigated by numerical analysis and simulation experiments. It is showed that the multipriority reservation protocol in this POF network is valid and efficient.
5086368
Marker-controlled perception-based mesh segmentation
This paper introduces an interactive marker-controlled mesh segmentation algorithm. In many applications, we need to partition a given mesh according to human perception or particular requirements. The algorithm presented in this paper is based on fast marching watersheds. We refer to the experience of image segmentation area and introduce interactive marker selection. Thus we obviously overcome the difficulty in intuitional segmentation control, and improve the quality of segmentation. The output results show the effectiveness and practicability of the algorithm.
13356041
Research on Distributed Data Mining Technology Based on Grid
Distributed data mining (DDM) techniques have become necessary for large and multi-scenario datasets requiring resources, which are heterogeneous and distributed. In this paper, we focused on distributed data mining based in grid. We have discussed and analyzed a new framework based on grid environments to execute new distributed data mining techniques on very large and distributed heterogeneous datasets. The architecture and motivation for the design have been presented. We pointed out that distributed data mining technology can offer a better solution since they are designed to work in a distributed environment by paying careful attention to the computing and communication resources.
11505780
InterJoin: Exploiting Indexes and Materialized Views in XPath Evaluation
XML has become the standard for data exchange for a wide variety of applications, particularly in the scientific community. In order to efficiently process queries on XML representations of scientific data, we require specialized techniques for evaluating XPath expressions. Exploiting materialized views in query processing significantly enhances query processing performance. We propose a novel view definition that allows for intermediate (structural) join results to be stored and reused in XML query evaluation. Unlike current XML view proposals, our views do not require navigation in the original document or path-based pattern matching. Hence, they are evaluated significantly faster and are easily costed as part of a query plan. In general, current structural joins cannot exploit views efficiently when the view definition is not a prefix (or a suffix) of the XPath query. To increase the applicability of our proposed view definition, we propose a novel physical structural join operator called InterJoin. The InterJoin operator allows for joining interleaving XPath expressions, e.g., joining //A//C with //B to evaluate //A//B//C. InterJoin allows for more join alternatives in XML query plans. We propose several physical implementations for InterJoin, including a technique to exploit spatial indexes on the inputs. We give analytic cost models for the implementations so they can be costed in an existing XML query optimizer. Experiments on real and synthetic XML data show significant speed-ups of up to 200% using InterJoin, and speed-ups of up to 400% using our materialized views