Interpreting Quantifier Scope Ambiguity: Evidence of Heuristic First, Algorithmic Second Processing

The present work suggests that sentence processing requires both heuristic and algorithmic processing streams, where the heuristic processing strategy precedes the algorithmic phase. This conclusion is based on three self-paced reading experiments in which the processing of two-sentence discourses was investigated, where context sentences exhibited quantifier scope ambiguity. Experiment 1 demonstrates that such sentences are processed in a shallow manner. Experiment 2 uses the same stimuli as Experiment 1 but adds questions to ensure deeper processing. Results indicate that reading times are consistent with a lexical-pragmatic interpretation of number associated with context sentences, but responses to questions are consistent with the algorithmic computation of quantifier scope. Experiment 3 shows the same pattern of results as Experiment 2, despite using stimuli with different lexicalpragmatic biases. These effects suggest that language processing can be superficial, and that deeper processing, which is sensitive to structure, only occurs if required. Implications for recent studies of quantifier scope ambiguity are discussed.

Applications of dihydroarenediols to chemoenzymatic synthesis : approaches to total synthesis of morphine alkaloids

The present studies describe, as a primary goal, our recent progess toward the synthesis of morphine alkaloids from aromatic precursors. Model substrates were synthesized which allowed investigation into Diels-Alder, radical cascade, and palladium-catalyzed bond-forming reactions as possible routes to the morphine alkaloid skeleton. As a secondary objective, three separate series of aromatic substrates were subjected to whole-cell oxidation with Escherichia coli JM 109 (pDTG601), a recombinant organism over-expressing the enzyme toluene dioxygenase. Included in this study were bromothioanisoles, dibromobenzenes, and cyclopropylbenzene derivatives. The products of oxidation were characterized by chemical conversion to known intermediates. The synthetic utility of one of these bacterial metabolites, derived from oxidation of o-dibromobenezene, was demonstrated by chemical conversion to (-)conduritol E.

Temporal variation in the coral reefs of the east coast of the inner gulf of Thailand

A series of permanent line transects established on fourteen reefs on the eastern seaboard of the Gulf of Thailand were monitored through a three-year period (1995- 1998) using a video transect method. Hierarchical cluster analysis shows three distinctive reef community types dominated by 1) Porites, 2) Acropora and 3) zoantharians. The reefs are developed under naturally turbid conditions and relatively low salinity due to the proximity of four major river outlets located in the uppermost area of the gulf. The number of Acroporid species on the reefs is positively correlated with distance from the major flver outlets. Eighty-seven species of scleractinian coral were found on the transects. Over the three-year period, the comparison of 1995-97-98 matched stations using Repeated Measures ANOV A reveals no significant time-dependent change in percent area cover of reef components except for an overall significant reduction in the faviid coral component. In the 1997-98 matched station comparison, statistical tests reveal significant increases in both Acropora and Porites components that translated into an overall increase in total living coral cover. These findings indicate that the overall environmental conditions have been favorable for coral growth. Outcompetition of massive corals by faster growing corals on several reefs also indicates conditions favorable for reef expansion. Growth of newlyformed Porites colonies over primary rock substrate and dead coral skeleton was presumably responsible for its rapid increase. Although these reefs are in an area of rapid industrialization and population growth, resultant anthropogenic effects have not yet stopped active coral accretion.

Properties and algorithms of the (n, k)-star graphs

The (n, k)-star interconnection network was proposed in 1995 as an attractive alternative to the n-star topology in parallel computation. The (n, k )-star has significant advantages over the n-star which itself was proposed as an attractive alternative to the popular hypercube. The major advantage of the (n, k )-star network is its scalability, which makes it more flexible than the n-star as an interconnection network. In this thesis, we will focus on finding graph theoretical properties of the (n, k )-star as well as developing parallel algorithms that run on this network. The basic topological properties of the (n, k )-star are first studied. These are useful since they can be used to develop efficient algorithms on this network. We then study the (n, k )-star network from algorithmic point of view. Specifically, we will investigate both fundamental and application algorithms for basic communication, prefix computation, and sorting, etc. A literature review of the state-of-the-art in relation to the (n, k )-star network as well as some open problems in this area are also provided.

Properties and algorithms of the (n, k)-arrangement graphs

The (n, k)-arrangement interconnection topology was first introduced in 1992. The (n, k )-arrangement graph is a class of generalized star graphs. Compared with the well known n-star, the (n, k )-arrangement graph is more flexible in degree and diameter. However, there are few algorithms designed for the (n, k)-arrangement graph up to present. In this thesis, we will focus on finding graph theoretical properties of the (n, k)- arrangement graph and developing parallel algorithms that run on this network. The topological properties of the arrangement graph are first studied. They include the cyclic properties. We then study the problems of communication: broadcasting and routing. Embedding problems are also studied later on. These are very useful to develop efficient algorithms on this network. We then study the (n, k )-arrangement network from the algorithmic point of view. Specifically, we will investigate both fundamental and application algorithms such as prefix sums computation, sorting, merging and basic geometry computation: finding convex hull on the (n, k )-arrangement graph. A literature review of the state-of-the-art in relation to the (n, k)-arrangement network is also provided, as well as some open problems in this area.

Properties and algorithms of the hyper-star graph and its related graphs

The hyper-star interconnection network was proposed in 2002 to overcome the drawbacks of the hypercube and its variations concerning the network cost, which is defined by the product of the degree and the diameter. Some properties of the graph such as connectivity, symmetry properties, embedding properties have been studied by other researchers, routing and broadcasting algorithms have also been designed. This thesis studies the hyper-star graph from both the topological and algorithmic point of view. For the topological properties, we try to establish relationships between hyper-star graphs with other known graphs. We also give a formal equation for the surface area of the graph. Another topological property we are interested in is the Hamiltonicity problem of this graph. For the algorithms, we design an all-port broadcasting algorithm and a single-port neighbourhood broadcasting algorithm for the regular form of the hyper-star graphs. These algorithms are both optimal time-wise. Furthermore, we prove that the folded hyper-star, a variation of the hyper-star, to be maixmally fault-tolerant.

Square Root Finding In Graphs

Abstract: Root and root finding are concepts familiar to most branches of mathematics. In graph theory, H is a square root of G and G is the square of H if two vertices x,y have an edge in G if and only if x,y are of distance at most two in H. Graph square is a basic operation with a number of results about its properties in the literature. We study the characterization and recognition problems of graph powers. There are algorithmic and computational approaches to answer the decision problem of whether a given graph is a certain power of any graph. There are polynomial time algorithms to solve this problem for square of graphs with girth at least six while the NP-completeness is proven for square of graphs with girth at most four. The girth-parameterized problem of root fining has been open in the case of square of graphs with girth five. We settle the conjecture that recognition of square of graphs with girth 5 is NP-complete. This result is providing the complete dichotomy theorem for square root finding problem.

Properties and Algorithms of the KCube Graphs

The KCube interconnection topology was rst introduced in 2010. The KCube graph is a compound graph of a Kautz digraph and hypercubes. Compared with the at- tractive Kautz digraph and well known hypercube graph, the KCube graph could accommodate as many nodes as possible for a given indegree (and outdegree) and the diameter of interconnection networks. However, there are few algorithms designed for the KCube graph. In this thesis, we will concentrate on nding graph theoretical properties of the KCube graph and designing parallel algorithms that run on this network. We will explore several topological properties, such as bipartiteness, Hamiltonianicity, and symmetry property. These properties for the KCube graph are very useful to develop efficient algorithms on this network. We will then study the KCube network from the algorithmic point of view, and will give an improved routing algorithm. In addition, we will present two optimal broadcasting algorithms. They are fundamental algorithms to many applications. A literature review of the state of the art network designs in relation to the KCube network as well as some open problems in this field will also be given.

Oak Chest

Oak chest measuring 36 cm in height 45 cm in width and 32 cm in depth. The cabinet contains 5 graduating drawers and it closes with 2 hinged doors, each bearing an arch. There are recessed brass handles on the 2 sides of the cabinet and one of these handles on each of the drawers. On the top of the cabinet there is an escutcheon engraved with “S.D. Woodruff Esq., St. Catharines, 157 Ontario”. The cabinet has a lock which is still functional and opens with a skeleton key which is part of this collection. The top 2 drawers have been lined with a piece of cardboard carefully cut to size and covered with brocade. There is some scratching on the top of the cabinet and one of the front doors is missing some of the wooden trim.

3-O-Demethylation of thebaine and the synthesis of a flacourtia aglycone from benzoic acid.

Two synthetic projects were embarked upon, both fraught with protecting group nuance and reaction selectivity. Transformations of the opiate skeleton remain a valuable tool for the development of new medicines. Thebaine, a biosynthetic intermediate in the expression of morphine, was converted in three steps to oripavine through two parallel modes. Through the use of protecting group manipulations, two irreversible scaffold rearrangements were avoided during aryl methyl ether bond cleavage. This chemistry constitutes a new path in manipulations of the morphinan scaffold through protective groups. A new compound family, the flacourtosides, contains an unusual cyclohexenone fragment. The newly described compounds show in preliminary tests antiviral activity against dengue and chikungunya. This aglycone was approached on three pathways, all beginning with the chemoenzymatic dihydroxylation of benzoic acid. A first attempt from a known vinyl epoxide failed to epimerize and cooperate under deprotective conditions. A second and third attempt made use of a diastereoselective dihydroxylation reaction, which was critical in reaching the correct stereochemistry and oxidation state. The methyl ester of the aglycone was prepared, constituting the first synthesis of the non-trivial natural product framework.