Max Michel Collection. 1933-1986 Bulk dates: 1933-1937

The bulk of the collections consists of correspondence from the 1930s relating to Michels’s job applications in the U.S. in different academic institutions and activities of the Hilfsverein der Juden in Deutschland. Also included is a 36 p. typescript, ‘Geschichte der Familie Wertheimer’; pamphlets by Juda Magnes and Kurt Blumenfeld on the university in Jerusalem; as well as family trees.

Ashe-Eschwege collection 1941-1942

Letters and postcards from Theresienstadt and Cholm

Oh Holly, The Fish is Dead

From Kurt Vonnegut to Stephen King, many novelists use metanarrative techniques to insert fictional versions of themselves in the stories they tell. The function of deploying such techniques is often to draw attention to the liminal space between the fictional constructs inherent in the novel as a form, and the real world from which the constructs draw inspiration, and indeed, are read by an audience. For emerging writers working in short form narratives, however, the structural demands of the short story or flash fiction make the use of similar techniques problematic in the level of depth to which they can be deployed. ‘Oh Holly, the fish is dead’ is the fourth in a series of short stories that work to overcome the structural limitations of a succinct form by developing a fractured fictional version of the author over a number of pieces and published across a range of sites. The accumulative affect is a richer metanarrative textual arrangement that also allows for the individual short stories to function independently.

Swing Low

From Kurt Vonnegut to Stephen King, many novelists use metanarrative techniques to insert fictional versions of themselves in the stories they tell. The function of deploying such techniques is often to draw attention to the liminal space between the fictional constructs inherent in the novel as a form, and the real world from which the constructs draw inspiration, and indeed, are read by an audience. For emerging writers working in short form narratives, however, the structural demands of the short story or flash fiction make the use of similar techniques problematic in the level of depth to which they can be deployed. ‘Swing Low’ is the fifth in a series of short stories that work to overcome the structural limitations of a succinct form by developing a fractured fictional version of the author over a number of pieces and published across a range of sites. The accumulative affect is a richer metanarrative textual arrangement that also allows for the individual short stories to function independently.

Eating the Lonesome

From Kurt Vonnegut to Stephen King, many novelists use metanarrative techniques to insert fictional versions of themselves in the stories they tell. The function of deploying such techniques is often to draw attention to the liminal space between the fictional constructs inherent in the novel as a form, and the real world from which the constructs draw inspiration, and indeed, are read by an audience. For emerging writers working in short form narratives, however, the structural demands of the short story or flash fiction make the use of similar techniques problematic in the level of depth to which they can be deployed. ‘Eating The Lonesome’ is the sixth in a series of short stories that work to overcome the structural limitations of a succinct form by developing a fractured fictional version of the author over a number of pieces and published across a range of sites. The accumulative affect is a richer metanarrative textual arrangement that also allows for the individual short stories to function independently.

New approximation algorithms for minimum cycle bases of graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time 0(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time 0(n(3+2/k)), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega)) bound. We also present a 2-approximation algorithm with O(m(omega) root n log n) expected running time, a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

Prosopis, an Alien among the Sacred Trees of South India

The problematic of invasive species in an alien environment has aroused the attention of scientists all over the world for quite some time. One of the exotic tree species that has provoked special attention in the tropical drylands is Prosopis juliflora. Originating in South America, prosopis (hereafter referred to as prosopis) has been introduced in the hot and semi-arid zones of the world particularly to provide fuelwood, to stabilize sand dunes and to combat desertification. The tree has become an essential source for fuelwood and a provider of several other products and services in areas where it has become established. However, despite the numerous benefits the tree provides to rural people, in several regions prosopis has become a noxious weed with a negative impact on the environment and to the economy of farmers and landowners. In India, prosopis was introduced in Andhra Pradesh in 1877. The tree was then proclaimed as the precious child of the plant world by scientists and local people alike. The purpose of this study was to investigate the overall impact of prosopis on local rural livelihoods in the drylands of South India. Of particular interest was the examination of the different usages of the tree, especially as fuelwood, and people s perceptions of it. Furthermore, the study examined the negative impacts of the uncontrolled invasion of prosopis on croplands, and its occupation of the banks of irrigation canals and other water sources. As another central theme, this study analysed the Hindu classification system for nature and for trees in particular. In India, several tree species are regarded as sacred. This study examined the position of the exotic prosopis among sacred trees, such as the bodhi, banyan and neem trees. The principle method for collecting the field data was by using individual and thematic group interviews. These interviews were semi-structured with open ended questions. Moreover, unstructured interviews as well as general observations provided complementary information. The data were gathered during two fieldwork periods in the states of Andhra Pradesh and Tamil Nadu, in South India. The results confirmed that prosopis both provides benefits and causes hazards to different stakeholders. Farmers and agriculturalists suffer economic losses in areas where prosopis has invaded crop fields and competes with other plants for water and nutrients. On the other hand, for a significant number of poor rural people, prosopis has become an important source of livelihood benefits. This tree, which grows on government wastelands, is commonly a free resource for all and has thus become a major local source of fuelwood. It also provides several other goods and services and cash income that contributes to improve livelihoods in rural communities. Prosopis ranked lowest in the tree classificatioin system of the Hindus of South India. Although it is appreciated for many benefits it provides for poor people, it has remained an outsider compared with the indigenous tree species. On the other hand, the most sacred trees, such as the bodhi or the banyan, are completely excluded from extraction and it is seen as a sacrilege to even cut branches from any of these trees. An unexpected finding was that, in a few cases, prosopis had also been elevated to the status of a sacred tree. Goods and services from prosopis are not utilized in the most beneficial way. Silvicultural management practices are suggested that would provide additional income and employment opportunities. Interventions are recommended to control further invasion of the tree that might cause serious negative effects in the future. For Hindus, the sacred always ranks highest, even above economic gain. The conservation of sacred groves and sacred trees is a tradition that has its roots in ancient history. These socio-religious practices need to be respected and continued. Successful management of tree and forest resources depends on the willingness of the local people to manage their natural resources, and this willingness exists and has always existed in South India. Keywords: South India, drylands, livelihood, fuelwood, invasive, resource, silviculture.

ISO 13567 - The Proposed International Standard for Structuring Layers in Computer Aided Building Design

Layering is a widely used method for structuring data in CAD-models. During the last few years national standardisation organisations, professional associations, user groups for particular CAD-systems, individual companies etc. have issued numerous standards and guidelines for the naming and structuring of layers in building design. In order to increase the integration of CAD data in the industry as a whole ISO recently decided to define an international standard for layer usage. The resulting standard proposal, ISO 13567, is a rather complex framework standard which strives to be more of a union than the least common denominator of the capabilities of existing guidelines. A number of principles have been followed in the design of the proposal. The first one is the separation of the conceptual organisation of information (semantics) from the way this information is coded (syntax). The second one is orthogonality - the fact that many ways of classifying information are independent of each other and can be applied in combinations. The third overriding principle is the reuse of existing national or international standards whenever appropriate. The fourth principle allows users to apply well-defined subsets of the overall superset of possible layernames. This article describes the semantic organisation of the standard proposal as well as its default syntax. Important information categories deal with the party responsible for the information, the type of building element shown, whether a layer contains the direct graphical description of a building part or additional information needed in an output drawing etc. Non-mandatory information categories facilitate the structuring of information in rebuilding projects, use of layers for spatial grouping in large multi-storey projects, and storing multiple representations intended for different drawing scales in the same model. Pilot testing of ISO 13567 is currently being carried out in a number of countries which have been involved in the definition of the standard. In the article two implementations, which have been carried out independently in Sweden and Finland, are described. The article concludes with a discussion of the benefits and possible drawbacks of the standard. Incremental development within the industry, (where ”best practice” can become ”common practice” via a standard such as ISO 13567), is contrasted with the more idealistic scenario of building product models. The relationship between CAD-layering, document management product modelling and building element classification is also discussed.

New Approximation Algorithms for Minimum Cycle Bases of Graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. Although in most such applications any cycle basis can be used, a low weight cycle basis often translates to better performance and/or numerical stability. Despite the fact that the problem can be solved exactly in polynomial time, we design approximation algorithms since the performance of the exact algorithms may be too expensive for some practical applications. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time O(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time O(n(3+2/k) ), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega) ) bound. We also present a 2-approximation algorithm with expected running time O(M-omega root n log n), a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

Additive Spanners and (alpha, beta)-Spanners

An (alpha, beta)-spanner of an unweighted graph G is a subgraph H that distorts distances in G up to a multiplicative factor of a and an additive term beta. It is well known that any graph contains a (multiplicative) (2k - 1, 0)-spanner of size O(n(1+1/k)) and an (additive) (1, 2)-spanner of size O(n(3/2)). However no other additive spanners are known to exist. In this article we develop a couple of new techniques for constructing (alpha, beta)-spanners. Our first result is an additive (1, 6)-spanner of size O(n(4/3)). The construction algorithm can be understood as an economical agent that assigns costs and values to paths in the graph, purchasing affordable paths and ignoring expensive ones, which are intuitively well approximated by paths already purchased. We show that this path buying algorithm can be parameterized in different ways to yield other sparseness-distortion tradeoffs. Our second result addresses the problem of which (alpha, beta)-spanners can be computed efficiently, ideally in linear time. We show that, for any k, a (k, k - 1)-spanner with size O(kn(1+1/k)) can be found in linear time, and, further, that in a distributed network the algorithm terminates in a constant number of rounds. Previous spanner constructions with similar performance had roughly twice the multiplicative distortion.

Surface morphology, optical properties and conductivity changes of poly(3,4-ethylenedioxythiophene): poly(styrenesulfonate) by using additives

The optical properties and electrical conductivity of highly conducting poly(3,4-ethylenedioxythiophene) (PEDOT) doped with poly(styrenesulfonate) (PSS) are reported as a function of the processing additive conditions. The addition of dimethyl sulfoxide (DMSO) increases the conductivity and modifies the dielectric response as observed from the ellipsometric studies. Also the surface roughness and morphology change with the composition of PEDOT: PSS: DMSO and film deposition conditions. The real part of the dielectric function becomes negative in highly conducting samples, indicating the presence of delocalized charge carriers. The real and imaginary parts of the refractive index were determined as a function of wavelength. The results are consistent with the increase in conductivity upon the addition of DMSO.

Dielectric Function of Undoped and Doped Poly2-methoxy-5-(3 `,7 `-dimethyloctyloxy)-1,4-phenylene-vinylene] by Ellipsometry in a Wide Spectral Range

Ellipsometric measurements in a wide spectral range (from 0.05 to 6.5 eV) have been carried out on the organic semiconducting polymer, poly2-methoxy-5-(3',7'-dimethyloctyloxy)-1,4-phenylene-vinylene] (MDMO-PPV), in both undoped and doped states. The real and imaginary parts of the dielectric function and the refractive index are determined accurately, provided that the layer thickness is measured independently. After doping, the optical properties show the presence of new peaks, which could be well-resolved by spectroscopic ellipsometry. Also for the doped material, the complex refractive index, with respect to the dielectric function, has been determined. The broadening of the optical transitions is due to the delocalization of polarons at higher doping level. The detailed information about the dielectric function as well as refractive index function obtained by spectroscopic ellipsometry allows not only qualitative but also quantitative description of the optical properties of the undoped/doped polymer. For the direct characterization of the optical properties of MDMO-PPV, ellipsometry turns out to be advantageous compared to conventional reflection and transmission measurements.