Towards socialist reorientation

https://stars.library.ucf.edu/prism/1140/thumbnail.jp

Problems of revolutionary socialism

https://stars.library.ucf.edu/prism/1686/thumbnail.jp

Zur allgemeinen Theorie der halbgeordneten Räume

Foreword by K. Kopotun11Correspondence to: K. Kopotun, Department of Mathematics, University of Manitoba, Winnipeg, Manitoba, Canada ^^IR3T 2N2. Email: [email protected] paper “On the general theory of semi-ordered spaces” (“Zur allgemeinen Theorie der halbgeordneten Räume”) was written by L.V. Kantorovich and G.R. Lorentz22Until 1946, G.G. (Georg Gunter) Lorentz was using the name Geogrij Rudolfovich (G.R.) Lorentz. sometime in 1937–1939, and this is the first time it appears in print.The following is a short history of this manuscript.In his letter to I.P. Natanson written on October 11, 1937, G.G. Lorentz mentioned a talk on joint work with L.V. Kantorovich that he gave at a Session on Functional Analysis in Moscow earlier that year. The records of the Academy of Sciences of USSR indicate that a Session on Functional Analysis took place in Moscow during September 27–29, 1937, and that G.R. Lorentz gave a talk “Topological theory of semi-ordered spaces” there, and that L.V. Kantorovich was speaking on “Theory of linear operations in semi-ordered spaces”.The manuscript “On the general theory of semi-ordered spaces” was found in the archives of L.V. Kantorovich. According to Vsevolod Leonidovich Kantorovich, L.V. Kantorovich’s son, it was submitted to Trudy Tomskogo Gosudarstvennogo Universiteta imeni V. V. Kuibysheva (Proceedings of Tomsk State University). The typed version33See www.math.ohio-state.edu/~nevai/LORENTZ/KANTOROVICH_LORENTZ_typed.pdf/. of the manuscript has a handwritten note by N. Romanov44N.P. Romanov (1907–1972) was a Professor at Tomsk University from 1935 until 1944. After 1944 he worked in Uzbekistan. His main area of research was Number Theory and Theory of Functions of Complex Variables. For more information see “Nikolaĭ Pavlovich Romanov (on the eightieth anniversary of his birth)”, Izv. Akad. Nauk UzSSR Ser. Fiz.-Mat. Nauk 1987, no. 3, 92–93, MR0914654 (89b:01069). dated by August 31, 1939 stating that the manuscript is accepted for publication. The manuscript was never published (probably because of the World War II) and around 1945 was returned to L.V. Kantorovich.It has been decided to publish this manuscript in its original language (German), and translate the extended abstract accompanying this manuscript from Russian to English. The manuscript appears here in its original form with only minor editorial corrections.Publication of this historical document would not have been possible without the assistance and effort of many people. In particular, the significant help of C. de Boor, Ya.I. Fet, V.L. Kantorovich, V.N. Konovalov, and S.S. Kutateladze is acknowledged and greatly appreciated.Extended abstract55Translated from Russian by K. Kopotun.The current manuscript is devoted to the investigation of general semi-ordered spaces that are not necessarily linear. Hence, it may be considered a generalization of the work of L.V. Kantorovich [Linear semi-ordered spaces, Mat. Sbornik, 2 (1) 1937, 121–168].We say that a set Y={y} is a semi-ordered space if its elements are partially ordered using a relation “<” so that I.If y1<y2, y2<y3, then y1<y3.II.For any pair y1, y2, there exist elements y3,y4 such that y3⩽y1, y3⩽y2, y1⩽y4, and y2⩽y4.III.Every set E⊂Y bounded above has a least upper bound (supE).IV.For every set E⊂Y, there exists a countable subset E′ that has the same least upper and greatest lower bound as E. The above assumptions allow us to introduce notions of a limit superior, limit inferior, and of a convergent sequence in Y. For example, define lim¯yn=infn(sup(yn,yn+1,…)). It is possible to introduce, e.g., the limit superior differently, for example, by defining lim¯∗yn to be the least element y having the property that, for any subsequence {ynk}, there exists a subsequence {ynki} such that y⩾lim¯i→∞ynki. This type of convergence, ∗-convergence, turns out to be identical with the topological convergence that we arrive at if we turn Y into a topological space using the convergence defined initially. Relationships among various limits which we can define using the above approaches as well as some properties of these limits are studied in § 1 and § 2. In § 3, we study semi-ordered spaces equipped with a nonnegative metric function ρ(y1,y2) defined for all pairs y1, y2 such that y1⩽y2, and satisfying 1∘.ρ(y1,y2)=0 is equivalent to y1=y2.2∘.ρ(y1,y3)⩽ρ(y1,y2)+ρ(y2,y3) (y1⩽y2⩽y3).3∘.ρ(sup(y,y1),sup(y,y2))⩽ρ(y1,y2) (an analogous inequality holds with inf).4∘.If yn→y monotonically, then ρ(yn,y)→0 (or ρ(y,yn)→0).5∘.If yn monotonically tends to infinity, then the condition limn,m→∞ρ(yn,ym)=0 should not hold.Let ρ(y1,y2,…,yn)=ρ(inf(y1,…,yn),sup(y1,…,yn)). Then yn→y turns out to be equivalent to ρ(y,yn,…,yn+p)→0 when n→∞, and yn→y(∗) is equivalent to ρ(y,yn)→0. In addition, Cauchy’s convergence principle holds. Moreover, if Y is distributive, i.e., inf(y,sup(y1,y2))=sup(inf(y,y1),inf(y,y2)), then it is also strongly distributive: inf(y,supnyn)=supn(inf(y,yn)). In § 4, we study similar spaces under weaker assumptions. Particular examples of such spaces are the Hausdorff space of closed sets (see Hausdorff “Set theory”, p. 165) and the space of semicontinuous functions. § 5 is devoted to applications of the general theorems to the theory of semicontinuous functions y=f(x) that map a metric space {x}=X into a semi-ordered space {y}=Y. Under some additional assumptions (Y is regular, distributive, and between any two elements y1 and y2 such that y1<y2 there is a third element y3, y1<y3<y2) it is possible to develop a complete theory of semicontinuous functions including a theorem that every semicontinuous function is a limit of a monotone sequence of continuous functions as well a theorem on separation by a continuous function

Position paper on realizing smart products: challenges for Semantic Web technologies

In the rapidly developing space of novel technologies that combine sensing and semantic technologies, research on smart products has the potential of establishing a research field in itself. In this paper, we synthesize existing work in this area in order to define and characterize smart products. We then reflect on a set of challenges that semantic technologies are likely to face in this domain. Finally, in order to initiate discussion in the workshop, we sketch an initial comparison of smart products and semantic sensor networks from the perspective of knowledge technologies

Fully Dynamic Matching in Bipartite Graphs

Maximum cardinality matching in bipartite graphs is an important and well-studied problem. The fully dynamic version, in which edges are inserted and deleted over time has also been the subject of much attention. Existing algorithms for dynamic matching (in general graphs) seem to fall into two groups: there are fast (mostly randomized) algorithms that do not achieve a better than 2-approximation, and there slow algorithms with \O(\sqrt{m}) update time that achieve a better-than-2 approximation. Thus the obvious question is whether we can design an algorithm -- deterministic or randomized -- that achieves a tradeoff between these two: a $o(\sqrt{m})$ approximation and a better-than-2 approximation simultaneously. We answer this question in the affirmative for bipartite graphs. Our main result is a fully dynamic algorithm that maintains a 3/2 + \eps approximation in worst-case update time O(m^{1/4}\eps^{/2.5}). We also give stronger results for graphs whose arboricity is at most \al, achieving a (1+ \eps) approximation in worst-case time O(\al (\al + \log n)) for constant \eps. When the arboricity is constant, this bound is $O(\log n)$ and when the arboricity is polylogarithmic the update time is also polylogarithmic. The most important technical developement is the use of an intermediate graph we call an edge degree constrained subgraph (EDCS). This graph places constraints on the sum of the degrees of the endpoints of each edge: upper bounds for matched edges and lower bounds for unmatched edges. The main technical content of our paper involves showing both how to maintain an EDCS dynamically and that and EDCS always contains a sufficiently large matching. We also make use of graph orientations to help bound the amount of work done during each update.Comment: Longer version of paper that appears in ICALP 201

Annual Report of the Municipal Officers of the Town of Lubec, Maine For the Year Ending March 1, 1913

\u3cp\u3eDesigners are frequently challenged by complex projects in which the problem space is unique, rapidly changing, and the information available is limited. In such cases, combining knowledge from different fields of expertise is required. Furthermore, collaboration during the design process is essential for achieving a meaningful and well-formed solution. Designers therefore regularly find themselves exchanging ideas and reflections in the form of emails, sketches, and images with a group of experts from different backgrounds, working altogether through the creation of a design, its development and proper implementation. This particular chapter focuses especially on issues of synchronous and asynchronous collaboration, team dynamics and the management and monitoring of the early stages of the design process. The overall aim is to identify the essential characteristics and needs of distributed teams when in remote collaboration during the early stages of the design process and to suggest a prototype environment based on the identified requirements and workflow.\u3c/p\u3

Decision Support Tool to Enable Real-Time Data-Driven Building Energy Retrofitting Design

The availability of near-real-time data on energy performance is opening new opportunities to optimize buildings&rsquo; energy efficiency and flexibility capabilities and to support the decision-making and planning process of building retrofitting infrastructure investment. Existing tools can support retrofitting design and energy performance contracting. However, there are well-recognized shortcomings of these tools related to their usability, complexity, and ability to perform calculations based on the real-time energy performance of buildings. To address this gap, the advanced retrofitting decision support tool is developed and presented in this study. The strengths of our solution rely on easy usability, accuracy, and transparency of results. The automatic collection of real-time building energy consumption data gathered from the building management systems, combined with data analytics techniques, ensures ease of use and quickness of calculation. These results support step-by-step thinking for retrofitting design and hopefully enable a larger utilization rate for deep building retrofits