A Protocol for Authentication with Multiple Levels of Anonymity (AMLA) in VANETs

The basic requirements for secure communication in a vehicular ad hoc network (VANET) are anonymous authentication with source non-repudiation and integrity. The existing security protocols in VANETs do not differentiate between the anonymity requirements of different vehicles and the level of anonymity provided by these protocols is the same for all the vehicles in a network. To provide high level of anonymity, the resource requirements of security protocol would also be high. Hence, in a resource constrained VANET, it is necessary to differentiate between the anonymity requirements of different vehicles and to provide the level of anonymity to a vehicle as per its requirement. In this paper, we have proposed a novel protocol for authentication which can provide multiple levels of anonymity in VANETs. The protocol makes use of identity based signature mechanism and pseudonyms to implement anonymous authentication with source non-repudiation and integrity. By controlling the number of pseudonyms issued to a vehicle and the lifetime of each pseudonym for a vehicle, the protocol is able to control the level of anonymity provided to a vehicle. In addition, the protocol includes a novel pseudonym issuance policy using which the protocol can ensure the uniqueness of a newly generated pseudonym by checking only a very small subset of the set of pseudonyms previously issued to all the vehicles. The protocol cryptographically binds an expiry date to each pseudonym, and in this way, enforces an implicit revocation for the pseudonyms. Analytical and simulation results confirm the effectiveness of the proposed protocol.

Behaviour simulation in computer aided product concept sketching

In the product conceptualization phase of design, sketches are often used for exploration of diverse behaviour patterns of the components to achieve the required functionality. This paper presents a method to animate the sketch produced using a tablet interface to aid verification of the desired behaviour. A sketch is a spatial organization of strokes whose perceptual organization helps one to visually interpret its components and their interconnections. A Gestalt based segmentation followed by interactive grouping and articulation, presented in this paper, enables one to use a mechanism simulation framework to animate the sketch in a “pick and drag” mode to visualize different configurations of the product and gain insight into the product’s behaviour.

Evaluation of the accuracy of an accelerometer response generated by axial impact loading

The basic objective in the present study is to show that for the most common configuration of an impactor system, an accelerometer cannot exactly reproduce the dynamic response of a specimen subject to impact loading. Assessment of the accelerometer mounted in a drop-weight impactor setup for an axially loaded specimen is done with the aid of an equivalent lumped parameter model (LPM) of the setup. A steel hat-type specimen under the impact loading is represented as a non-linear spring of varying stiffness, while the accelerometer is assumed to behave in a linear manner due to its high stiffness. A suitable numerical approach has been used to solve the non-linear governing equations for a 3 degrees-of-freedom system in a piece-wise linear manner. The numerical solution following an explicit time integration scheme is used to yield an excellent reproduction of the mechanical behavior of the specimen thereby confirming the accuracy of the numerical approach. The spring representing the accelerometer, however, predicts a response that qualitatively matches the assumed load–displacement response of the test specimen with a perceptibly lower magnitude of load.

Reduced Grobner bases and Macaulay-Buchberger Basis Theorem over Noetherian rings

In this paper, we extend the characterization of Zx]/(f), where f is an element of Zx] to be a free Z-module to multivariate polynomial rings over any commutative Noetherian ring, A. The characterization allows us to extend the Grobner basis method of computing a k-vector space basis of residue class polynomial rings over a field k (Macaulay-Buchberger Basis Theorem) to rings, i.e. Ax(1), ... , x(n)]/a, where a subset of Ax(1), ... , x(n)] is an ideal. We give some insights into the characterization for two special cases, when A = Z and A = ktheta(1), ... , theta(m)]. As an application of this characterization, we show that the concept of Border bases can be extended to rings when the corresponding residue class ring is a finitely generated, free A-module. (C) 2014 Elsevier B.V. All rights reserved.

Ideas generated in conceptual design and their effects on creativity

Search of design spaces to generate solutions affects the design outcomes during conceptual design. This research aims to understand the different types of search that occurs during conceptual design and their effect on the design outcomes. Additionally, we study the effect of other factors, such as creativity, problem-solving style, and experience of designers, on the design outcomes. Two sets of design experiments, with experienced and novice designers, are used in this study. We find that designers employ twelve different types of searches during conceptual design for problem understanding, solution generation, and solution evaluation activities. Results also suggest that creativity is influenced positively by the type and amount of searches, duration of designing, and experience of designers.

Generating Efficient Data Movement Code for Heterogeneous Architectures with Distributed-Memory

Programming for parallel architectures that do not have a shared address space is extremely difficult due to the need for explicit communication between memories of different compute devices. A heterogeneous system with CPUs and multiple GPUs, or a distributed-memory cluster are examples of such systems. Past works that try to automate data movement for distributed-memory architectures can lead to excessive redundant communication. In this paper, we propose an automatic data movement scheme that minimizes the volume of communication between compute devices in heterogeneous and distributed-memory systems. We show that by partitioning data dependences in a particular non-trivial way, one can generate data movement code that results in the minimum volume for a vast majority of cases. The techniques are applicable to any sequence of affine loop nests and works on top of any choice of loop transformations, parallelization, and computation placement. The data movement code generated minimizes the volume of communication for a particular configuration of these. We use a combination of powerful static analyses relying on the polyhedral compiler framework and lightweight runtime routines they generate, to build a source-to-source transformation tool that automatically generates communication code. We demonstrate that the tool is scalable and leads to substantial gains in efficiency. On a heterogeneous system, the communication volume is reduced by a factor of 11X to 83X over state-of-the-art, translating into a mean execution time speedup of 1.53X. On a distributed-memory cluster, our scheme reduces the communication volume by a factor of 1.4X to 63.5X over state-of-the-art, resulting in a mean speedup of 1.55X. In addition, our scheme yields a mean speedup of 2.19X over hand-optimized UPC codes.

A shortest path tree based algorithm for relay placement in a wireless sensor network and its performance analysis

In this paper, we study a problem of designing a multi-hop wireless network for interconnecting sensors (hereafter called source nodes) to a Base Station (BS), by deploying a minimum number of relay nodes at a subset of given potential locations, while meeting a quality of service (QoS) objective specified as a hop count bound for paths from the sources to the BS. The hop count bound suffices to ensure a certain probability of the data being delivered to the BS within a given maximum delay under a light traffic model. We observe that the problem is NP-Hard. For this problem, we propose a polynomial time approximation algorithm based on iteratively constructing shortest path trees and heuristically pruning away the relay nodes used until the hop count bound is violated. Results show that the algorithm performs efficiently in various randomly generated network scenarios; in over 90% of the tested scenarios, it gave solutions that were either optimal or were worse than optimal by just one relay. We then use random graph techniques to obtain, under a certain stochastic setting, an upper bound on the average case approximation ratio of a class of algorithms (including the proposed algorithm) for this problem as a function of the number of source nodes, and the hop count bound. To the best of our knowledge, the average case analysis is the first of its kind in the relay placement literature. Since the design is based on a light traffic model, we also provide simulation results (using models for the IEEE 802.15.4 physical layer and medium access control) to assess the traffic levels up to which the QoS objectives continue to be met. (C) 2014 Elsevier B.V. All rights reserved.

Rainbow Connection Number of Graph Power and Graph Products

Rainbow connection number, rc(G), of a connected graph G is the minimum number of colors needed to color its edges so that every pair of vertices is connected by at least one path in which no two edges are colored the same (note that the coloring need not be proper). In this paper we study the rainbow connection number with respect to three important graph product operations (namely the Cartesian product, the lexicographic product and the strong product) and the operation of taking the power of a graph. In this direction, we show that if G is a graph obtained by applying any of the operations mentioned above on non-trivial graphs, then rc(G) a parts per thousand currency sign 2r(G) + c, where r(G) denotes the radius of G and . In general the rainbow connection number of a bridgeless graph can be as high as the square of its radius 1]. This is an attempt to identify some graph classes which have rainbow connection number very close to the obvious lower bound of diameter (and thus the radius). The bounds reported are tight up to additive constants. The proofs are constructive and hence yield polynomial time -factor approximation algorithms.

Adaptive mesh generation for singularly perturbed fourth-order ordinary differential equations

In this paper, we consider a singularly perturbed boundary-value problem for fourth-order ordinary differential equation (ODE) whose highest-order derivative is multiplied by a small perturbation parameter. To solve this ODE, we transform the differential equation into a coupled system of two singularly perturbed ODEs. The classical central difference scheme is used to discretize the system of ODEs on a nonuniform mesh which is generated by equidistribution of a positive monitor function. We have shown that the proposed technique provides first-order accuracy independent of the perturbation parameter. Numerical experiments are provided to validate the theoretical results.

Simultaneous Perturbation Newton Algorithms for Simulation Optimization

We present a new Hessian estimator based on the simultaneous perturbation procedure, that requires three system simulations regardless of the parameter dimension. We then present two Newton-based simulation optimization algorithms that incorporate this Hessian estimator. The two algorithms differ primarily in the manner in which the Hessian estimate is used. Both our algorithms do not compute the inverse Hessian explicitly, thereby saving on computational effort. While our first algorithm directly obtains the product of the inverse Hessian with the gradient of the objective, our second algorithm makes use of the Sherman-Morrison matrix inversion lemma to recursively estimate the inverse Hessian. We provide proofs of convergence for both our algorithms. Next, we consider an interesting application of our algorithms on a problem of road traffic control. Our algorithms are seen to exhibit better performance than two Newton algorithms from a recent prior work.

Efficient Dictionary for Salted Password Analysis

User authentication is essential for accessing computing resources, network resources, email accounts, online portals etc. To authenticate a user, system stores user credentials (user id and password pair) in system. It has been an interested field problem to discover user password from a system and similarly protecting them against any such possible attack. In this work we show that passwords are still vulnerable to hash chain based and efficient dictionary attacks. Human generated passwords use some identifiable patterns. We have analysed a sample of 19 million passwords, of different lengths, available online and studied the distribution of the symbols in the password strings. We show that the distribution of symbols in user passwords is affected by the native language of the user. From symbol distributions we can build smart and efficient dictionaries, which are smaller in size and their coverage of plausible passwords from Key-space is large. These smart dictionaries make dictionary based attacks practical.

Rapid reduction of GO by hydrogen spill-over mechanism by in situ generated nanoparticles at room temperature and their catalytic performance towards 4-nitrophenol reduction and ethanol oxidation

Here, we report the clean and facile synthesis of Pt and Pd nanoparticles decorated on reduced graphene oxide (rGO) by the simultaneous reduction of graphene oxide (GO) and the metal ions in Mg/acid medium. As-generated Pt and Pd nanoparticles serve as a heterogeneous catalyst for the further reduction of the rGO by the hydrogen spill-over process. The C/O ratio is much higher as compared to the rGO obtained by the reduction of GO by only Mg/acid. Overall, the process is rapid, facile and green that does not require any toxic chemical agent or any rigorous chemical reactions. We perform the catalytic reduction of 4-nitophenol (4-NP) to 4-aminophenol (4-AP) at room temperature by Pd@rGO and Pt@rGO. The reduction is complete within 35 s for Pd@rGO and 60 s for Pt@rGO when 50 mu g of hybrid catalyst is used for 0.5 ml of 1 mM of 4-NP. In case of ethanol oxidation, the current density for Pd@rGO is comparable to commercial Pt/C but is doubled for Pt@rGO. Overall, both structures show highly stable catalytic activity compared to commercial Pt/C. (C) 2014 Elsevier B.V. All rights reserved.

The phenanthroimidazole-based dizinc(II) complex as a fluorescent probe for the pyrophosphate ion as generated in polymerase chain reactions and pyrosequencing

A highly selective and sensitive phenanthroimidazole tagged Mannich base type dizinc(II) fluorescent probe (R-Zn2+) has been developed for the pyrophosphate ion (PPi) with a very low limit of detection (LOD) of 0.25 ppm; this also assesses PPi from DNA polymerization chain reaction (PCR).

A Mild Protocol for the Regioselective Ring Opening of Doubly Activated Cyclopropanes by Using Selenolates Generated in Situ: Synthesis of Functionalized Organoselenium Compounds

A variety of functionalized organoselenium compounds were synthesized from doubly activated cyclopropanes and diselenides in the presence of sodium borohydride. A range of substituents were stable under these reaction conditions. Additionally, we extended the scope of the method by reducing nitro groups in the products to give the corresponding selenium-containing unnatural amino acids.

Energy Sharing for Multiple Sensor Nodes With Finite Buffers

We consider the problem of finding optimal energy sharing policies that maximize the network performance of a system comprising of multiple sensor nodes and a single energy harvesting (EH) source. Sensor nodes periodically sense the random field and generate data, which is stored in the corresponding data queues. The EH source harnesses energy from ambient energy sources and the generated energy is stored in an energy buffer. Sensor nodes receive energy for data transmission from the EH source. The EH source has to efficiently share the stored energy among the nodes to minimize the long-run average delay in data transmission. We formulate the problem of energy sharing between the nodes in the framework of average cost infinite-horizon Markov decision processes (MDPs). We develop efficient energy sharing algorithms, namely Q-learning algorithm with exploration mechanisms based on the epsilon-greedy method as well as upper confidence bound (UCB). We extend these algorithms by incorporating state and action space aggregation to tackle state-action space explosion in the MDP. We also develop a cross entropy based method that incorporates policy parameterization to find near optimal energy sharing policies. Through simulations, we show that our algorithms yield energy sharing policies that outperform the heuristic greedy method.