Spectrum sensing using distributed sequential detection via noisy reporting MAC

This paper considers cooperative spectrum sensing algorithms for Cognitive Radios which focus on reducing the number of samples to make a reliable detection. We propose algorithms based on decentralized sequential hypothesis testing in which the Cognitive Radios sequentially collect the observations, make local decisions and send them to the fusion center for further processing to make a final decision on spectrum usage. The reporting channel between the Cognitive Radios and the fusion center is assumed more realistically as a Multiple Access Channel (MAC) with receiver noise. Furthermore the communication for reporting is limited, thereby reducing the communication cost. We start with an algorithm where the fusion center uses an SPRT-like (Sequential Probability Ratio Test) procedure and theoretically analyze its performance. Asymptotically, its performance is close to the optimal centralized test without fusion center noise. We further modify this algorithm to improve its performance at practical operating points. Later we generalize these algorithms to handle uncertainties in SNR and fading. (C) 2014 Elsevier B.V. All rights reserved.

Use of Exocentric and Egocentric Representations in the Concurrent Planning of Sequential Saccades

The concurrent planning of sequential saccades offers a simple model to study the nature of visuomotor transformations since the second saccade vector needs to be remapped to foveate the second target following the first saccade. Remapping is thought to occur through egocentric mechanisms involving an efference copy of the first saccade that is available around the time of its onset. In contrast, an exocentric representation of the second target relative to the first target, if available, can be used to directly code the second saccade vector. While human volunteers performed a modified double-step task, we examined the role of exocentric encoding in concurrent saccade planning by shifting the first target location well before the efference copy could be used by the oculomotor system. The impact of the first target shift on concurrent processing was tested by examining the end-points of second saccades following a shift of the second target during the first saccade. The frequency of second saccades to the old versus new location of the second target, as well as the propagation of first saccade localization errors, both indices of concurrent processing, were found to be significantly reduced in trials with the first target shift compared to those without it. A similar decrease in concurrent processing was obtained when we shifted the first target but kept constant the second saccade vector. Overall, these results suggest that the brain can use relatively stable visual landmarks, independent of efference copy-based egocentric mechanisms, for concurrent planning of sequential saccades.

Efficient Adaptive Mesh Refinement for MoM-based Package-Board 3D Full-wave Extraction

The accurate solution of 3D full-wave Method of Moments (MoM) on an arbitrary mesh of a package-board structure does not guarantee accuracy, since the discretizations may not be fine enough to capture rapid spatial changes in the solution variable. At the same time, uniform over-meshing on the entire structure generates large number of solution variables and therefore requires an unnecessarily large matrix solution. In this work, a suitable refinement criterion for MoM based electromagnetic package-board extraction is proposed and the advantages of the adaptive strategy are demonstrated from both accuracy and speed perspectives.

Hardware Accelerator for 3D Method of Moments based Parasitic Extraction

A Field Programmable Gate Array (FPGA) based hardware accelerator for multi-conductor parasitic capacitance extraction, using Method of Moments (MoM), is presented in this paper. Due to the prohibitive cost of solving a dense algebraic system formed by MoM, linear complexity fast solver algorithms have been developed in the past to expedite the matrix-vector product computation in a Krylov sub-space based iterative solver framework. However, as the number of conductors in a system increases leading to a corresponding increase in the number of right-hand-side (RHS) vectors, the computational cost for multiple matrix-vector products present a time bottleneck, especially for ill-conditioned system matrices. In this work, an FPGA based hardware implementation is proposed to parallelize the iterative matrix solution for multiple RHS vectors in a low-rank compression based fast solver scheme. The method is applied to accelerate electrostatic parasitic capacitance extraction of multiple conductors in a Ball Grid Array (BGA) package. Speed-ups up to 13x over equivalent software implementation on an Intel Core i5 processor for dense matrix-vector products and 12x for QR compressed matrix-vector products is achieved using a Virtex-6 XC6VLX240T FPGA on Xilinx's ML605 board.

GPU-based normalized cuts for road extraction using satellite imagery

This paper presents a GPU implementation of normalized cuts for road extraction problem using panchromatic satellite imagery. The roads have been extracted in three stages namely pre-processing, image segmentation and post-processing. Initially, the image is pre-processed to improve the tolerance by reducing the clutter (that mostly represents the buildings, vegetation,. and fallow regions). The road regions are then extracted using the normalized cuts algorithm. Normalized cuts algorithm is a graph-based partitioning `approach whose focus lies in extracting the global impression (perceptual grouping) of an image rather than local features. For the segmented image, post-processing is carried out using morphological operations - erosion and dilation. Finally, the road extracted image is overlaid on the original image. Here, a GPGPU (General Purpose Graphical Processing Unit) approach has been adopted to implement the same algorithm on the GPU for fast processing. A performance comparison of this proposed GPU implementation of normalized cuts algorithm with the earlier algorithm (CPU implementation) is presented. From the results, we conclude that the computational improvement in terms of time as the size of image increases for the proposed GPU implementation of normalized cuts. Also, a qualitative and quantitative assessment of the segmentation results has been projected.

Multithreaded Test Synthesis for Deadlock Detection

Designing and implementing thread-safe multithreaded libraries can be a daunting task as developers of these libraries need to ensure that their implementations are free from concurrency bugs, including deadlocks. The usual practice involves employing software testing and/or dynamic analysis to detect. deadlocks. Their effectiveness is dependent on well-designed multithreaded test cases. Unsurprisingly, developing multithreaded tests is significantly harder than developing sequential tests for obvious reasons. In this paper, we address the problem of automatically synthesizing multithreaded tests that can induce deadlocks. The key insight to our approach is that a subset of the properties observed when a deadlock manifests in a concurrent execution can also be observed in a single threaded execution. We design a novel, automatic, scalable and directed approach that identifies these properties and synthesizes a deadlock revealing multithreaded test. The input to our approach is the library implementation under consideration and the output is a set of deadlock revealing multithreaded tests. We have implemented our approach as part of a tool, named OMEN1. OMEN is able to synthesize multithreaded tests on many multithreaded Java libraries. Applying a dynamic deadlock detector on the execution of the synthesized tests results in the detection of a number of deadlocks, including 35 real deadlocks in classes documented as thread-safe. Moreover, our experimental results show that dynamic analysis on multithreaded tests that are either synthesized randomly or developed by third-party programmers are ineffective in detecting the deadlocks.

Image-Segmentation Technique to Analyze Deformation Profiles in Different Direct Shear Tests

Results from interface shear tests on sand-geosynthetic interfaces are examined in light of surface roughness of the interacting geosynthetic material. Three different types of interface shear tests carried out in the frame of direct shear-test setup are compared to understand the effect of parameters like box fixity and symmetry on the interface shear characteristics. Formation of shear bands close to the interface is visualized in the tests and the bands are analyzed using image-segmentation techniques in MATLAB. A woven geotextile with moderate roughness and a geomembrane with minimal roughness are used in the tests. The effect of surface roughness of the geosynthetic material on the formation of shear bands, movement of sand particles, and interface shear parameters are studied and compared through visual observations, image analyses, and image-segmentation techniques.

Large Diameter Triaxial Tests on Geosynthetic-Reinforced Granular Subbases

The estimation of strength and stiffness of reinforced aggregates is very important for the design and construction of reinforced unpaved/paved road sections. This paper presents the experimental results from static and cyclic triaxial tests carried out on granular subbase samples reinforced with multiple layers of geogrid reinforcement. Aggregates of different size ranges were mixed in calculated proportions by weight to obtain the gradation specified for rural roads. Triaxial samples of 300 mm diameter and 600 mm height were prepared using this sampled aggregate. The strength and stiffness characteristics of this aggregate reinforced with geogrids at different elevations were determined from static and cyclic triaxial tests. Triaxial tests were also carried out on geocell encased aggregates, and the results are compared. From the experimental results it is observed that reinforced systems carried more stresses than unreinforced systems at the same strain level. The beneficial effect increased with increase in the quantity of reinforcement, whereas for geocell reinforcement, the advantage was evident only at higher strains. (C) 2014 American Society of Civil Engineers.

Adaptive Mesh Refinement for Fast Convergence of EFIE-Based 3-D Extraction

3-D full-wave method of moments (MoM) based electromagnetic analysis is a popular means toward accurate solution of Maxwell's equations. The time and memory bottlenecks associated with such a solution have been addressed over the last two decades by linear complexity fast solver algorithms. However, the accurate solution of 3-D full-wave MoM on an arbitrary mesh of a package-board structure does not guarantee accuracy, since the discretization may not be fine enough to capture spatial changes in the solution variable. At the same time, uniform over-meshing on the entire structure generates a large number of solution variables and therefore requires an unnecessarily large matrix solution. In this paper, different refinement criteria are studied in an adaptive mesh refinement platform. Consequently, the most suitable conductor mesh refinement criterion for MoM-based electromagnetic package-board extraction is identified and the advantages of this adaptive strategy are demonstrated from both accuracy and speed perspectives. The results are also compared with those of the recently reported integral equation-based h-refinement strategy. Finally, a new methodology to expedite each adaptive refinement pass is proposed.

CHEXVIS: a tool for molecular channel extraction and visualization

Background: Understanding channel structures that lead to active sites or traverse the molecule is important in the study of molecular functions such as ion, ligand, and small molecule transport. Efficient methods for extracting, storing, and analyzing protein channels are required to support such studies. Further, there is a need for an integrated framework that supports computation of the channels, interactive exploration of their structure, and detailed visual analysis of their properties. Results: We describe a method for molecular channel extraction based on the alpha complex representation. The method computes geometrically feasible channels, stores both the volume occupied by the channel and its centerline in a unified representation, and reports significant channels. The representation also supports efficient computation of channel profiles that help understand channel properties. We describe methods for effective visualization of the channels and their profiles. These methods and the visual analysis framework are implemented in a software tool, CHEXVIS. We apply the method on a number of known channel containing proteins to extract pore features. Results from these experiments on several proteins show that CHEXVIS performance is comparable to, and in some cases, better than existing channel extraction techniques. Using several case studies, we demonstrate how CHEXVIS can be used to study channels, extract their properties and gain insights into molecular function. Conclusion: CHEXVIS supports the visual exploration of multiple channels together with their geometric and physico-chemical properties thereby enabling the understanding of the basic biology of transport through protein channels. The CHEXVIS web-server is freely available at http://vgl.serc.iisc.ernet.in/chexvis/. The web-server is supported on all modern browsers with latest Java plug-in.

A New Algorithm for Nonparametric Sequential Detection

We consider nonparametric sequential hypothesis testing problem when the distribution under the null hypothesis is fully known but the alternate hypothesis corresponds to a general family of distributions. We propose a simple algorithm to address the problem. Its performance is analysed and asymptotic properties are proved. The simulated and analysed performance of the algorithm is compared with an earlier algorithm addressing the same problem with similar assumptions. Finally, we provide a justification for our model motivated by a Cognitive Radio scenario and modify the algorithm for optimizing performance when information about the prior probabilities of occurrence of the two hypotheses is available.

Seismic response of reduced-scale modular block and rigid faced reinforced walls through shaking table tests

This paper focuses on understanding the seismic response of geosynthetic reinforced retaining walls through shaking table tests on models of modular block and rigid faced reinforced retaining walls. Reduced-scale models of retaining walls reinforced with geogrid layers were constructed in a laminar box mounted on a uniaxial shaking table and subjected to various levels of sinusoidal base shaking. Models were instrumented with ultrasonic displacement sensors, earth pressure sensors and accelerometers. Effects of backfill density, number of reinforcement layers and reinforcement type on the performance of rigid faced and modular block walls were studied through different series of model tests. Performances of the walls were assessed in terms of face deformations, crest settlement and acceleration amplification at different elevations and compared. Modular block walls performed better than the rigid faced walls for the same level of base shaking because of the additional support derived by stacking the blocks with an offset. Type and quantity of reinforcement has significant effect on the seismic performance of both the types of walls. Displacements are more sensitive to relative density of the backfill and decrease with increasing relative density, the effect being more pronounced in case of unreinforced walls compared to the reinforced ones. Acceleration amplifications are not affected by the wall facing and inclusion of reinforcement. (C) 2015 Elsevier Ltd. All rights reserved.

Effects of site stiffness and source to receiver distance on surface wave tests' results

By using six 4.5 Hz geophones, surface wave tests were performed on four different sites by dropping freely a 65 kg mass from a height of 5 m. The receivers were kept far away from the source to eliminate the arrival of body waves. Three different sources to nearest receiver distances (S), namely, 46 m, 56 m and 66 m, were chosen. Dispersion curves were drawn for all the sites. The maximum wavelength (lambda(max)), the maximum depth (d(max)) up to which exploration can be made and the frequency content of the signals depends on the site stiffness and the value of S. A stiffer site yields greater values of lambda(max) and d(max). For stiffer sites, an increase in S leads to an increase in lambda(max). The predominant time durations of the signals increase from stiffer to softer sites. An inverse analysis was also performed based on the stiffness matrix approach in conjunction with the maximum vertical flexibility coefficient of ground surface to establish the governing mode of excitation. For the Site 2, the results from the surface wave tests were found to compare reasonably well with that determined on the basis of cross boreholes seismic tests. (C) 2015 Elsevier Ltd. All rights reserved.

Dissecting Ubiquitin Folding Using the Self-Organized Polymer Model

Folding of Ubiquitin (Ub), a functionally important protein found in eukaryotic organisms, is investigated at low and neutral pH at different temperatures using simulations of the coarse-grained self-organized-polymer model with side chains (SOP-SC). The melting temperatures (T-m's), identified with the peaks in the heat capacity curves, decrease as pH decreases, in qualitative agreement with experiments. The calculated radius of gyration, showing dramatic variations with pH, is in excellent agreement with scattering experiments. At T-m Ub folds in a two-state manner at low and neutral pH. Clustering analysis of the conformations sampled in equilibrium folding trajectories at T-m with multiple transitions between the folded and unfolded states, shows a network of metastable states connecting the native and unfolded states. At low and neutral pH, Ub folds with high probability through a preferred set of conformations resulting in a pH-dependent dominant folding pathway. Folding kinetics reveal that Ub assembly at low pH occurs by multiple pathways involving a combination of nucleation-collapse and diffusion collision mechanism. The mechanism by which Ub folds is dictated by the stability of the key secondary structural elements responsible for establishing long-range contacts and collapse of Ub. Nucleation collapse mechanism holds if the stability of these elements are marginal, as would be the case at elevated temperatures. If the lifetimes associated with these structured microdomains are on the order of hundreds of microseconds, then Ub folding follows the diffusion collision mechanism with intermediates, many of which coincide with those found in equilibrium. Folding at neutral pH is a sequential process with a populated intermediate resembling that sampled at equilibrium. The transition state structures, obtained using a P-fold analysis, are homogeneous and globular with most of the secondary and tertiary structures being native-like. Many of our findings for both the thermodynamics and kinetics of folding are not only in agreement with experiments but also provide missing details not resolvable in standard experiments. The key prediction that folding mechanism varies dramatically with pH is amenable to experimental tests.

Multi-dimensional Goodness-of-Fit Tests for Spectrum Sensing Based on Stochastic Distances

In this paper, we study two multi-dimensional Goodness-of-Fit tests for spectrum sensing in cognitive radios. The multi-dimensional scenario refers to multiple CR nodes, each with multiple antennas, that record multiple observations from multiple primary users for spectrum sensing. These tests, viz., the Interpoint Distance (ID) based test and the h, f distance based tests are constructed based on the properties of stochastic distances. The ID test is studied in detail for a single CR node case, and a possible extension to handle multiple nodes is discussed. On the other hand, the h, f test is applicable in a multi-node setup. A robustness feature of the KL distance based test is discussed, which has connections with Middleton's class A model. Through Monte-Carlo simulations, the proposed tests are shown to outperform the existing techniques such as the eigenvalue ratio based test, John's test, and the sphericity test, in several scenarios.