A set expression based inheritance system

This paper describes a new formalism for inheritance systems, based on the formal semantics of set expressions. Using the formalism, it is possible to define new semantic classes by arbitrary set expressions operating on previously defined classes. Thus generalizing bothIS-A links andIS-NOT-A links and adding the set intersection operation. We present an efficient algorithm which follows these definitions to deduce the properties implied by the inheritance network, i.e., the properties of the classes containing a given element. The application which motivated the development of the formalism, namely semantic disambiguation of natural language, is also described.     

Circuits and techniques for high-resolution measurement of on-chip power supply noise

This paper presents a technique for characterizing the statistical properties and spectrum of power supply noise using only two on-chip low-throughput samplers. The samplers utilize a voltage-controlled oscillator to perform high-resolution analog-to-digital conversion with minimal hardware. The measurement system is implemented in a 0.13-/spl mu/m process along with a high-speed link transceiver. Measured results from this chip validate the accuracy of the measurement system and elucidate several aspects of power supply noise, including its cyclostationary nature.     

Fractional composition of partly hydrolysed polyvinyl acetate and its compatibility with hydroxypropyl methylcellulose in aqueous solutions

Fractionation of partly hydrolysed polyvinyl acetate (PVA) was performed by warming of its aqueous solutions. The following properties of the obtained fractions were determined: viscosity, molecular weight and molecular weight distribution, surface tension, and absorbance in the IR range. The blockiness of the polymer molecules, characterized by their behaviour towards iodine-containing systems such as I₂,-H₃BO₃ and I₂,-KI, was estimated. Fractionation of the aqueous solutions of PVA by warming is based mainly on the different internal molecular structure of the separated products, i.e. on the length of the vinyl acetate blocks in the PVA molecules and, to a lesser extent, on the degree of hydrolysis and the degree of polymerization. The more blocklike are the PVA molecules, the less compatible are the polymers in the PVA-hydroxypropyl methylcellulose (HPMC)-water system. At phase separation in this sytem the PVA molecules which are not compatible with HPMC are, in the first place, those of the highest blockiness.     

Almost k-wise independence versus k-wise independence

We say that a distribution over {0,1}ⁿ is (ε,k)-wise independent if its restriction to every k coordinates results in a distribution that is ε-close to the uniform distribution. A natural question regarding (ε,k)-wise independent distributions is how close they are to some k-wise independent distribution. We show that there exist (ε,k)-wise independent distributions whose statistical distance is at least n^O(k)·ε from any k-wise independent distribution. In addition, we show that for any (ε,k)-wise independent distribution there exists some k-wise independent distribution, whose statistical distance is n^O(k)·ε.     

Canonical density control

The Sparse Table is a data structure for controlling density in an array which was first proposed in 1981 and has recently reappeared as a component of cache-oblivious data structures. All existing variants of the Sparse Table divide the array into blocks that have a calibrator tree above them. We show that the same amortized complexity can be achieved without this auxiliary structure, obtaining a canonical data structure that can be updated by conceptually simpler algorithms.     

An Engineered sgsh Mutant Zebrafish Recapitulates Molecular and Behavioural Pathobiology of Sanfilippo Syndrome A/MPS IIIA

Mucopolysaccharidosis IIIA (MPS IIIA, Sanfilippo syndrome type A), a paediatric neurological lysosomal storage disease, is caused by impaired function of the enzyme N-sulfoglucosamine sulfohydrolase (SGSH) resulting in impaired catabolism of heparan sulfate glycosaminoglycan (HS GAG) and its accumulation in tissues. MPS IIIA represents a significant proportion of childhood dementias. This condition generally leads to patient death in the teenage years, yet no effective therapy exists for MPS IIIA and a complete understanding of the mechanisms of MPS IIIA pathogenesis is lacking. Here, we employ targeted CRISPR/Cas9 mutagenesis to generate a model of MPS IIIA in the zebrafish, a model organism with strong genetic tractability and amenity for high-throughput screening. The sgsh^Δex5−6 zebrafish mutant exhibits a complete absence of Sgsh enzymatic activity, leading to progressive accumulation of HS degradation products with age. sgsh^Δex5−6 zebrafish faithfully recapitulate diverse CNS-specific features of MPS IIIA, including neuronal lysosomal overabundance, complex behavioural phenotypes, and profound, lifelong neuroinflammation. We further demonstrate that neuroinflammation in sgsh^Δex5−6 zebrafish is largely dependent on interleukin-1β and can be attenuated via the pharmacological inhibition of Caspase-1, which partially rescues behavioural abnormalities in sgsh^Δex5−6 mutant larvae in a context-dependent manner. We expect the sgsh^Δex5−6 zebrafish mutant to be a valuable resource in gaining a better understanding of MPS IIIA pathobiology towards the development of timely and effective therapeutic interventions.     

Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing

We show how to compute the smallest rectangle that can enclose any polygon, from a given set of polygons, in nearly linear time; we also present a PTAS for the problem, as well as a linear-time algorithm for the case when the polygons are rectangles themselves. We prove that finding a smallest convex polygon that encloses any of the given polygons is NP-hard, and give a PTAS for minimizing the perimeter of the convex enclosure. We also give efficient algorithms to find the smallest rectangle simultaneously enclosing a given pair of convex polygons.     

Algorithmic Aspects of Acyclic Edge Colorings

Abstract. A proper coloring of the edges of a graph G is called acyclic if there is no two-colored cycle in G . The acyclic edge chromatic number of G , denoted by a'(G) , is the least number of colors in an acyclic edge coloring of G . For certain graphs G , a'(G)\geq Δ(G)+2 where Δ(G) is the maximum degree in G . It is known that a'(G)≤ Δ + 2 for almost all Δ -regular graphs, including all Δ -regular graphs whose girth is at least cΔ log Δ . We prove that determining the acyclic edge chromatic number of an arbitrary graph is an NP-complete problem. For graphs G with sufficiently large girth in terms of Δ(G) , we present deterministic polynomial-time algorithms that color the edges of G acyclically using at most Δ(G)+2 colors.     

The Topology of Transportation Networks: A Comparison Between Different Economies

This paper presents an analysis of the topology of transportation networks within different systems of cities. Urban entities and their components are complex systems by their nature; there is no central force that affects their spatial structure. Thus, we study transportation networks within different countries as complex networks. Based on the above, we consider cities as nodes, while direct air and railways routes represent the links. We present characteristics of these networks including their degree and clustering coefficient. Transportation networks can be used as an indicator of economic activity between cities. Cities with strong economic relationship are characterized by high volume of connectivity. Our findings suggest that the topology of the analyzed transportation networks can be used to classify the countries they belong to based on their economic development.