Milling performance of north European hull-less barleys and characterization of resultant millstreams

Four hull-less barley samples were milled on a Buhler MLU 202 laboratory mill and individual and combined milling fractions were characterized. The best milling performance was obtained when the samples were conditioned to 14.3% moisture. Yields were 37-48% for straight-run flour, 47-56% for shorts, and 5-8% for bran. The beta-glucan contents of the straight-run white flours were 1.6-2.1%, of which approximate to49% was water-extractable. The arabinoxylan contents were 1.2-1.5%, of which approximate to17% was water-extractable. Shorts and bran fractions contained more beta-glucan (4.2-5.8% and 3.0-4.7%, respectively) and arabinoxylan (6.1-7.7% and 8.1-11.8%, respectively) than the white flours. For those fractions, beta-glucan extractability was high (58.5 and 52.3%, respectively), whereas arabinoxylan extractability was very low (approximate to6.5 and 2.0%, respectively). The straight-run white flours had low alpha-amylase, beta-glucanase, and endoxylanase activities. The highest alpha-amylase activity was found in the shorts fractions and the highest beta-glucanase and endoxylanase activities were generally found in the bran fractions. Endoxylanase inhibitor activities were low in the white flours and highest in the shorts fractions. High flavanoid, tocopherol, and tocotrienol contents were found in bran and shorts fractions.

Missionary children: The French Holy Childhood Association in European context, 1843-c.1914

In the mid-nineteenth century, thousands of children in Europe and beyond were organized into battalions of fundraisers for overseas missions. By the end of the century these juvenile missionary organizations had become a global movement, generating millions of pounds in revenue each year. While the transnational nature of the children’s missions and publications has been well-documented by historians, the focus has tended to be on the connections that were established by encounters between the young western donors, missionaries overseas and the non-western ‘other’ constructed by their work. A full exploration of the European political, social and cultural concerns that produced the juvenile missionaries movement and the trans-European networks that sustained it are currently missing from historical accounts of the phenomenon. This article looks at the largest of these organizations, the Catholic mission for children, the French Holy Childhood Association (L’Œuvre de la sainte enfance), to understand how the principles this mission sought to impose abroad were above all an expression of anxieties at home about the role of religion in the family, childhood and in civil society as western polities were modernizing and secularizing in the nineteenth century.

Rapid preconditioning of data for accelerating convex hull algorithms

Given a dataset of two-dimensional points in the plane with integer coordinates, the method proposed reduces a set of n points down to a set of s points s ≤ n, such that the convex hull on the set of s points is the same as the convex hull of the original set of n points. The method is O(n). It helps any convex hull algorithm run faster. The empirical analysis of a practical case shows a percentage reduction in points of over 98%, that is reflected as a faster computation with a speedup factor of at least 4.

Preconditioning 2D integer data for fast convex hull computations

In order to accelerate computing the convex hull on a set of n points, a heuristic procedure is often applied to reduce the number of points to a set of s points, s ≤ n, which also contains the same hull. We present an algorithm to precondition 2D data with integer coordinates bounded by a box of size p × q before building a 2D convex hull, with three distinct advantages. First, we prove that under the condition min(p, q) ≤ n the algorithm executes in time within O(n); second, no explicit sorting of data is required; and third, the reduced set of s points forms a simple polygonal chain and thus can be directly pipelined into an O(n) time convex hull algorithm. This paper empirically evaluates and quantifies the speed up gained by preconditioning a set of points by a method based on the proposed algorithm before using common convex hull algorithms to build the final hull. A speedup factor of at least four is consistently found from experiments on various datasets when the condition min(p, q) ≤ n holds; the smaller the ratio min(p, q)/n is in the dataset, the greater the speedup factor achieved.