An elementary proof of Sylvester’s double sums for subresultants

In 1853 Sylvester stated and proved an elegant formula that expresses the polynomial subresultants in terms of the roots of the input polynomials. Sylvester’s formula was also recently proved by Lascoux and Pragacz using multi-Schur functions and divided differences. In this paper, we provide an elementary proof that uses only basic properties of matrix multiplication and Vandermonde determinants.     

Exporting water wave optimization concepts to modified simulated annealing algorithm for size optimization of truss structures with natural frequency constraints

This paper proposes an improved version of a recently proposed modified simulated annealing algorithm (MSAA) named as an improved MSAA (I-MSAA) to tackle the size optimization of truss structures with frequency constraint. This kind of problem is problematic because its feasible region is non-convex while the boundaries are highly non-linear. The main motivation is to improve the exploitative behavior of MSAA, taking concept from water wave optimization metaheuristic (WWO). An interesting concept of WWO is its breaking operation. Thirty functions extracted from the CEC2014 test suite and four benchmark truss optimization problems with frequency constraints are explored for the validity of the proposed algorithm. Numerical results indicate that I-MSAA is more reliable, stable and efficient than those found by other existing metaheuristics in the literature.

     

A Taxonomy of Representation Strategies in Iconic Communication

Predicting whether the intended audience will be able to recognize the meaning of an icon or pictograph is not an easy task. Many icon recognition studies have been conducted in the past. However, their findings cannot be generalized to other icons that were not included in the study, which, we argue, is their main limitation. In this paper, we propose a comprehensive taxonomy of icons that is intended to enable the generalization of the findings of recognition studies. To accomplish this, we analyzed a sample of more than eight hundred icons according to three axes: lexical category, semantic category, and representation strategy. Three basic representation strategies were identified: visual similarity; semantic association; and arbitrary convention. These representation strategies are in agreement with the strategies identified in previous taxonomies. However, a greater number of subcategories of these strategies were identified. Our results also indicate that the lexical and semantic attributes of a concept influence the choice of representation strategy.     

Visual reasoning about social networks using centrality sensitivity

In this paper, we study the sensitivity of centrality metrics as a key metric of social networks to support visual reasoning. As centrality represents the prestige or importance of a node in a network, its sensitivity represents the importance of the relationship between this and all other nodes in the network. We have derived an analytical solution that extracts the sensitivity as the derivative of centrality with respect to degree for two centrality metrics based on feedback and random walks. We show that these sensitivities are good indicators of the distribution of centrality in the network, and how changes are expected to be propagated if we introduce changes to the network. These metrics also help us simplify a complex network in a way that retains the main structural properties and that results in trustworthy, readable diagrams. Sensitivity is also a key concept for uncertainty analysis of social networks, and we show how our approach may help analysts gain insight on the robustness of key network metrics. Through a number of examples, we illustrate the need for measuring sensitivity, and the impact it has on the visualization of and interaction with social and other scale-free networks.     

Model-based testing of software and systems: recent advances and challenges

Model-based testing is focused on testing techniques which rely on the use of models. The diversity of systems and software to be tested implies the need for research on a variety of models and methods for test automation. We briefly review this research area and introduce several papers selected from the 22nd International Conference on Testing Software and Systems (ICTSS).     

Word sense disambiguation for spam filtering

Spam has become a major issue in computer security because it is a channel for threats such as computer viruses, worms, and phishing. More than 86% of received e-mails are spam. Historical approaches to combating these messages, including simple techniques such as sender blacklisting or the use of e-mail signatures, are no longer completely reliable. Many current solutions feature machine-learning algorithms trained using statistical representations of the terms that most commonly appear in such e-mails. However, these methods are merely syntactic and are unable to account for the underlying semantics of terms within messages. In this paper, we explore the use of semantics in spam filtering by introducing a pre-processing step of Word Sense Disambiguation (WSD). Based upon this disambiguated representation, we apply several well-known machine-learning models and show that the proposed method can detect the internal semantics of spam messages.     

Note on the use of the term subject in pre-1886 discussions of thought-transference experiments.

In response to K. Danzinger's (see record 1986-00068-001) suggestion that the first use of the term subject in the English-language psychological literature occurred in 1886 in the context of experiments involving the hypnotic state, the present author points out that there are examples of the use of the term in discussions of experiments on thought transference published by the Society for Psychical Research in the 1880's. (8 ref) (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Electrospun fibers based on porcine plasma: a rheological and morphological study

Iranian Polymer Journal - The present work focuses on the assessment of the ability of porcine plasma protein (PPP) to be electrospun satisfactorily to form fibre mats, and their rheological and...     

Target Score—A Proteomics Data Selection Tool Applied to Esophageal Cancer Identifies GLUT1-Sialyl Tn Glycoforms as Biomarkers of Cancer Aggressiveness

Esophageal cancer (EC) is a life-threatening disease, demanding the discovery of new biomarkers and molecular targets for precision oncology. Aberrantly glycosylated proteins hold tremendous potential towards this objective. In the current study, a series of esophageal squamous cell carcinomas (ESCC) and EC-derived circulating tumor cells (CTCs) were screened by immunoassays for the sialyl-Tn (STn) antigen, a glycan rarely expressed in healthy tissues and widely observed in aggressive gastrointestinal cancers. An ESCC cell model was glycoengineered to express STn and characterized in relation to cell proliferation and invasion in vitro. STn was found to be widely present in ESCC (70% of tumors) and in CTCs in 20% of patients, being associated with general recurrence and reduced survival. Furthermore, STn expression in ESCC cells increased invasion in vitro, while reducing cancer cells proliferation. In parallel, an ESCC mass spectrometry-based proteomics dataset, obtained from the PRIDE database, was comprehensively interrogated for abnormally glycosylated proteins. Data integration with the Target Score, an algorithm developed in-house, pinpointed the glucose transporter type 1 (GLUT1) as a biomarker of poor prognosis. GLUT1-STn glycoproteoforms were latter identified in tumor tissues in patients facing worst prognosis. Furthermore, healthy human tissues analysis suggested that STn glycosylation provided cancer specificity to GLUT1. In conclusion, STn is a biomarker of worst prognosis in EC and GLUT1-STn glycoforms may be used to increase its specificity on the stratification and targeting of aggressive ESCC forms.     

Ivabradine Induces Cardiac Protection against Myocardial Infarction by Preventing Cyclophilin-A Secretion in Pigs under Coronary Ischemia/Reperfusion

In response to cardiac ischemia/reperfusion, proteolysis mediated by extracellular matrix metalloproteinase inducer (EMMPRIN) and its secreted ligand cyclophilin-A (CyPA) significantly contributes to cardiac injury and necrosis. Here, we aimed to investigate if, in addition to the effect on the funny current (I(f)), Ivabradine may also play a role against cardiac necrosis by reducing EMMPRIN/CyPA-mediated cardiac inflammation. In a porcine model of cardiac ischemia/reperfusion (IR), we found that administration of 0.3 mg/kg Ivabradine significantly improved cardiac function and reduced cardiac necrosis by day 7 after IR, detecting a significant increase in cardiac CyPA in the necrotic compared to the risk areas, which was inversely correlated with the levels of circulating CyPA detected in plasma samples from the same subjects. In testing whether Ivabradine may regulate the levels of CyPA, no changes in tissue CyPA were found in healthy pigs treated with 0.3 mg/kg Ivabradine, but interestingly, when analyzing the complex EMMPRIN/CyPA, rather high glycosylated EMMPRIN, which is required for EMMPRIN-mediated matrix metalloproteinase (MMP) activation and increased CyPA bonding to low-glycosylated forms of EMMPRIN were detected by day 7 after IR in pigs treated with Ivabradine. To study the mechanism by which Ivabradine may prevent secretion of CyPA, we first found that Ivabradine was time-dependent in inhibiting co-localization of CyPA with the granule exocytosis marker vesicle-associated membrane protein 1 (VAMP1). However, Ivabradine had no effect on mRNA expression nor in the proteasome and lysosome degradation of CyPA. In conclusion, our results point toward CyPA, its ligand EMMPRIN, and the complex CyPA/EMMPRIN as important targets of Ivabradine in cardiac protection against IR.