Determining correspondence in 3-D MR brain images using attribute vectors as morphological signatures of voxels

Finding point correspondence in anatomical images is a key step in shape analysis and deformable registration. This paper proposes an automatic correspondence detection algorithm for intramodality MR brain images of different subjects using wavelet-based attribute vectors (WAVs) defined on every image voxel. The attribute vector (AV) is extracted from the wavelet subimages and reflects the image structure in a large neighborhood around the respective voxel in a multiscale fashion. It plays the role of a morphological signature for each voxel, and our goal is, therefore, to make it distinctive of the respective voxel. Correspondence is then determined from similarities of AVs. By incorporating the prior knowledge of the spatial relationship among voxels, the ability of the proposed algorithm to find anatomical correspondence is further improved. Experiments with MR images of human brains show that the algorithm performs similarly to experts, even for complex cortical structures.     

A general form of perfectly matched layers for three-dimensional problems of acoustic scattering in lossless and lossy fluid media

The concept of perfectly matched layer (PML) has been proven very effective in absorbing electromagnetic waves in lossless media. An extension of this method and a complete three-dimensional (3-D) scheme properly suited for finite-difference, time-domain (FDTD) modeling of acoustic propagation and scattering in unbounded problems are presented in this paper. This generalized PML is constructed in such a way that it performs significant absorption of traveling waves in acoustics for both lossless and lossy media. Theoretically, no reflections occur when propagating waves encounter the lossy medium-PML interface, no matter what the angle of incidence is, introducing at the same time the possibility for further wave attenuation via the stretched coordinates idea. Numerical results support the suggested PML theory as well as reveal the proper modifications, which lead to the achievement of the optimum absorbing-boundary condition.     

Rigorous comparison of parabolically tapered and conventional multimode-interference-based 3-dB power splitters in InGaAsP/InP waveguides

Design issues such as optical transmission, interference mechanisms, the splitting ratio, the polarization dependence, and the fabrication tolerances of a compact parabolically tapered multimode-interference (MMI)-based 3-dB power splitter on an InP-based deeply etched ridge waveguide, by use of the finite-element-based beam-propagation method, are presented. The benefits and drawbacks of the use of the tapered structure, in comparison with an untapered MMI-based 3-dB splitter, have also been investigated.     

Context-based caching and routing for P2P web service discovery

In modern heterogeneous environments, such as mobile, pervasive and ad-hoc networks, architectures based on web services offer an attractive solution for effective communication and inter-operation. In such dynamic and rapidly evolving environments, efficient web service discovery is an important task. Usually this task is based on the input/output parameters or other functional attributes, however this does not guarantee the validity or successful utilization of retrieved web services. Instead, non-functional attributes, such as device power features, computational resources and connectivity status, that characterize the context of both service providers and consumers play an important role to the quality and usability of discovery results. In this paper we introduce context-awareness in web service discovery, enabling the provision of the most appropriate services at the right location and time. We focus on context-based caching and routing for improving web service discovery in a mobile peer-to-peer environment. We conducted a thorough experimental study, using our prototype implementation based on the JXTA framework, while simulations are employed for testing the scalability of the approach. We illustrate the advantages that this approach offers, both by evaluating the context-based cache performance and by comparing the efficiency of location-based routing to broadcast-based approaches. Recommended by: Zakaria Maamar     

A distribution-free tabular CUSUM chart for autocorrelated data

A distribution-free tabular CUSUM chart called DFTC is designed to detect shifts in the mean of an autocorrelated process. The chart's Average Run Length (ARL) is approximated by generalizing Siegmund's ARL approximation for the conventional tabular CUSUM chart based on independent and identically distributed normal observations. Control limits for DFTC are computed from the generalized ARL approximation. Also discussed are the choice of reference value and the use of batch means to handle highly correlated processes. The performance of DFTC compared favorably with that of other distribution-free procedures in stationary test processes having various types of autocorrelation functions as well as normal or nonnormal marginals.     

Detecting unauthorized and compromised nodes in mobile ad hoc networks

Security of mobile ad hoc networks (MANET) has become a more sophisticated problem than security in other networks, due to the open nature and the lack of infrastructure of such networks. In this paper, the security challenges in intrusion detection and authentication are identified and the different types of attacks are discussed. We propose a two-phase detection procedure of nodes that are not authorized for specific services and nodes that have been compromised during their operation in MANET. The detection framework is enabled with the main operations of ad hoc networking, which are found at the link and network layers. The proposed framework is based on zero knowledge techniques, which are presented through proofs.     

Exploiting temporal information and adaptive thresholding for fast mode decision in the H264 video coding standard

A new algorithm for fast mode decision in the H264 video coding standard is presented in this paper. The algorithm exploits temporal information and adaptive thresholding and can provide significant computational savings with similar or even better Rate Distortion performance as compared to accepted standard contributions and other techniques found in the literature.     

SecMR – a secure multipath routing protocol for ad hoc networks

Multipath routing in ad hoc networks increases the resiliency against security attacks of collaborating malicious nodes, by maximizing the number of nodes that an adversary must compromise in order to take control of the communication. In this paper, we identify several attacks that render multipath routing protocols vulnerable to collaborating malicious nodes. We propose an on-demand multipath routing protocol, the secure multipath routing protocol (SecMR), and we analyze its security properties. Finally, through simulations, we evaluate the performance of the SecMR protocol in comparison with existing secure multipath routing protocols.     

Multifold node authentication in mobile ad hoc networks

An ad hoc network is a collection of nodes that do not need to rely on a predefined infrastructure to keep the network connected. Nodes communicate amongst each other using wireless radios and operate by following a peer‐to‐peer network model. In this article, we propose a multifold node authentication approach for protecting mobile ad hoc networks. The security requirements for protecting data link and network layers are identified and the design criteria for creating secure ad hoc networks using multiple authentication protocols are analysed. Such protocols, which are based on zero‐knowledge and challenge‐response techniques, are presented through proofs and simulation results. Copyright © 2007 John Wiley & Sons, Ltd.     

D-cores: measuring collaboration of directed graphs based on degeneracy

Community detection and evaluation is an important task in graph mining. In many cases, a community is defined as a subgraph characterized by dense connections or interactions between its nodes. A variety of measures are proposed to evaluate different quality aspects of such communities—in most cases ignoring the directed nature of edges. In this paper, we introduce novel metrics for evaluating the collaborative nature of directed graphs—a property not captured by the single node metrics or by other established community evaluation metrics. In order to accomplish this objective, we capitalize on the concept of graph degeneracy and define a novel D-core framework, extending the classic graph-theoretic notion of $k$ -cores for undirected graphs to directed ones. Based on the D-core, which essentially can be seen as a measure of the robustness of a community under degeneracy, we devise a wealth of novel metrics used to evaluate graph collaboration features of directed graphs. We applied the D-core approach on large synthetic and real-world graphs such as Wikipedia, DBLP, and ArXiv and report interesting results at the graph as well at the node level.