Write-limited sorts and joins for persistent memory

To mitigate the impact of the widening gap between the memory needs of CPUs and what standard memory technology can deliver, system architects have introduced a new class of memory technology termed persistent memory. Persistent memory is byteaddressable, but exhibits asymmetric I/O: writes are typically one order of magnitude more expensive than reads. Byte addressability combined with I/O asymmetry render the performance profile of persistent memory unique. Thus, it becomes imperative to find new ways to seamlessly incorporate it into database systems. We do so in the context of query processing. We focus on the fundamental operations of sort and join processing. We introduce the notion of write-limited algorithms that effectively minimize the I/O cost. We give a high-level API that enables the system to dynamically optimize the workflow of the algorithms; or, alternatively, allows the developer to tune the write profile of the algorithms. We present four different techniques to incorporate persistent memory into the database processing stack in light of this API. We have implemented and extensively evaluated all our proposals. Our results show that the algorithms deliver on their promise of I/O-minimality and tunable performance. We showcase the merits and deficiencies of each implementation technique, thus taking a solid first step towards incorporating persistent memory into query processing. 1

Universality of dispersive spin-resonance mode in superconducting BaFe2As2

Spin fluctuations in superconducting BaFe2(As1-xPx)2 (x=0.34, Tc = 29.5 K) are studied using inelastic neutron scattering. Well-defined commensurate magnetic signals are observed at ({\pi},0), which is consistent with the nesting vector of the Fermi surface. Antiferromagnetic (AFM) spin fluctuations in the normal state exhibit a three-dimensional character reminiscent of the AFM order in nondoped BaFe2As2. A clear spin gap is observed in the superconducting phase forming a peak whose energy is significantly dispersed along the c-axis. The bandwidth of dispersion becomes larger with approaching the AFM ordered phase universally in all superconducting BaFe2As2, indicating that the dispersive feature is attributed to three-dimensional AFM correlations. The results suggest a strong relationship between the magnetism and superconductivity.Comment: 5 pages, 5 figure

Dynamics of Tunneling Centers in Metallic Systems

Dynamics of tunneling centers (TC) in metallic systems is studied, using the technique of bosonization. The interaction of the TC with the conduction electrons of the metal involves two processes, namely, the screening of the TC by electrons, and the so-called electron assisted tunneling. The presence of the latter process leads to a different form of the renormalized tunneling frequency of the TC, and the tunneling motion is damped with a temperature dependent relaxation rate. As the temperature is lowered, the relaxation rate per temperature shows a steep rise as opposed to that in the absence of electron assisted process. It is expected that this behavior should be observed at very low temperatures in a careful experiment. The present work thus tries to go beyond the existing work on the {\it dynamics} of a two-level system in metals, by treating the electron assisted process.Comment: REVTeX twocolumn format, 5 pages, two PostScript figures available on request. Preprint # : imsc 94/3

CoGrasp: 6-DoF Grasp Generation for Human-Robot Collaboration

Robot grasping is an actively studied area in robotics, mainly focusing on the quality of generated grasps for object manipulation. However, despite advancements, these methods do not consider the human-robot collaboration settings where robots and humans will have to grasp the same objects concurrently. Therefore, generating robot grasps compatible with human preferences of simultaneously holding an object becomes necessary to ensure a safe and natural collaboration experience. In this paper, we propose a novel, deep neural network-based method called CoGrasp that generates human-aware robot grasps by contextualizing human preference models of object grasping into the robot grasp selection process. We validate our approach against existing state-of-the-art robot grasping methods through simulated and real-robot experiments and user studies. In real robot experiments, our method achieves about 88\% success rate in producing stable grasps that also allow humans to interact and grasp objects simultaneously in a socially compliant manner. Furthermore, our user study with 10 independent participants indicated our approach enables a safe, natural, and socially-aware human-robot objects' co-grasping experience compared to a standard robot grasping technique

Combined Banzhaf & Diversity Index (CBDI) for critical node detection

Critical node discovery plays a vital role in assessing the vulnerability of a computer network to malicious attacks and failures and provides a useful tool with which one can greatly improve network security and reliability. In this paper, we propose a new metric to characterize the criticality of a node in an arbitrary computer network which we refer to as the Combined Banzhaf & Diversity Index (CBDI). The metric utilizes a diversity index which is based on the variability of a node׳s attributes relative to its neighbours and the Banzhaf power index which characterizes the degree of participation of a node in forming shortest paths. The Banzhaf power index is inspired from the theory of voting games in game theory. The proposed metric is evaluated using analysis and simulations. The criticality of nodes in a network is assessed based on the degradation in network performance achieved when these nodes are removed. We use several performance metrics to evaluate network performance including the algebraic connectivity which is a spectral metric characterizing the connectivity robustness of the network. Extensive simulations in a number of network topologies indicate that the proposed CBDI index chooses more critical nodes which, when removed, degrade network performance to a greater extent than if critical nodes based on other criticality metrics were removed

Spectral Partitioning for Node Criticality

Finding critical nodes in a network is a significant task, highly relevant to network vulnerability and security. We consider the node criticality problem as an algebraic connectivity minimization problem where the objective is to choose nodes which minimize the algebraic connectivity of the resulting network. Previous suboptimal solutions of the problem suffer from the computational complexity associated with the implementation of a maximization consensus algorithm. In this work, we use spectral partitioning concepts introduced by Fiedler, to propose a new suboptimal solution which significantly reduces the implementation complexity. Our approach, combined with recently proposed distributed Fiedler vector calculation algorithms enable each node to decide by itself whether it is a critical node. If a single node is required then the maximization algorithm is applied on a restricted set of nodes within the network. We derive a lower bound for the achievable algebraic connectivity when nodes are removed from the network and we show through simulations that our approach leads to algebraic connectivity values close to this lower bound. Similar behaviour is exhibited by other approaches at the expense, however, of a higher implementation complexity

Toric rings, inseparability and rigidity

This article provides the basic algebraic background on infinitesimal deformations and presents the proof of the well-known fact that the non-trivial infinitesimal deformations of a $K$-algebra $R$ are parameterized by the elements of cotangent module $T^1(R)$ of $R$. In this article we focus on deformations of toric rings, and give an explicit description of $T^1(R)$ in the case that $R$ is a toric ring. In particular, we are interested in unobstructed deformations which preserve the toric structure. Such deformations we call separations. Toric rings which do not admit any separation are called inseparable. We apply the theory to the edge ring of a finite graph. The coordinate ring of a convex polyomino may be viewed as the edge ring of a special class of bipartite graphs. It is shown that the coordinate ring of any convex polyomino is inseparable. We introduce the concept of semi-rigidity, and give a combinatorial description of the graphs whose edge ring is semi-rigid. The results are applied to show that for $m-k=k=3$, $G_{k,m-k}$ is not rigid while for $m-k\geq k\geq 4$, $G_{k,m-k}$ is rigid. Here $G_{k,m-k}$ is the complete bipartite graph $K_{m-k,k}$ with one edge removed.Comment: 33 pages, chapter 2 of the Book << Multigraded Algebra and Applications>> 2018, Springer International Publishing AG, part of Springer Natur

An alternative explanation for the density depletions observed by Freja and Viking satellites

In this paper, we have studied the linear and nonlinear propagation of ion acoustic waves in the presence of electrons that follow the generalized (r,q) distribution. It has been shown that for positive values of r, which correspond to a flat-topped electron velocity distribution, the nonlinear ion acoustic waves admit rarefactive solitary structures or density depletions. It has been shown that the generalized (r,q) distribution function provides another way to explicate the density depletions observed by Freja and Viking satellites previously explained by proposing Cairns distribution function.In this paper, we have studied the linear and nonlinear propagation of ion acoustic waves in the presence of electrons that follow the generalized (r,q) distribution. It has been shown that for positive values of r, which correspond to a flat-topped electron velocity distribution, the nonlinear ion acoustic waves admit rarefactive solitary structures or density depletions. It has been shown that the generalized (r,q) distribution function provides another way to explicate the density depletions observed by Freja and Viking satellites previously explained by proposing Cairns distribution function

Beaconless Packet Forwarding Approach for Vehicular Urban Environment

Existing wireless technologies provide communication and information services to all fields of life. The one of the emerging and popular field is vehicular ad hoc networks, with its unique characteristics and highly mobile environment. Different types of routing protocols have been proposed to address the routing issues in network and one of the most efficient types is geographical routing. In this type of protocols, the beacon messages are using to update the node locations and positions. However, these protoocls have been suffered with high channel congestion issue in the network. To this end, we propose a beaconless packet forwarding strategy based on modified handshake messages mechanism. The protocol uses some realistic metrics to select the next forwarder node such as forward progresss and link quality. The protocol performance is evaluated with existing beacon and beaconless geographical routing protocols. The simulation results showed the better performance of the proposed protocol in terms of packet delay and data delivery ratio in realistic wireless channel conditions