Sampling Search-Engine Results

We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approximate algorithms for several applications, such as:

Network visualization by semantic substrates

Networks have remained a challenge for information visualization designers because of the complex issues of node and link layout coupled with the rich set of tasks that users present. This paper offers a strategy based on two principles: (1) layouts are based on user-defined semantic substrates, which are non-overlapping regions in which node placement is based on node attributes, (2) users interactively adjust sliders to control link visibility to limit clutter and thus ensure comprehensibility of source and destination. Scalability is further facilitated by user control of which nodes are visible. We illustrate our semantic substrates approach as implemented in NVSS 1.0 with legal precedent data for up to 1122 court cases in three regions with 7645 legal citations     

Assessing T-Cell Immunity in Kidney Transplant Recipients with Absent Antibody Production after a 3rd Dose of the mRNA-1273 Vaccine

The vulnerable population of kidney transplant recipients (KTRs) are low responders to COVID-19 vaccines, so specific immune surveillance is needed. The interferon-gamma (IFN-γ) release assay (IGRA) is effective in assessing T cell-mediated immunity. We assessed SARS-CoV-2-directed T cell responses in KTRs with absent antibody production after a third dose of the mRNA-1273 vaccine, using two different IGRAs. A cohort of 57 KTRs, who were actively followed up, received a third dose of the mRNA-1273 vaccine. After the evaluation of humoral immunity to SARS-CoV-2, 14 seronegative patients were tested with two commercial IGRAs (SD Biosensor and Euroimmun). Out of 14 patients, one and three samples were positive by IGRAs with Euroimmun and SD Biosensor, respectively. The overall agreement between the two assays was 85.7% (κ = 0.444). In addition, multivariate linear regression analysis showed no statistically significant association between the IFN-γ concentration, and the independent variables analyzed (age, gender, years since transplant, total lymphocytes cells/mcl, CD3+ cells/mcl, CD3+ CD4+ cells/mcl, CD3+ CD8+ cells/mcl, CD19+ cells/mcl, CD3-CD16+CD56+ cells/mcl) (p > 0.01). In a vulnerable setting, assessing cellular immune response to complement the humoral response may be advantageous. Since the two commercial IGRAs showed a good agreement on negative samples, the three discordant samples highlight the need for further investigations.     

An artificial immune network for multiobjective optimization problems

Multiobjective optimization is an important problem of great complexity and evolutionary algorithms have been established as a dominant approach in the field. This article suggests a method for approximating the Pareto front of a given function based on artificial immune networks. The proposed method uses cloning and mutation on a population of antibodies to create local subsets of the Pareto front. Elements of these local fronts are combined, in a way that maximizes diversity, to form the complete Pareto front of the function. The method is tested on a number of well-known benchmark problems, as well as an engineering problem. Its performance is compared against state-of-the-art algorithms, yielding promising results.     

Efficient and flexible anonymization of transaction data

Transaction data are increasingly used in applications, such as marketing research and biomedical studies. Publishing these data, however, may risk privacy breaches, as they often contain personal information about individuals. Approaches to anonymizing transaction data have been proposed recently, but they may produce excessively distorted and inadequately protected solutions. This is because these approaches do not consider privacy requirements that are common in real-world applications in a realistic and flexible manner, and attempt to safeguard the data only against either identity disclosure or sensitive information inference. In this paper, we propose a new approach that overcomes these limitations. We introduce a rule-based privacy model that allows data publishers to express fine-grained protection requirements for both identity and sensitive information disclosure. Based on this model, we also develop two anonymization algorithms. Our first algorithm works in a top-down fashion, employing an efficient strategy to recursively generalize data with low information loss. Our second algorithm uses sampling and a combination of top-down and bottom-up generalization heuristics, which greatly improves scalability while maintaining low information loss. Extensive experiments show that our algorithms significantly outperform the state-of-the-art in terms of retaining data utility, while achieving good protection and scalability.     

Development and industrial application of soft sensors with on-line Bayesian model updating strategy

This paper deals with the issues associated with the development of data-driven models as well as model update strategy for soft sensor applications. A practical yet effective solution is proposed. Key process variables that are difficult to measure are commonly encountered in practice due to limitations of measurement techniques. Even with appropriate instruments, some measurements are only available through off-line laboratory analysis with typical sampling intervals of several hours. Soft sensors are inferential models that can provide continuous on-line prediction of hidden variables; such models are capable of combining real-time measurements with off-line lab data. Due to the prevalence of plant-model mismatch, it is important to update the model using the latest reference data. In this paper, parameters of data-driven models are estimated using particle filters under the framework of expectation–maximization (EM) algorithms. A Bayesian methodology for model calibration strategy is formulated. The proposed framework for soft sensor development is applied to an industrial process to provide on-line prediction of a quality variable.     

A global study of Kondepudi’s pitchfork

This model reaction, studied so effectively by Kondepudi and his co-workers, is transferred here to a stirred tank. It is shown that, though the rate constants for the two pathways are identical, the stable steady state can still be one in which one or the other pathway is favoured enormously. We are indebted for partial support to the National Science Foundation through heir grant CPE 8112292.     

Online pairing of VoIP conversations

This paper answers the following question; given a multiplicity of evolving 1-way conversations, can a machine or an algorithm discern the conversational pairs in an online fashion, without understanding the content of the communications? Our analysis indicates that this is possible, and can be achieved just by exploiting the temporal dynamics inherent in a conversation. We also show that our findings are applicable for anonymous and encrypted conversations over VoIP networks. We achieve this by exploiting the aperiodic inter-departure time of VoIP packets, hence trivializing each VoIP stream into a binary time-series, indicating the voice activity of each stream. We propose effective techniques that progressively pair conversing parties with high accuracy and in a limited amount of time. Our findings are verified empirically on a dataset consisting of 1,000 conversations. We obtain very high pairing accuracy that reaches 97% after 5 min of voice conversations. Using a modeling approach we also demonstrate analytically that our result can be extended over an unlimited number of conversations.