Good programming in transactional memory : Game theory meets multicore architecture

In a multicore transactional memory (TM) system, concurrent execution threads interact and interfere with each other through shared memory. The less interference a thread provokes the better for the system. However, as a programmer is primarily interested in optimizing her individual code’s performance rather than the system’s overall performance, she does not have a natural incentive to provoke as little interference as possible. Hence, a TM system must be designed compatible with good programming incentives (GPI), i.e., writing efficient code for the overall system should coincide with writing code that optimizes an individual thread’s performance. We show that with most contention managers (CM) proposed in the literature so far, TM systems are not GPI compatible. We provide a generic framework for CMs that base their decisions on priorities and explain how to modify Timestamp-like CMs so as to feature GPI compatibility. In general, however, priority-based conflict resolution policies are prone to be exploited by selfish programmers. In contrast, a simple non-priority-based manager that resolves conflicts at random is GPI compatible.     

Pancreatic xanthomatous neuropathy associated with hyperlipidemia: a cause of abdominal pain mimicking chronic pancreatitis

"Hyperlipidemic crisis" is a term used to describe episodic abdominal pain in patients with hyperlipidemia. The morphologic correlates of this phenomenon have not been investigated and the etiology of the disorder is uncertain. We report a unique histologic finding in the pancreas of a 34-year-old woman with a 17-year history of episodic abdominal pain, sometimes accompanied by hyperamylasemia. At the age of 18 years, grossly elevated cholesterol and triglyceride levels were documented and type V hyperlipidemia was diagnosed. At the age of 34 years, subtotal pancreatectomy was performed for intractable abdominal pain. Histologic examination identified an increased number of enlarged pancreatic nerves that were infiltrated by foamy macrophages and encircled by fibrous tissue; endoneurial infiltration with macrophages occasionally split nerves into individual fascicles. Otherwise, the pancreas had only minimal fibrosis, nesidioblastosis, mucinous metaplasia of some pancreatic ducts, and scattered small collections of chronic inflammatory cells, subtle features suggesting very mild chronic pancreatitis. We propose that this novel xanthomatous neuropathy mimicked pancreatitis and was one of the underlying pathophysiologic mechanisms of abdominal pain in this patient. Further studies are necessary to document the prevalence of this new entity in patients with hyperlipidemia and to correlate its occurrence with "hyperlipidemic crisis" in those individuals.     

Complications after extracorporeal shock wave lithotripsy (ESWL) and methods of management of such cases

The authors presented the complications which occurred in patients after extracorporeal shock wave lithotripsy (ESWL), and discussed the methods of management of such patients. It was found that the most common complications were: renal colic, fever, "calculus route", and, less frequently, subcapsular and perirenal haematomas. In most patients conservative treatment was adequate. Some of these patients required admission to hospital and proper specialized management.     

Constraint Lingo: towards high‐level constraint programming

Logic programming requires that the programmer convert a problem into a set of constraints based on predicates. Choosing the predicates and introducing appropriate constraints can be intricate and error prone. If the problem domain is structured enough, we can let the programmer express the problem in terms of more abstract, higher‐level constraints. A compiler can then convert the higher‐level program into a logic‐programming formalism. The compiler writer can experiment with alternative low‐level representations of the higher‐level constraints in order to achieve a high‐quality translation. The programmer can then take advantage of both a reduction in complexity and an improvement in runtime speed for all problems within the domain. We apply this analysis to the domain of tabular constraint‐satisfaction problems. Examples of such problems include logic puzzles solvable on a hatch grid and combinatorial problems such as graph coloring and independent sets. The proper abstractions for these problems are rows, columns, entries, and their interactions. We present a higher‐level language, Constraint Lingo, dedicated to problems in this domain. We also describe how we translate programs from Constraint Lingo into lower‐level logic formalisms such as the logic of propositional schemata. These translations require that we choose among competing lower‐level representations in order to produce efficient results. The overall effectiveness of our approach depends on the appropriateness of Constraint Lingo, our ability to translate Constraint Lingo programs into high‐quality representations in logic formalisms, and the efficiency with which logic engines can compute answer sets. We comment on our computational experience with these tools in solving both graph problems and logic puzzles. Copyright © 2004 John Wiley & Sons, Ltd.     

Impossible differential cryptanalysis of 7-round Advanced Encryption Standard (AES)

In 2000, Biham and Keller [Cryptanalysis of reduced variants of Rijndael, 3rd AES Conference, in press] presented an impossible differential cryptanalysis of the Advanced Encryption Standard (AES) up to 5 rounds. This was later improved in 2001 by Cheon et al. [Improved impossible differential cryptanalysis of Rijndael and Crypton, in: Lecture Notes in Comput. Sci., vol.  2288, Springer-Verlag, Berlin, 2001, pp. 39-49] to apply to 6 rounds of the AES. In this paper, we extend on previous results to present an attack on the AES up to 7 rounds. This is the best-known impossible differential attack on the AES, and works by exploiting weaknesses in the AES key schedule.     

Analytical benchmark example for risk allocation in structural optimization

Recently, Rozvany and Maute presented a simple problem of topology optimization under uncertainty with a single load condition that can be solved without Monte Carlo simulation. This note extends this idea to a two-bar truss under two load conditions for the purpose of illustrating differences between deterministic designs and reliability–based ones in terms of risk allocation. For this example, for the same probability of failure, a deterministic design based on the same safety factor for both loads can be substantially heavier than the reliability–based design. The difference in weight is due to very different risk allocation between the two failure modes.     

Metasurfaces Atop Metamaterials: Surface Morphology Induces Linear Dichroism in Gyroid Optical Metamaterials

Optical metamaterials offer the tantalizing possibility of creating extraordinary optical properties through the careful design and arrangement of subwavelength structural units. Gyroid‐structured optical metamaterials possess a chiral, cubic, and triply periodic bulk morphology that exhibits a redshifted effective plasma frequency. They also exhibit a strong linear dichroism, the origin of which is not yet understood. Here, the interaction of light with gold gyroid optical metamaterials is studied and a strong correlation between the surface morphology and its linear dichroism is found. The termination of the gyroid surface breaks the cubic symmetry of the bulk lattice and gives rise to the observed wavelength‐ and polarization‐dependent reflection. The results show that light couples into both localized and propagating plasmon modes associated with anisotropic surface protrusions and the gaps between such protrusions. The localized surface modes give rise to the anisotropic optical response, creating the linear dichroism. Simulated reflection spectra are highly sensitive to minute details of these surface terminations, down to the nanometer level, and can be understood with analogy to the optical properties of a 2D anisotropic metasurface atop a 3D isotropic metamaterial. This pronounced sensitivity to the subwavelength surface morphology has significant consequences for both the design and application of optical metamaterials.     

The Role of Polymorphisms at the Interleukin-1, Interleukin-4, GATA-3 and Cyclooxygenase-2 Genes in Non-Surgical Periodontal Therapy

Periodontitis is a multifactorial disease. The aim of this explorative study was to investigate the role of Interleukin-(IL)-1, IL-4, GATA-3 and Cyclooxygenase-(COX)-2 polymorphisms after non-surgical periodontal therapy with adjunctive systemic antibiotics (amoxicillin/metronidazole) and subsequent maintenance in a Caucasian population. Analyses were performed using blood samples from periodontitis patients of a multi-center trial (ClinicalTrials.gov {"type":"clinical-trial","attrs":{"text":"NCT00707369","term_id":"NCT00707369"}}NCT00707369=ABPARO-study). Polymorphisms were analyzed using quantitative real-time PCR. Clinical attachment levels (CAL), percentage of sites showing further attachment loss (PSAL) ≥1.3 mm, bleeding on probing (BOP) and plaque score were assessed. Exploratory statistical analysis was performed. A total of 209 samples were genotyped. Patients carrying heterozygous genotypes and single-nucleotide-polymorphisms (SNP) on the GATA-3-IVS4 +1468 gene locus showed less CAL loss than patients carrying wild type. Heterozygous genotypes and SNPs on the IL-1A-889, IL-1B +3954, IL-4-34, IL-4-590, GATA-3-IVS4 +1468 and COX-2-1195 gene loci did not influence CAL. In multivariate analysis, CAL was lower in patients carrying GATA-3 heterozygous genotypes and SNPs than those carrying wild-types. For the first time, effects of different genotypes were analyzed in periodontitis progression after periodontal therapy and during supportive treatment using systemic antibiotics demonstrating a slight association of GATA-3 gene locus with CAL. This result suggests that GATA-3 genotypes are a contributory but non-essential risk factor for periodontal disease progression.     

Virtual Organizations in Arigatoni

Arigatoni is a lightweight overlay network that deploys the Global Computing Paradigm over the Internet. Communication for over the behavioral units of the overlay is performed by a simple resource discovery protocol (RDP). Basic Global Computers Units (GC) can communicate by first registering to a brokering service and then by mutually asking and offering services.Colonies and communities are the main entities in the model. A colony is a simple virtual organization composed by exactly one leader and some set (possibly empty) of individuals. A community is a raw set of colonies and global computers (think it as a soup of colonies and global computer without a leader).We present an operational semantics via a labeled transition system, that describes the main operations necessary in the Arigatoni model to perform leader negotiation, joining/leaving a colony, linking two colonies and moving one GC from one colony to another. Our formalization results to be adequate w.r.t. the algorithm performing peer logging/delogging and colony aggregation.