WebPut : Efficient web-based data imputation

In this paper, we present WebPut, a prototype system that adopts a novel web-based approach to the data imputation problem. Towards this, Webput utilizes the available information in an incomplete database in conjunction with the data consistency principle. Moreover, WebPut extends effective Information Extraction (IE) methods for the purpose of formulating web search queries that are capable of effectively retrieving missing values with high accuracy. WebPut employs a confidence-based scheme that efficiently leverages our suite of data imputation queries to automatically select the most effective imputation query for each missing value. A greedy iterative algorithm is also proposed to schedule the imputation order of the different missing values in a database, and in turn the issuing of their corresponding imputation queries, for improving the accuracy and efficiency of WebPut. Experiments based on several real-world data collections demonstrate that WebPut outperforms existing approaches.

Influence of eye rotation on peripheral eye length measurement obtained with a partial coherence interferometry instrument

Purpose The eye rotation approach for measuring peripheral eye length leads to concern about whether the rotation influences results, such as through pressure exerted by eyelids or extra-ocular muscles. This study investigated whether this approach is valid. Methods Peripheral eye lengths were measured with a Lenstar LS 900 biometer for eye rotation and no-eye rotation conditions (head rotation for horizontal meridian and instrument rotation for vertical meridian). Measurements were made for 23 healthy young adults along the horizontal visual field (±30°) and, for a subset of eight participants along the vertical visual field (±25°). To investigate the influence of the duration of eye rotation, for six participants measurements were made at 0, 60, 120, 180 and 210 s after eye rotation to ±30° along horizontal and vertical visual fields. Results Peripheral eye lengths were not significantly different for the conditions along the vertical meridian (F1,7 = 0.16, p = 0.71). The peripheral eye lengths for the conditions were significantly different along the horizontal meridian (F1,22 = 4.85, p = 0.04), although not at individual positions (p ≥ 0.10) and were not important. There were no apparent differences between the emmetropic and myopic groups. There was no significant change in eye length at any position after maintaining position for 210 s. Conclusion Eye rotation and no-eye rotation conditions were similar for measuring peripheral eye lengths along horizontal and vertical visual field meridians at ±30° and ±25°, respectively. Either condition can be used to estimate retinal shape from peripheral eye lengths.

A web-based approach to data imputation

In this paper, we present WebPut, a prototype system that adopts a novel web-based approach to the data imputation problem. Towards this, Webput utilizes the available information in an incomplete database in conjunction with the data consistency principle. Moreover, WebPut extends effective Information Extraction (IE) methods for the purpose of formulating web search queries that are capable of effectively retrieving missing values with high accuracy. WebPut employs a confidence-based scheme that efficiently leverages our suite of data imputation queries to automatically select the most effective imputation query for each missing value. A greedy iterative algorithm is proposed to schedule the imputation order of the different missing values in a database, and in turn the issuing of their corresponding imputation queries, for improving the accuracy and efficiency of WebPut. Moreover, several optimization techniques are also proposed to reduce the cost of estimating the confidence of imputation queries at both the tuple-level and the database-level. Experiments based on several real-world data collections demonstrate not only the effectiveness of WebPut compared to existing approaches, but also the efficiency of our proposed algorithms and optimization techniques.

Shared generation of pseudo-random functions

In Crypto’95, Micali and Sidney proposed a method for shared generation of a pseudo-random function f(·) among n players in such a way that for all the inputs x, any u players can compute f(x) while t or fewer players fail to do so, where 0⩽t

Shared generation of pseudo-random functions with cumulative maps

In Crypto’95, Micali and Sidney proposed a method for shared generation of a pseudo-random function f(·) among n players in such a way that for all the inputs x, any u players can compute f(x) while t or fewer players fail to do so, where 0 ≤ t < u ≤ n. The idea behind the Micali-Sidney scheme is to generate and distribute secret seeds S = s1, . . . , sd of a poly-random collection of functions, among the n players, each player gets a subset of S, in such a way that any u players together hold all the secret seeds in S while any t or fewer players will lack at least one element from S. The pseudo-random function is then computed as where f s i (·)’s are poly-random functions. One question raised by Micali and Sidney is how to distribute the secret seeds satisfying the above condition such that the number of seeds, d, is as small as possible. In this paper, we continue the work of Micali and Sidney. We first provide a general framework for shared generation of pseudo-random function using cumulative maps. We demonstrate that the Micali-Sidney scheme is a special case of this general construction.We then derive an upper and a lower bound for d. Finally we give a simple, yet efficient, approximation greedy algorithm for generating the secret seeds S in which d is close to the optimum by a factor of at most u ln 2.

Utilizing voting systems for ranking user tweets

Twitter is a very popular social network website that allows users to publish short posts called tweets. Users in Twitter can follow other users, called followees. A user can see the posts of his followees on his Twitter profile home page. An information overload problem arose, with the increase of the number of followees, related to the number of tweets available in the user page. Twitter, similar to other social network websites, attempts to elevate the tweets the user is expected to be interested in to increase overall user engagement. However, Twitter still uses the chronological order to rank the tweets. The tweets ranking problem was addressed in many current researches. A sub-problem of this problem is to rank the tweets for a single followee. In this paper we represent the tweets using several features and then we propose to use a weighted version of the famous voting system Borda-Count (BC) to combine several ranked lists into one. A gradient descent method and collaborative filtering method are employed to learn the optimal weights. We also employ the Baldwin voting system for blending features (or predictors). Finally we use the greedy feature selection algorithm to select the best combination of features to ensure the best results.

No laughing matter: Blaming the victim of online fraud

There is a strong sense of negativity associated with online fraud victimization. Despite an increasing awareness, understanding about the reality of victimization experiences is not apparent. Rather, victims of online fraud are constructed as greedy and gullible and there is an overwhelming sense of blame and responsibility levelled at them for the actions that led to their losses. This belief transcends both non-victims and victims. The existence of this victim-blaming discourse is significant. Based on interviews with 85 seniors across Queensland, Australia, who received fraudulent emails, this article establishes the victim-blaming discourse as an overwhelmingly powerful and controlling discourse about online fraud victimization. However, the article also examines how humour acts as a tool to reinforce this discourse by isolating victims and impacting on their ability to disclose to those around them. Identifying and challenging this victim-blaming discourse, as well as the role of humour and its social acceptance, is a first step in the facilitation of victim recovery and future well-being.

After the gold rush: Patent law and biological inventions

In response to scientific breakthroughs in biotechnology, the development of new technologies, and the demands of a hungry capitalist marketplace, patent law has expanded to accommodate a range of biological inventions. There has been much academic and public debate as to whether gene patents have a positive impact upon research and development, health-care, and the protection of the environment. In a satire of prevailing patenting practices, the English poet and part-time casino waitress, Donna MacLean, sought a patent application - GB0000180.0 - in respect of herself. She explained that she had satisfied the usual patent criteria - in that she was novel, inventive, and useful: It has taken 30 years of hard labor for me to discover and invent myself, and now I wish to protect my invention from unauthorized exploitation, genetic or otherwise. I am new: I have led a private existence and I have not made the invention of myself public. I am not obvious (2000: 18). MacLean said she had many industrial applications. ’For example, my genes can be used in medical research to extremely profitable ends - I therefore wish to have sole control of my own genetic material' (2000: 18). She observed in an interview: ’There's a kind of unpleasant, grasping, greedy atmosphere at the moment around the mapping of the human genome ... I wanted to see if a human being could protect their own genes in law' (Meek, 2000). This special issue of Law in Context charts a new era in the long-standing debate over biological inventions. In the wake of the expansion of patentable subject matter, there has been great strain placed upon patent criteria - such as ’novelty', ’inventive step', and ’utility'. Furthermore, there has been a new focus upon legal doctrines which facilitate access to patented inventions - like the defence of experimental use, the ’Bolar' exception, patent pooling, and compulsory licensing. There has been a concerted effort to renew patent law with an infusion of ethical principles dealing with informed consent and benefit sharing. There has also been a backlash against the commercialisation of biological inventions, and a call by some activists for the abolition of patents on genetic inventions. This collection considers a wide range of biological inventions - ranging from micro-organisms, plants and flowers and transgenic animals to genes, express sequence tags, and research tools, as well as genetic diagnostic tests and pharmaceutical drugs. It is thus an important corrective to much policy work, which has been limited in its purview to merely gene patents and biomedical research. This collection compares and contrasts the various approaches of a number of jurisdictions to the legal problems in respect of biological inventions. In particular, it looks at the complexities of the 1998 European Union Directive on the Legal Protection of Biotechnological Inventions, as well as decisions of member states, such as the Netherlands, and peripheral states, like Iceland. The edition considers US jurisprudence on patent law and policy, as well as recent developments in Canada. It also focuses upon recent developments in Australia - especially in the wake of parallel policy inquiries into gene patents and access to genetic resources.

Patent law and biological inventions

In response to scientific breakthroughs in biotechnology, the development of new technologies, and the demands of a hungry capitalist marketplace, patent law has expanded to accommodate a range of biological inventions. There has been much academic and public debate as to whether gene patents have a positive impact upon research and development, health-care, and the protection of the environment. In a satire of prevailing patenting practices, the English poet and part-time casino waitress, Donna MacLean, sought a patent application - GB0000180.0 - in respect of herself. She explained that she had satisfied the usual patent criteria - in that she was novel, inventive, and useful: It has taken 30 years of hard labor for me to discover and invent myself, and now I wish to protect my invention from unauthorized exploitation, genetic or otherwise. I am new: I have led a private existence and I have not made the invention of myself public. I am not obvious (2000: 18). MacLean said she had many industrial applications. 'For example, my genes can be used in medical research to extremely profitable ends - I therefore wish to have sole control of my own genetic material' (2000: 18). She observed in an interview: 'There's a kind of unpleasant, grasping, greedy atmosphere at the moment around the mapping of the human genome ... I wanted to see if a human being could protect their own genes in law' (Meek, 2000). This special issue of Law in Context charts a new era in the long-standing debate over biological inventions. In the wake of the expansion of patentable subject matter, there has been great strain placed upon patent criteria - such as 'novelty', 'inventive step', and 'utility'. Furthermore, there has been a new focus upon legal doctrines which facilitate access to patented inventions - like the defence of experimental use, the 'Bolar' exception, patent pooling, and compulsory licensing. There has been a concerted effort to renew patent law with an infusion of ethical principles dealing with informed consent and benefit sharing. There has also been a backlash against the commercialisation of biological inventions, and a call by some activists for the abolition of patents on genetic inventions. This collection considers a wide range of biological inventions - ranging from micro-organisms, plants and flowers and transgenic animals to genes, express sequence tags, and research tools, as well as genetic diagnostic tests and pharmaceutical drugs. It is thus an important corrective to much policy work, which has been limited in its purview to merely gene patents and biomedical research. This collection compares and contrasts the various approaches of a number of jurisdictions to the legal problems in respect of biological inventions. In particular, it looks at the complexities of the 1998 European Union Directive on the Legal Protection of Biotechnological Inventions, as well as decisions of member states, such as the Netherlands, and peripheral states, like Iceland. The edition considers US jurisprudence on patent law and policy, as well as recent developments in Canada. It also focuses upon recent developments in Australia - especially in the wake of parallel policy inquiries into gene patents and access to genetic resources.

Using genetic algorithm in profile-based assignment of applications to virtual machines for greener data centers

The increase in data center dependent services has made energy optimization of data centers one of the most exigent challenges in today's Information Age. The necessity of green and energy-efficient measures is very high for reducing carbon footprint and exorbitant energy costs. However, inefficient application management of data centers results in high energy consumption and low resource utilization efficiency. Unfortunately, in most cases, deploying an energy-efficient application management solution inevitably degrades the resource utilization efficiency of the data centers. To address this problem, a Penalty-based Genetic Algorithm (GA) is presented in this paper to solve a defined profile-based application assignment problem whilst maintaining a trade-off between the power consumption performance and resource utilization performance. Case studies show that the penalty-based GA is highly scalable and provides 16% to 32% better solutions than a greedy algorithm.

Enhanced sensitivity in detection of Kerr rotation by double modulation and time averaging based on Allan variance

Experiments in spintronics necessarily involve the detection of spin polarization. The sensitivity of this detection becomes an important factor to consider when extending the low temperature studies on semiconductor spintronic devices to room temperature, where the spin signal is weaker. In pump-probe experiments, which optically inject and detect spins, the sensitivity is often improved by using a photoelastic modulator (PEM) for lock-in detection. However, spurious signals can arise if diode lasers are used as optical sources in such experiments, along with a PEM. In this work, we eliminated the spurious electromagnetic coupling of the PEM onto the probe diode laser, by the double modulation technique. We also developed a test for spurious modulated interference in the pump-probe signal, due to the PEM. Besides, an order of magnitude enhancement in the sensitivity of detection of spin polarization by Kerr rotation, to 3x10(-8) rad was obtained by using the concept of Allan variance to optimally average the time series data over a period of 416 s. With these improvements, we are able to experimentally demonstrate at room temperature, photoinduced steady-state spin polarization in bulk GaAs. Thus, the advances reported here facilitate the use of diode lasers with a PEM for sensitive pump-probe experiments. They also constitute a step toward detection of spin-injection in Si at room temperature.

A frame-invariant scheme for the geometrically exact beam using rotation vector parametrization

While frame-invariant solutions for arbitrarily large rotational deformations have been reported through the orthogonal matrix parametrization, derivation of such solutions purely through a rotation vector parametrization, which uses only three parameters and provides a parsimonious storage of rotations, is novel and constitutes the subject of this paper. In particular, we employ interpolations of relative rotations and a new rotation vector update for a strain-objective finite element formulation in the material framework. We show that the update provides either the desired rotation vector or its complement. This rules out an additive interpolation of total rotation vectors at the nodes. Hence, interpolations of relative rotation vectors are used. Through numerical examples, we show that combining the proposed update with interpolations of relative rotations yields frame-invariant and path-independent numerical solutions. Advantages of the present approach vis-a-vis the updated Lagrangian formulation are also analyzed.

A Global Constraint On Relative Rotation To Avoid Lumped Compliant Mechanisms In Topology Optimization

Some of the well known formulations for topology optimization of compliant mechanisms could lead to lumped compliant mechanisms. In lumped compliance, most of the elastic deformation in a mechanism occurs at few points, while rest of the mechanism remains more or less rigid. Such points are referred to as point-flexures. It has been noted in literature that high relative rotation is associated with point-flexures. In literature we also find a formulation of local constraint on relative rotations to avoid lumped compliance. However it is well known that a global constraint is easier to handle than a local constraint, by a numerical optimization algorithm. The current work presents a way of putting global constraint on relative rotations. This constraint is also simpler to implement since it uses linearized rotation at the center of finite-elements, to compute relative rotations. I show the results obtained by using this constraint oil the following benchmark problems - displacement inverter and gripper.

NMR spectra of oriented biologically important molecules - The structure of and the internal rotation in N,N'-dimethyluracil

From the proton NMR spectra of Nfl-dimethyluracil oriented in two different nematic solvents, the internal rotation of the methyl groups about the N-C bonds is studied. It has been observed that the preferred conformation of the methyl group having one carbonyl in the vicinity is the one where a C-H bond is in the ring plane pointing toward the carbonyl group. The results are not sensitive to the mode of rotation of the other methyl group. These data are interpreted in terms of the bond polarizations.