Skewed symmetry: A nonaccidental property used to perceive visual forms.

Mathematically, skewed symmetry is a nonaccidental property because it can be interpreted as bilateral symmetry in depth viewed from a nonorthogonal angle. To find out whether this is a useful property in the perception of visual forms, 4 experiments were designed in which the Ss had to determine whether 2 symmetric or random patterns were the same regardless of possible affine transformations between them. The results provided mixed evidence: Although there was always a large symmetry advantage, skewed symmetry was only perceived as bilateral symmetry in depth for dot patterns with higher order types of symmetry (Exp 1), when the dots were connected to form closed polygons (Exp 2 and 4), or when they were surrounded by a frame to enhance their planarity (Exp 3). In other cases, Ss relied on local groupings on the basis of proximity or curvilinearity, which are qualitatively affine invariant. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

High‐error approximate dictionary search using estimate hash comparisons

A method for finding all matches in a pre‐processed dictionary for a query string q and with at most k differences is presented. A very fast constant‐time estimate using hashes is presented. A tree structure is used to minimize the number of estimates made. Practical tests are performed, showing that the estimate can filter out 99% of the full comparisons for 40% error rates and dictionaries of up to four million words. The tree is found to be efficient up to a 50% error rate. Copyright © 2006 John Wiley & Sons, Ltd.     

Group codes on certain algebraic curves with many rational points

We construct a series of algebraic geometric codes using a class of curves which have many rational points. We obtain codes of lengthq ² over _q , whereq = 2q ₀ ² andq ₀ = 2 ⁿ , such that dimension + minimal distance q ² + 1 – q ₀ (q – 1). The codes are ideals in the group algebra _q [S], whereS is a Sylow-2-subgroup of orderq ² of the Suzuki-group of orderq ² (q ² + 1)(q – 1). The curves used for construction have in relation to their genera the maximal number of GF _q -rational points. This maximal number is determined by the explicit formulas of Weil and is effectively smaller than the Hasse—Weil bound.Supported by Deutsche Forschungsgemeinschaft while visiting Essen University     

Coverage-biased random exploration of large models and application to testing

This paper presents several randomised algorithms for generating paths in large models according to a given coverage criterion. Using methods for counting combinatorial structures, these algorithms can efficiently explore very large models, based on a graphical representation by an automaton or by a product of several automata. This new approach can be applied to random exploration in order to optimise path coverage and can be generalised to take into account other coverage criteria, via the definition of a notion of randomised coverage satisfaction. Our main contributions are a method for drawing paths uniformly at random in composed models, i.e. models that are given as products of automata, first without and then with synchronisation; a new efficient approach to draw paths at random taking into account some other coverage criterion. Experimental results show promising agreement with theoretical predictions and significant improvement over previous randomised approaches. This work opens new perspectives for future studies of statistical testing and model checking, mainly to fight the combinatorial explosion problem.     

Majority gates vs. general weighted threshold gates

In this paper we study small depth circuits that contain threshold gates (with or without weights) and parity gates. All circuits we consider are of polynomial size. We prove several results which complete the work on characterizing possible inclusions between many classes defined by small depth circuits. These results are the following:

iPSC-Cardiomyocyte Models of Brugada Syndrome—Achievements,Challenges and Future Perspectives

Brugada syndrome (BrS) is an inherited cardiac arrhythmia that predisposes to ventricular fibrillation and sudden cardiac death. It originates from oligogenic alterations that affect cardiac ion channels or their accessory proteins. The main hurdle for the study of the functional effects of those variants is the need for a specific model that mimics the complex environment of human cardiomyocytes. Traditionally, animal models or transient heterologous expression systems are applied for electrophysiological investigations, each of these models having their limitations. The ability to create induced pluripotent stem cell-derived cardiomyocytes (iPSC-CMs), providing a source of human patient-specific cells, offers new opportunities in the field of cardiac disease modelling. Contemporary iPSC-CMs constitute the best possible in vitro model to study complex cardiac arrhythmia syndromes such as BrS. To date, thirteen reports on iPSC-CM models for BrS have been published and with this review we provide an overview of the current findings, with a focus on the electrophysiological parameters. We also discuss the methods that are used for cell derivation and data acquisition. In the end, we critically evaluate the knowledge gained by the use of these iPSC-CM models and discuss challenges and future perspectives for iPSC-CMs in the study of BrS and other arrhythmias.     

SUL-151 Decreases Airway Neutrophilia as a Prophylactic and Therapeutic Treatment in Mice after Cigarette Smoke Exposure

Chronic obstructive pulmonary disease (COPD) caused by cigarette smoke (CS) is featured by oxidative stress and chronic inflammation. Due to the poor efficacy of standard glucocorticoid therapy, new treatments are required. Here, we investigated whether the novel compound SUL-151 with mitoprotective properties can be used as a prophylactic and therapeutic treatment in a murine CS-induced inflammation model. SUL-151 (4 mg/kg), budesonide (500 μg/kg), or vehicle were administered via oropharyngeal instillation in this prophylactic and therapeutic treatment setting. The number of immune cells was determined in the bronchoalveolar lavage fluid (BALF). Oxidative stress response, mitochondrial adenosine triphosphate (ATP) production, and mitophagy-related proteins were measured in lung homogenates. SUL-151 significantly decreased more than 70% and 50% of CS-induced neutrophils in BALF after prophylactic and therapeutic administration, while budesonide showed no significant reduction in neutrophils. Moreover, SUL-151 prevented the CS-induced decrease in ATP and mitochondrial mtDNA and an increase in putative protein kinase 1 expression in the lung homogenates. The concentration of SUL-151 was significantly correlated with malondialdehyde level and radical scavenging activity in the lungs. SUL-151 inhibited the increased pulmonary inflammation and mitochondrial dysfunction in this CS-induced inflammation model, which implied that SUL-151 might be a promising candidate for COPD treatment.     

Inclusion/Exclusion Meets Measure and Conquer

Inclusion/exclusion and measure and conquer are two central techniques from the field of exact exponential-time algorithms that recently received a lot of attention. In this paper, we show that both techniques can be used in a single algorithm. This is done by looking at the principle of inclusion/exclusion as a branching rule. This inclusion/exclusion-based branching rule can be combined in a branch-and-reduce algorithm with traditional branching rules and reduction rules. The resulting algorithms can be analysed using measure and conquer allowing us to obtain good upper bounds on their running times. In this way, we obtain the currently fastest exact exponential-time algorithms for a number of domination problems in graphs. Among these are faster polynomial-space and exponential-space algorithms for #Dominating Set and Minimum Weight Dominating Set (for the case where the set of possible weight sums is polynomially bounded), and a faster polynomial-space algorithm for Domatic Number. This approach is also extended in this paper to the setting where not all requirements in a problem need to be satisfied. This results in faster polynomial-space and exponential-space algorithms for Partial Dominating Set, and faster polynomial-space and exponential-space algorithms for the well-studied parameterised problem k-Set Splitting and its generalisation k-Not-All-Equal Satisfiability.