What Good IS This Organization? A Member of the Board of Governors Has a Constructive Suggestion to Offer

This is your Bar Association—your Convention. It offers you an opportunity to meet your brother lawyers, discuss your problems, and show your Board of Governors what policies you wish them to follow

Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem

The Algebraic Dichotomy Conjecture states that the Constraint Satisfaction Problem over a fixed template is solvable in polynomial time if the algebra of polymorphisms associated to the template lies in a Taylor variety, and is NP-complete otherwise. This paper provides two new characterizations of finitely generated Taylor varieties. The first characterization is using absorbing subalgebras and the second one cyclic terms. These new conditions allow us to reprove the conjecture of Bang-Jensen and Hell (proved by the authors) and the characterization of locally finite Taylor varieties using weak near-unanimity terms (proved by McKenzie and Mar\'oti) in an elementary and self-contained way

Milestones: Recent Events Summarized—Olympia Representative During Session to Advocate Needed Legislation; Pre-Trial to Be Explained

Reporting recent activities of the Washington State Bar Association and a one-day institute on recommendations for pre-trial procedure and for improvements in the law of Evidence

Congruence modularity implies cyclic terms for finite algebras

An n-ary operation f : A(n) -> A is called cyclic if it is idempotent and f(a(1), a(2), a(3), ... , a(n)) = f(a(2), a(3), ... , a(n), a(1)) for every a(1), ... , a(n) is an element of A. We prove that every finite algebra A in a congruence modular variety has a p-ary cyclic term operation for any prime p greater than vertical bar A vertical bar

Use of Di- and Tripropionate substrate analogs to probe the active site of human recombinant coproporphyrinogen oxidase

Background: Defects in the enzyme coproporphyrinogen oxidase result in accumulation of porphyrins which may affect the severity of a subset of porphyrias. Thus evaluation of this enzyme for substrate selectivity is of value. Kinetic evaluations of recombinant human coproporphyrinogen oxidase have been undertaken using six di- and tripropionate analogs of the natural substrate coproporphyrinogen-III. These Substrate analogs were modified by having alkyl groups in place of one or both of the ring 13- or 17-propionate moieties. Material/Methods: Cloned human enzyme was incubated with analogs under apparent first order conditions and with various substrate concentrations. The kinetic values, K-m and V-max, were determined. Results: Relative to the authentic substrate, the K-m values for the 13-ethyl, dimethyl and diethyl porphyrinogens were very comparable whereas the K-m values were much higher using dipropyl and dibutyl porphyrinogen and much lower for the 17-ethyl analog. For the dipropionate analogs, the V-max values were an apparent function of the carbon length of the substituent. on the C and D rings, with longer carbon length severely reducing product formation by some 4-5 orders of magnitude. Also, the two isomeric tripropionates that were tested indicated that it was more detrimental to have an ethyl group at the 13-position for both binding and catalysis. Conclusions: This work extends our understanding of porphyrin ring substituent effects reported by Cooper et al. (2005). The substituents on both the C and D rings have significant effects on both the substrate binding and catalysis by this important enzyme

On the reduction of the CSP dichotomy conjecture to digraphs

It is well known that the constraint satisfaction problem over general relational structures can be reduced in polynomial time to digraphs. We present a simple variant of such a reduction and use it to show that the algebraic dichotomy conjecture is equivalent to its restriction to digraphs and that the polynomial reduction can be made in logspace. We also show that our reduction preserves the bounded width property, i.e., solvability by local consistency methods. We discuss further algorithmic properties that are preserved and related open problems.Comment: 34 pages. Article is to appear in CP2013. This version includes two appendices with proofs of claims omitted from the main articl

Constraint Satisfaction with Counting Quantifiers

We initiate the study of constraint satisfaction problems (CSPs) in the presence of counting quantifiers, which may be seen as variants of CSPs in the mould of quantified CSPs (QCSPs). We show that a single counting quantifier strictly between exists^1:=exists and exists^n:=forall (the domain being of size n) already affords the maximal possible complexity of QCSPs (which have both exists and forall), being Pspace-complete for a suitably chosen template. Next, we focus on the complexity of subsets of counting quantifiers on clique and cycle templates. For cycles we give a full trichotomy -- all such problems are in L, NP-complete or Pspace-complete. For cliques we come close to a similar trichotomy, but one case remains outstanding. Afterwards, we consider the generalisation of CSPs in which we augment the extant quantifier exists^1:=exists with the quantifier exists^j (j not 1). Such a CSP is already NP-hard on non-bipartite graph templates. We explore the situation of this generalised CSP on bipartite templates, giving various conditions for both tractability and hardness -- culminating in a classification theorem for general graphs. Finally, we use counting quantifiers to solve the complexity of a concrete QCSP whose complexity was previously open

Physical, social and societal functioning of children with congenital adrenal hyperplasia (CAH) and their parents, in a Dutch population

<p>Abstract</p> <p>Background</p> <p>Most research concerning congenital adrenal hyperplasia (CAH) and related conditions caused by primary adrenal insufficiency, such as Addison's or Cushing's disease, has focused on medical aspects rather than on patients' quality of life. Therefore, our objective was to investigate the physical, social and societal functioning of children with CAH and their parents in a Dutch population.</p> <p>Methods</p> <p>The study is descriptive and cross-sectional. Self-designed questionnaires, based on questionnaires developed in the Netherlands for different patient groups, were sent to parents of children with CAH between 0 and 18 years old. Participants were recruited through the Dutch patient group for Adrenal Disease (NVACP) and six hospitals in the Netherlands. Three different questionnaires were designed for parents: for children aged 0 - 4, aged 4 - 12 and aged 12 - 18. Additionally, a fourth questionnaire was sent to adolescents with CAH aged 12 - 18. Main outcome measures were experienced burden of the condition, self-management and participation in several areas, such as school and leisure time.</p> <p>Results</p> <p>A total of 106 parents returned the questionnaire, 12 regarding pre-school children (0-4 years), 63 regarding primary school children (4-12 years), and 32 regarding secondary school children (12-18 years), combined response rate 69.7%. Also, 24 adolescents returned the questionnaire. Children and adolescents with CAH appear to be capable of self-management at a young age. Experienced burden of the condition is low, although children experience several health related problems on a daily basis. Children participate well in school and leisure time. Few children carry a crisis card or emergency injection with them.</p> <p>Conclusions</p> <p>Overall, our research shows that, according to their parents, children with CAH experience few negative effects of the condition and that they participate well in several areas such as school and leisure time. However, improvements can be made concerning the measures parents and children must take to prevent an adrenal crisis.</p

Beyond Hebb: Exclusive-OR and Biological Learning

A learning algorithm for multilayer neural networks based on biologically plausible mechanisms is studied. Motivated by findings in experimental neurobiology, we consider synaptic averaging in the induction of plasticity changes, which happen on a slower time scale than firing dynamics. This mechanism is shown to enable learning of the exclusive-OR (XOR) problem without the aid of error back-propagation, as well as to increase robustness of learning in the presence of noise.Comment: 4 pages RevTeX, 2 figures PostScript, revised versio