Worst-case optimal algorithm for XPath evaluation over XML streams

We consider the XPath evaluation problem: Evaluate an XPath query Q on a streaming XML document D; i.e., determine the set Q(D) of document elements selected by Q. We mainly consider Conjunctive XPath queries that involve only the child and descendant axes. Previously known in-memory algorithms for this problem use O(|D|) space and O(|Q||D|) time. Several previously known algorithms for the streaming version use Ω(dn) space and Ω(dn|D|) time in the worst case; d denotes the depth of D, and n denotes the number of location steps in Q. Their exponential space requirement could well exceed the O(|D|) space used by the in-memory algorithms. We present an efficient algorithm that uses O(d|Q|+nc) space and O((|Q|+dn)|D|) time in the worst case; c denotes the maximum number of elements of D that can be candidates for output, at any one instant. For some worst case Q and D, the memory space used by our algorithm matches our lower bound proved in a different paper; so, our algorithm uses optimal memory space in the worst case.     

A survey and taxonomy on energy efficient resource allocation techniques for cloud computing systems

In a cloud computing paradigm, energy efficient allocation of different virtualized ICT resources (servers, storage disks, and networks, and the like) is a complex problem due to the presence of heterogeneous application (e.g., content delivery networks, MapReduce, web applications, and the like) workloads having contentious allocation requirements in terms of ICT resource capacities (e.g., network bandwidth, processing speed, response time, etc.). Several recent papers have tried to address the issue of improving energy efficiency in allocating cloud resources to applications with varying degree of success. However, to the best of our knowledge there is no published literature on this subject that clearly articulates the research problem and provides research taxonomy for succinct classification of existing techniques. Hence, the main aim of this paper is to identify open challenges associated with energy efficient resource allocation. In this regard, the study, first, outlines the problem and existing hardware and software-based techniques available for this purpose. Furthermore, available techniques already presented in the literature are summarized based on the energy-efficient research dimension taxonomy. The advantages and disadvantages of the existing techniques are comprehensively analyzed against the proposed research dimension taxonomy namely: resource adaption policy, objective function, allocation method, allocation operation, and interoperability.     

Two-echelon fuzzy stochastic supply chain for the manufacturer–buyer integrated production–inventory system

This paper deals with two-echelon integrated procurement production model for the manufacturer and the buyer integrated inventory system. The manufacturer procures raw material from outside suppliers (not a part of supply chain) then proceed to convert it as finished product, and finally delivers to the buyer, who faces imprecise and uncertain, called fuzzy random demand of customers. The manufacturer and the buyer work under joint channel, in which a centralized decision maker makes all decisions to optimize the joint total relevant cost (JTRC) of entire supply chain. In this account, in one production cycle of the manufacturer we determine an optimal multi-ordering policy for the buyer. To be part of this, we first derive the JTRC in stochastic framework, and then extend it in fuzzy stochastic environment. In order to scalarize the fuzzy stochastic JTRC, we use an evaluation method wherein randomness is estimated by probabilistic expectation and fuzziness is estimated by possibilistic mean based on possibility evaluation measure. To derive the optimal policies for both parties, an algorithm is proposed. A numerical illustration addresses the situations of paddy procurement, conversion to rice and fulfillment of uncertain demand of rice. Furthermore, sensitivity of parameters is examined to illustrate the model and algorithm.     

Tri‐band composite cylindrical dielectric resonator antenna with hybrid mode excitation and cross‐polarization suppression

This communication investigates composite cylindrical dielectric resonator antenna (CDRA) for various wireless applications. Three important features of proposed antenna design are (i) realization of two different hybrid modes, that is, HEM_11δ and HEM_12δ mode in CDRA with the help of modified annular ring printed line (work as both magnetic dipole and electric dipole), both the hybrid modes support broadside radiation characteristics (ii) suppression of HEM_21δ mode, in order to reduce the cross‐polarization level in H‐plane of other hybrid modes (HEM_11δ and HEM_12δ mode) by an amount of 8‐10 dB (iii) creation of triple‐band attribute using the concept of composite antenna. The proposed antenna design has been fabricated and practically tested. Simulated outcomes show good agreement with measured outcomes. It works in three frequency bands, that is, 2.25‐2.79 GHz, 3.1‐4.0 GHz, and 5.05‐5.6 GHz. The designed antenna structure is appropriate for WLAN and WiMAX applications.     

A novel bacterial foraging technique for edge detection

A new approach for edge detection using a combination of bacterial foraging algorithm (BFA) and probabilistic derivative technique derived from Ant Colony Systems, is presented in this paper. The foraging behavior of some species of bacteria like Escherichia coli can be hypothetically modeled as an optimization process. A group of bacteria search for nutrients in a way that maximizes the energy obtained per unit time spent during the foraging. The proposed approach aims at driving the bacteria through the edge pixels. The direction of movement of the bacteria is found using a direction probability matrix, computed using derivatives along the possible directions. Rules defining the derivatives are devised to ensure that the variation of intensity due to noise is discarded. Quantitative analysis of the feasibility of the proposed approach and its comparison with other standard edge detection operators in terms of kappa and entropy are given. The effect of initial values of parameters of BFA on the edge detection is discussed.     

Distributed Symbolic Bounded Property Checking

In this paper we describe an algorithm for distributed, BDD-based bounded property checking and its implementation in the verification tool SymC. The distributed algorithm verifies larger models and returns results faster than the sequential version.The core algorithm distributes partitions of the state set to computation nodes after reaching a threshold size. The nodes proceed with image computation on the nodes asynchronously. The main scalability problem of this scheme is the overlap of state set partitions. We present static and dynamic overlap reduction techniques.     

Beta-hairpins with native-like and non-native hydrogen bonding patterns could form during the refolding of staphylococcal nuclease

Refolding of staphylococcal nuclease has been studied recently by hydrogen-deuterium exchange and NMR spectroscopy. These studies infer that beta-hairpin formed by strand 2 and strand 3 connected by reverse turn forms early during the refolding of nuclease. Typically, hydrogen-deuterium exchange NMR techniques are usually carried out on a time scale of milliseconds whereas beta-hairpins are known to fold on a much shorter time scale. It follows that in the experiments, the hydrogen-deuterium exchange protection patterns could be arising from a significant population of fully formed hairpins. In order to demonstrate it is the fully formed hairpins which gives rise to the hydrogen-deuterium exchange protection patterns, we have considered molecular dynamics simulation of the peptide (21)DTVKLMYKGQPMTFR(35) from staphylococcal nuclease corresponding to the beta-hairpin region, using GROMOS96 force field under NVT conditions. Starting from unfolded conformational states, the peptide folds into hairpin conformations with native-like and non-native hydrogen bonding patterns. Subsequent to folding, equilibrium conditions prevail. The computed protection factors and atom depth values, at equilibrium, of the various amide protons agree qualitatively with experimental observations. A collection of molecules following the trajectories observed in the simulations can account for experimental observations. These simulations provide a molecular picture of the formed hairpins and their conformational features during the refolding experiments on nuclease, monitored by hydrogen-deuterium exchange.     

A theoretical and empirical investigation of multi‐item on‐line auctions

In this paper we explore and analyze the structure of Internet auctions from an analytical and an empirical perspective. Such web‐based auctions are rapidly emerging as a mercantile process of choice in the electronic marketplace. We observe current Internet auctions for one‐time products, such as rapidly aging hardware, and analyze them within the framework of the existing auction theory. While traditional auction theory focuses on single‐item auctions, we observe that a majority of on‐line auctions are multi‐item auctions. A significant contribution of this work is the theoretical derivation of the structure of the winning bids in multi‐item progressive on‐line auctions. Additionally, for comparative purposes, we explore the structural characteristics of alternative multi‐item auction mechanisms proposed in the auction theory. We derive hypotheses based on our analytical results and compare two different types of auction mechanisms. We test the traditional auction theory assumption regarding the homogeneity of bidders and present the first ever empirically derived classification and performance‐comparison of on‐line bidders. We test our hypotheses using real‐world empirical data obtained by tracking a premier web‐based auction site. Statistical analysis of the data indicates that firms may gain by choosing alternative auction mechanisms. We also provide directions for further exploration of this emerging but important dimension of electronic commerce. This revised version was published online in July 2006 with corrections to the Cover Date.