Repurposing Social Tagging Data for Extraction of Domain-level Concepts

The World Wide Web, the world¿s largest resource for information, has evolved from organizing information using controlled, top-down taxonomies to a bottom up approach that emphasizes assigning meaning to data via mechanisms such as the Social Web (Web 2.0). Tagging adds meta-data, (weak semantics) to the content available on the web. This research investigates the potential for repurposing this layer of meta-data. We propose a multi-phase approach that exploits user-defined tags to identify and extract domain-level concepts. We operationalize this approach and assess its feasibility by application to a publicly available tag repository. The paper describes insights gained from implementing and applying the heuristics contained in the approach, as well as challenges and implications of repurposing tags for extraction of domain-level concepts.

Robust power allocation algorithms for MIMO OFDM systems with imperfect CSI

This paper presents a Bayesian approach to the design of transmit prefiltering matrices in closed-loop schemes robust to channel estimation errors. The algorithms are derived for a multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) system. Two different optimizationcriteria are analyzed: the minimization of the mean square error and the minimization of the bit error rate. In both cases, the transmitter design is based on the singular value decomposition (SVD) of the conditional mean of the channel response, given the channel estimate. The performance of the proposed algorithms is analyzed,and their relationship with existing algorithms is indicated. As withother previously proposed solutions, the minimum bit error rate algorithmconverges to the open-loop transmission scheme for very poor CSI estimates.

Practical algorithms for a family of waterfilling solutions

Many engineering problems that can be formulatedas constrained optimization problems result in solutionsgiven by a waterfilling structure; the classical example is thecapacity-achieving solution for a frequency-selective channel.For simple waterfilling solutions with a single waterlevel and asingle constraint (typically, a power constraint), some algorithmshave been proposed in the literature to compute the solutionsnumerically. However, some other optimization problems result insignificantly more complicated waterfilling solutions that includemultiple waterlevels and multiple constraints. For such cases, itmay still be possible to obtain practical algorithms to evaluate thesolutions numerically but only after a painstaking inspection ofthe specific waterfilling structure. In addition, a unified view ofthe different types of waterfilling solutions and the correspondingpractical algorithms is missing.The purpose of this paper is twofold. On the one hand, itoverviews the waterfilling results existing in the literature from aunified viewpoint. On the other hand, it bridges the gap betweena wide family of waterfilling solutions and their efficient implementationin practice; to be more precise, it provides a practicalalgorithm to evaluate numerically a general waterfilling solution,which includes the currently existing waterfilling solutions andothers that may possibly appear in future problems.

Probabilistic algorithms for blind adaptive multiuser detection

In this paper, two probabilistic adaptive algorithmsfor jointly detecting active users in a DS-CDMA system arereported. The first one, which is based on the theory of hiddenMarkov models (HMM’s) and the Baum–Wech (BW) algorithm,is proposed within the CDMA scenario and compared withthe second one, which is a previously developed Viterbi-basedalgorithm. Both techniques are completely blind in the sense thatno knowledge of the signatures, channel state information, ortraining sequences is required for any user. Once convergencehas been achieved, an estimate of the signature of each userconvolved with its physical channel response (CR) and estimateddata sequences are provided. This CR estimate can be used toswitch to any decision-directed (DD) adaptation scheme. Performanceof the algorithms is verified via simulations as well as onexperimental data obtained in an underwater acoustics (UWA)environment. In both cases, performance is found to be highlysatisfactory, showing the near–far resistance of the analyzed algorithms.

Algorithms and cryptographic protocols using elliptic curves

En els darrers anys, la criptografia amb corbes el.líptiques ha adquirit una importància creixent, fins a arribar a formar part en la actualitat de diferents estàndards industrials. Tot i que s'han dissenyat variants amb corbes el.líptiques de criptosistemes clàssics, com el RSA, el seu màxim interès rau en la seva aplicació en criptosistemes basats en el Problema del Logaritme Discret, com els de tipus ElGamal. En aquest cas, els criptosistemes el.líptics garanteixen la mateixa seguretat que els construïts sobre el grup multiplicatiu d'un cos finit primer, però amb longituds de clau molt menor. Mostrarem, doncs, les bones propietats d'aquests criptosistemes, així com els requeriments bàsics per a que una corba sigui criptogràficament útil, estretament relacionat amb la seva cardinalitat. Revisarem alguns mètodes que permetin descartar corbes no criptogràficament útils, així com altres que permetin obtenir corbes bones a partir d'una de donada. Finalment, descriurem algunes aplicacions, com són el seu ús en Targes Intel.ligents i sistemes RFID, per concloure amb alguns avenços recents en aquest camp.

Generating highly balanced sudoku problems as hard problems

Sudoku problems are some of the most known and enjoyed pastimes, with a never diminishing popularity, but, for the last few years those problems have gone from an entertainment to an interesting research area, a twofold interesting area, in fact. On the one side Sudoku problems, being a variant of Gerechte Designs and Latin Squares, are being actively used for experimental design, as in [8, 44, 39, 9]. On the other hand, Sudoku problems, as simple as they seem, are really hard structured combinatorial search problems, and thanks to their characteristics and behavior, they can be used as benchmark problems for refining and testing solving algorithms and approaches. Also, thanks to their high inner structure, their study can contribute more than studies of random problems to our goal of solving real-world problems and applications and understanding problem characteristics that make them hard to solve. In this work we use two techniques for solving and modeling Sudoku problems, namely, Constraint Satisfaction Problem (CSP) and Satisfiability Problem (SAT) approaches. To this effect we define the Generalized Sudoku Problem (GSP), where regions can be of rectangular shape, problems can be of any order, and solution existence is not guaranteed. With respect to the worst-case complexity, we prove that GSP with block regions of m rows and n columns with m = n is NP-complete. For studying the empirical hardness of GSP, we define a series of instance generators, that differ in the balancing level they guarantee between the constraints of the problem, by finely controlling how the holes are distributed in the cells of the GSP. Experimentally, we show that the more balanced are the constraints, the higher the complexity of solving the GSP instances, and that GSP is harder than the Quasigroup Completion Problem (QCP), a problem generalized by GSP. Finally, we provide a study of the correlation between backbone variables – variables with the same value in all the solutions of an instance– and hardness of GSP.

Statistical modelling of CSP solving algorithms performance

The goal of this work is to try to create a statistical model, based only on easily computable parameters from the CSP problem to predict runtime behaviour of the solving algorithms, and let us choose the best algorithm to solve the problem. Although it seems that the obvious choice should be MAC, experimental results obtained so far show, that with big numbers of variables, other algorithms perfom much better, specially for hard problems in the transition phase.

The prevalence of child sexual abuse in community and student samples: A meta-analysis

Background: Studies conducted internationally confirm that child sexual abuse is a much more widespread problem than previously thought, with even the lowest prevalence rates including a large number of victims that need to be taken into account. Objective: To carry out a meta-analysis of the prevalence of child sexual abuse in order to establish an overall international figure. Methods: Studies were retrieved from various electronic databases. The measure of interest was the prevalence of abuse reported in each article, these values being combined via a random effects model. A detailed analysis was conducted of the effects of various moderator variables. Results: Sixty-five articles covering 22 countries were included. The analysis showed that 7.9% of men (7.4% without outliers) and 19.7% of women (19.2% without outliers) had suffered some form of sexual abuse prior to the age of eighteen. Conclusions: The results of the present meta-analysis indicate that child sexual abuse is a serious problem in the countries analysed.

All-sky search algorithms for monochromatic signals in bar gravitational wave detector data

In this paper we design and develop several filtering strategies for the analysis of data generated by a resonant bar gravitational wave (GW) antenna, with the goal of assessing the presence (or absence) therein of long-duration monochromatic GW signals, as well as the eventual amplitude and frequency of the signals, within the sensitivity band of the detector. Such signals are most likely generated in the fast rotation of slightly asymmetric spinning stars. We develop practical procedures, together with a study of their statistical properties, which will provide us with useful information on the performance of each technique. The selection of candidate events will then be established according to threshold-crossing probabilities, based on the Neyman-Pearson criterion. In particular, it will be shown that our approach, based on phase estimation, presents a better signal-to-noise ratio than does pure spectral analysis, the most common approach.

Efficacy of modern antipsychotics in placebo-controlled trials in bipolar depression: a meta-analysis.

Randomized, controlled trials have demonstrated efficacy for second-generation antipsychotics in the treatment of acute mania in bipolar disorder. Despite depression being considered the hallmark of bipolar disorder, there are no published systematic reviews or meta-analyses to evaluate the efficacy of modern atypical antipsychotics in bipolar depression. We systematically reviewed published or registered randomized, double-blind, placebo-controlled trials (RCTs) of modern antipsychotics in adult bipolar I and/or II depressive patients (DSM-IV criteria). Efficacy outcomes were assessed based on changes in the Montgomery-Asberg Depression Rating Scale (MADRS) during an 8-wk period. Data were combined through meta-analysis using risk ratio as an effect size with a 95% confidence interval (95% CI) and with a level of statistical significance of 5% (p<0.05). We identified five RCTs; four involved antipsychotic monotherapy and one addressed both monotherapy and combination with an antidepressant. The two quetiapine trials analysed the safety and efficacy of two doses: 300 and 600 mg/d. The only olanzapine trial assessed olanzapine monotherapy within a range of 5-20 mg/d and olanzapine-fluoxetine combination within a range of 5-20 mg/d and 6-12 mg/d, respectively. The two aripiprazole placebo-controlled trials assessed doses of 5-30 mg/d. Quetiapine and olanzapine trials (3/5, 60%) demonstrated superiority over placebo (p<0.001). Only 2/5 (40%) (both aripiprazole trials) failed in the primary efficacy measure after the first 6 wk. Some modern antipsychotics (quetiapine and olanzapine) have demonstrated efficacy in bipolar depressive patients from week 1 onwards. Rapid onset of action seems to be a common feature of atypical antipsychotics in bipolar depression. Comment in The following popper user interface control may not be accessible. Tab to the next button to revert the control to an accessible version.Destroy user interface controlEfficacy of modern antipsychotics in placebo-controlled trials in bipolar depression: a meta-analysis--results to be interpreted with caution.

Effects of unit - based pricing on the waste collection demand : a meta - regression analysis

We perform a meta - analysis of 21 studies that estimate the elasticity of the price of waste collection demand upon waste quantities, a prior literature review having revealed that the price elasticity differs markedly. Based on a meta - regression with a total of 65 observations, we find no indication that municipal data give higher estimates for price elasticities than those associated with household data. Furthermore, there is no evidence that treating prices as exogenous underestimates the price elasticity. We find that much of the variation can be explained by sample size, the use of a weight - based as opposed to a volume - based pricing system, and the pricing of compostable waste. We also show that price elasticities determined in the USA and point estimations of elasticities are more elastic, but these effects are not robust to the changing of model specifications. Finally, our tests show that there is no evidence of publication bias while there is some evidence of the existence of genuine empirical effect.

Singling out individual inventors from patent data

An increasing number of studies in recent years have sought to identify individual inventors from patent data. A variety of heuristics have been proposed for using the names and other information disclosed in patent documents to establish who is who in patents. This paper contributes to this literature by describing a methodology for identifying inventors using patents applied to the European Patent Office, EPO hereafter. As in much of this literature, we basically follow a threestep procedure : 1- the parsing stage, aimed at reducing the noise in the inventor’s name and other fields of the patent; 2- the matching stage, where name matching algorithms are used to group similar names; and 3- the filtering stage, where additional information and various scoring schemes are used to filter out these similarlynamed inventors. The paper presents the results obtained by using the algorithms with the set of European inventors applying to the EPO over a long period of time.

Symmetric or asymmetric gasoline prices? A meta-analysis approach

The analysis of price asymmetries in the gasoline market is one of the most studied in the energy economics literature. Nevertheless, the great variability of results makes it very difficult to extract conclusive results on the existence or not of asymmetries. This paper shows through a meta-analysis approach how the industry segment analysed, the quality and quantity of data, the estimator and the model used may explain this heterogeneity of results.

Question Waves: A multicast query routing algorithm for social search

This paper describes Question Waves, an algorithm that can be applied to social search protocols, such as Asknext or Sixearch. In this model, the queries are propagated through the social network, with faster propagation through more trustable acquaintances. Question Waves uses local information to make decisions and obtain an answer ranking. With Question Waves, the answers that arrive first are the most likely to be relevant, and we computed the correlation of answer relevance with the order of arrival to demonstrate this result. We obtained correlations equivalent to the heuristics that use global knowledge, such as profile similarity among users or the expertise value of an agent. Because Question Waves is compatible with the social search protocol Asknext, it is possible to stop a search when enough relevant answers have been found; additionally, stopping the search early only introduces a minimal risk of not obtaining the best possible answer. Furthermore, Question Waves does not require a re-ranking algorithm because the results arrive sorted

O6-Methylguanine-DNA methyltransferase protein expression by immunohistochemistry in brain and non-brain systemic tumours: systematic review and meta-analysis of correlation with methylation-specific polymerase chain reaction

Background: The DNA repair protein O6-Methylguanine-DNA methyltransferase (MGMT) confers resistance to alkylating agents. Several methods have been applied to its analysis, with methylation-specific polymerase chain reaction (MSP) the most commonly used for promoter methylation study, while immunohistochemistry (IHC) has become the most frequently used for the detection of MGMT protein expression. Agreement on the best and most reliable technique for evaluating MGMT status remains unsettled. The aim of this study was to perform a systematic review and meta-analysis of the correlation between IHC and MSP. Methods A computer-aided search of MEDLINE (1950-October 2009), EBSCO (1966-October 2009) and EMBASE (1974-October 2009) was performed for relevant publications. Studies meeting inclusion criteria were those comparing MGMT protein expression by IHC with MGMT promoter methylation by MSP in the same cohort of patients. Methodological quality was assessed by using the QUADAS and STARD instruments. Previously published guidelines were followed for meta-analysis performance. Results Of 254 studies identified as eligible for full-text review, 52 (20.5%) met the inclusion criteria. The review showed that results of MGMT protein expression by IHC are not in close agreement with those obtained with MSP. Moreover, type of tumour (primary brain tumour vs others) was an independent covariate of accuracy estimates in the meta-regression analysis beyond the cut-off value. Conclusions Protein expression assessed by IHC alone fails to reflect the promoter methylation status of MGMT. Thus, in attempts at clinical diagnosis the two methods seem to select different groups of patients and should not be used interchangeably.