Diffusion of fluid confined to nanotube with rectangular cross section

A dynamical model is proposed to study self-diffusion coefficient by confining the fluid in rectangular nanotube. The theoretical model is based on the consideration that the confinement affects the movement at atomic level. The model predicts that the diffusion parallel to walls of channel is different from that of diffusion perpendicular to the walls. Near the walls the dynamics of fluid has been found to slow down to an extent that below a certain value of ratio of width to the diameter of particle, the molecules behave as if these belong to solid. The results are contrasted with the result obtained from the model based on similar considerations for a fluid confined only in one direction. It is found that tendency of freezing near the wall increases due to confinement from second direction. Empirical relation which governs the behavior of diffusion coefficient as function of distance from the confining walls has also been proposed. The effect of confinement is more pronounced for denser fluids than for dilute fluid.     

Skyline and mapping aware join query evaluation

Growing interests in multi-criteria decision support applications have resulted in a flurry of efficient skyline algorithms. In practice, real-world decision support applications require to access data from disparate sources. Existing techniques define the skyline operation to work on a single set, and therefore, treat skylines as an “add-on” on top of a traditional Select-Project-Join query plan. In many real-world applications, the skyline dimensions can be anti-correlated such as the attribute pair {price, mileage} for cars and {price, distance} for hotels. Anti-correlated data are particularly challenging for skyline evaluation and therefore have commonly been ignored by existing techniques. In this work, we propose a robust execution framework called SKIN to evaluate skyline over joins. The salient features of SKIN are: (a) effective in reducing the two primary costs, namely the cost of generating the join results and the cost of dominance comparisons to compute the final skyline of join results, (b) shown to be robust for both skyline-friendly (independent and correlated) as well as skyline-unfriendly (anti-correlated) data distributions. SKIN is effective in exploiting the skyline knowledge in both local within individual data sources and across disparate sources—to significantly reduce the above-mentioned costs incurred during the evaluation of skyline over join. Our experimental study demonstrates the superiority of our proposed approach over state-of-the-art techniques to handle a wide variety of data distributions.     

Quintic nonpolynomial spline method for the solution of a second-order boundary-value problem with engineering applications

Nonpolynomial quintic spline functions are used to develop a numerical algorithm for computing an approximation to the solution of a system of second order boundary value problems associated with heat transfer. We show that the approximate solutions obtained by our algorithm are better than those produced by other spline and domain decomposition methods. A comparison of our algorithm with nonpolynomial quadratic spline method is discussed with the help of two numerical examples.     

The Network as a Storage Device: Dynamic Routing with Bounded Buffers

We study dynamic routing in store-and-forward packet networks where each network link has bounded buffer capacity for receiving incoming packets and is capable of transmitting a fixed number of packets per unit of time. At any moment in time, packets are injected at various network nodes with each packet specifying its destination node. The goal is to maximize the throughput, defined as the number of packets delivered to their destinations. In this paper, we make some progress on throughput maximization in various network topologies. Let n and m denote the number of nodes and links in the network, respectively. For line networks, we show that Nearest-to-Go (NTG), a natural distributed greedy algorithm, is -competitive, essentially matching a known lower bound on the performance of any greedy algorithm. We also show that if we allow the online routing algorithm to make centralized decisions, there is a randomized polylog(n)-competitive algorithm for line networks as well as for rooted tree networks, where each packet is destined for the root of the tree. For grid graphs, we show that NTG has a competitive ratio of while no greedy algorithm can achieve a ratio better than . Finally, for arbitrary network topologies, we show that NTG is -competitive, improving upon an earlier bound of O(mn). An extended abstract appeared in the Proceedings of the 8th Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005, Berkeley, CA, USA, pp. 1–13, Lecture Notes in Computer Science, vol. 1741, Springer, Berlin. S. Angelov is supported in part by NSF Career Award CCR-0093117, NSF Award ITR 0205456 and NIGMS Award 1-P20-GM-6912-1. S. Khanna is supported in part by an NSF Career Award CCR-0093117, NSF Award CCF-0429836, and a US-Israel Binational Science Foundation Grant. K. Kunal is supported in part by an NSF Career Award CCR-0093117 and NSF Award CCF-0429836.     

Quantification of crustal geotherms along with their error bounds for seismically active regions of India: A Matlab toolbox

Determination of the thermo-mechanical structure of the crust for seismically active regions using available geophysical and geological data is of great importance. The most important feature of the intraplate earthquakes in the Indian region are that the seismicity occurs within the entire crust. In Latur region of India an earthquake occurred in the upper crust. In such situations, quantifying the uncertainties in seismogenic depths becomes very important. The stochastic heat conduction equation has been solved for different sets of boundary conditions, an exponentially decreasing radiogenic heat generation and randomness in thermal conductivity. Closed form analytical expressions for mean and variance in the temperature depth distribution have been used and an automatic formulation has been developed in Matlab for computing and plotting the thermal structure. The Matlab toolbox presented allows us to display the controlling thermal parameters on the screen directly, and plot the subsurface thermal structure along with its error bounds. The software can be used to quantify the thermal structure for any given region and is applied here to the Latur earthquake region of India.     

Modelling microtubules in the brain as n-qudit quantum Hopfield network and beyond

The scientific approach to understand the nature of consciousness revolves around the study of the human brain. Neurobiological studies that compare the nervous system of different species have accorded the highest place to humans on account of various factors that include a highly developed cortical area comprising of approximately 100 billion neurons, that are intrinsically connected to form a highly complex network. Quantum theories of consciousness are based on mathematical abstraction and the Penrose–Hameroff Orch-OR theory is one of the most promising ones. Inspired by the Penrose–Hameroff Orch-OR theory, Behrman et al. have simulated a quantum Hopfield neural network with the structure of a microtubule. They have used an extremely simplified model of the tubulin dimers with each dimer represented simply as a qubit, a single quantum two-state system. The extension of this model to n-dimensional quantum states or n-qudits presented in this work holds considerable promise for even higher mathematical abstraction in modelling consciousness systems.     

Multi‐band pattern reconfigurable Yagi‐Uda antenna

In this study, novel designs of single‐band and tri‐band pattern reconfigurable antennas are proposed. The design of single‐band pattern reconfigurable antenna is accomplished by the use of varactor diodes with the parasitic elements placed on both sides of the driven conventional printed dipole antenna. By tuning the capacitance of varactor, the antenna operates in four different configurations of radiation pattern which include bi‐directional end‐fire, broadside, and uni‐directional end‐fire radiation patterns. The tri‐band pattern reconfigurable antenna design is achieved by the use of parasitic elements on both sides of a tri‐band driven dipole antenna. Dual‐band LC resonators are used as loading elements along the arms of printed dipole to get two lower order modes in addition to the reference dipole mode, resulting in a triband operation of the driven element. The electrical lengths of the parasitic elements with respect to the tri‐band driven element are controlled by suitably embedding varactor and PIN diodes with them. The proposed tri‐band antenna operates in ten different configurations of radiation patterns in the three operating bands. Fully functional prototypes of single‐band and tri‐band pattern reconfigurable antennas along with the DC bias networks have been fabricated to validate the results obtained in simulation.     

A blind medical image watermarking: DWT-SVD based robust and secure approach for telemedicine applications

Multimedia Tools and Applications - In this paper, a blind image watermarking scheme based on discrete wavelet transform (DWT) and singular value decomposition (SVD) is proposed. In this scheme,...     

A new representation and associated algorithms for generalized planning

Constructing plans that can handle multiple problem instances is a longstanding open problem in AI. We present a framework for generalized planning that captures the notion of algorithm-like plans and unifies various approaches developed for addressing this problem. Using this framework, and building on the TVLA system for static analysis of programs, we develop a novel approach for computing generalizations of classical plans by identifying sequences of actions that will make measurable progress when placed in a loop. In a wide class of problems that we characterize formally in the paper, these methods allow us to find generalized plans with loops for solving problem instances of unbounded sizes and also to determine the correctness and applicability of the computed generalized plans. We demonstrate the scope and scalability of the proposed approach on a wide range of planning problems.     

An improved timestamp-based remote user authentication scheme

To protect the remote server from various malicious attacks, many authentication schemes have been proposed. Some schemes have to maintain a password verification table in the remote server for checking the legitimacy of the login users. To overcome potential risks of verification tables, researchers proposed remote user authentication schemes using smartcard, in which the remote server only keeps a secret key for computing the user’s passwords and does not need any verification table for verifying legal user. In 2003 Shen, Lin, and Hwang proposed a timestamp-based password authentication scheme using smartcards in which the remote server does not need to store the passwords or verification table for user authentication. Unfortunately, this scheme is vulnerable to some deadly attacks. In this paper, we analyze few attacks and finally propose an improved timestamp-based remote user authentication scheme. The modified scheme is more efficient and secure than original scheme.