Historical, physical, cognitive, and cytogenetic data were documented in 105 heterozygous fragile X [fra(X)] females and 90 controls in a prospective fashion. For comparisons, we divided heterozygotes and controls into those with cognitive impairment (IQ less than 85) and normal IQ (IQ greater than or equal to 85). The only finding that was significantly more frequent in impaired heterozygotes compared with impaired controls chi 2 analysis was shyness. Features that were more frequent in normal IQ heterozygotes compared with normal controls were voluntary thumb dislocation and hyperextensible metacarpal-phalangeal (MP) joints. Comparisons among heterozygotes demonstrated more math problems, hand biting, strabismus, high-arched palate, hyperextensible finger joints, and flat feet in impaired heterozygotes than in normal heterozygotes. Premature menopause was present in 8 of 61 normal heterozygotes and in none of the impaired heterozygotes. A multiple regression analysis demonstrated a significant inverse correlation between the percent fragility and IQ for the heterozygotes as a group. However, no correlation existed between IQ and fragility when the percent fragility was 2% or greater. However, a higher percentage of fragility was positively correlated with the total number of physical findings present.

No abstract

Algorithm 4 on page 960 of the above named article (Wielemaker and Harris 2016) is flawed. The issue is illustrated by algorithm 1 (supplementary figure 1). If a thread A detects the condition table too full is false it proceeds adding its atom to the table. If thread B detects the table is (now) too full it starts a resize. The resize allocates a new table and copies the atoms from the old to the new table. If thread A adds the new atom after the copy loop passes its location and before thread B activates the new table the insertion is considered successful, but the new atom is only in the deactivated old table.

The runtime system of dynamic languages such as Prolog or Lisp and their derivatives contain asymbol table, in Prolog often called theatom table. A simple dynamically resizing hash-table used to be an adequate way to implement this table. As Prolog becomes fashionable for 24 × 7 server processes we need to deal with atom garbage collection and concurrent access to the atom table. Classical lock-based implementations to ensure consistency of the atom table scale poorly and a stop-the-world approach to implement atom garbage collection quickly becomes a bottle-neck, making Prolog unsuitable for soft real-time applications. In this article we describe a novel implementation for the atom table using lock-free techniques where the atom-table remains accessible even during atom garbage collection. Relying only on CAS (Compare And Swap) and not on external libraries, the implementation is straightforward and portable.