Mosse family photo collage for the wedding of Hans and Licie Mosse; family shown in blimp floating over Grosse Berliner Strasse; Berlin Portraits; Family

Verso: Die Anfahrt der Gaeste zur Hochzeitsfeier von Hans u. Licie am 10. Oktober 1909

Photo collage, food donations; Juedische Winterhilfe der Juedische Gemeinde; Berlin Jewish Institutions

"wurden fuer die Pfundspende gekauft. die Pfundspende gab 15000 Pakete aus und hatte 1300 ehrenamtliche Helfer"

Photo collage of audiences at cultural performances; Juedische Winterhilfe der Juedische Gemeinde; Berlin Jewish Institutions

"50 Veranstaltungen der 'Seelischen Winterhilfe' wurden von 24000 Betreuten besucht"

Photo collage of children with toys and menorah in background; Juedische Winterhilfe der Juedische Gemeinde; Berlin Jewish Institutions

"3615 Kinder wurden zu Chanukka mit Bekleidung im Gesamtwertvon: 40000 Mark bedacht und erhielten fuer 2000 Mark Spielzeung und Suessigkeiten"

Georg and Hildegard Lewin Collection photo and autograph album Album

Includes F 34652a - F 34699

Information sharing in distance collaboration: A software engineering perspective

Information sharing in distance collaboration: A software engineering perspective, QueenslandFactors in software engineering workgroups such as geographical dispersion and background discipline can be conceptually characterized as "distances", and they are obstructive to team collaboration and information sharing. This thesis focuses on information sharing across multidimensional distances and develops an information sharing distance model, with six core dimensions: geography, time zone, organization, multi-discipline, heterogeneous roles, and varying project tenure. The research suggests that the effectiveness of workgroups may be improved through mindful conducts of information sharing, especially proactive consideration of, and explicit adjustment for, the distances of the recipient when sharing information.

Negative photo map of Jewish settlements in the Krivoy Rog district

Digital image

Multi-user resource-sharing problem for the Internet

In this thesis we study a series of multi-user resource-sharing problems for the Internet, which involve distribution of a common resource among participants of multi-user systems (servers or networks). We study concurrently accessible resources, which for end-users may be exclusively accessible or non-exclusively. For all kinds we suggest a separate algorithm or a modification of common reputation scheme. Every algorithm or method is studied from different perspectives: optimality of protocols, selfishness of end users, fairness of the protocol for end users. On the one hand the multifaceted analysis allows us to select the most suited protocols among a set of various available ones based on trade-offs of optima criteria. On the other hand, the future Internet predictions dictate new rules for the optimality we should take into account and new properties of the networks that cannot be neglected anymore. In this thesis we have studied new protocols for such resource-sharing problems as the backoff protocol, defense mechanisms against Denial-of-Service, fairness and confidentiality for users in overlay networks. For backoff protocol we present analysis of a general backoff scheme, where an optimization is applied to a general-view backoff function. It leads to an optimality condition for backoff protocols in both slot times and continuous time models. Additionally we present an extension for the backoff scheme in order to achieve fairness for the participants in an unfair environment, such as wireless signal strengths. Finally, for the backoff algorithm we suggest a reputation scheme that deals with misbehaving nodes. For the next problem -- denial-of-service attacks, we suggest two schemes that deal with the malicious behavior for two conditions: forged identities and unspoofed identities. For the first one we suggest a novel most-knocked-first-served algorithm, while for the latter we apply a reputation mechanism in order to restrict resource access for misbehaving nodes. Finally, we study the reputation scheme for the overlays and peer-to-peer networks, where resource is not placed on a common station, but spread across the network. The theoretical analysis suggests what behavior will be selected by the end station under such a reputation mechanism.

Designing for collections : Building histories, sharing the spectacle

The hobby of collecting represents the passionate acquisition and possession of a specific type(s) of object; creating a ‘spectacle’, to be shared with others. The fundamentality of the physical objects in collections against the backdrop of the growing ubiquity of computing provides a unique and compelling avenue for design. Based on interviews with 11 self-identified collectors, this paper discusses the role collectors have in informing HCI design and in turn, the potential HCI has in designing technology to assist collectors in sharing what we term the ‘spectacle’ of collecting. Toward this, we suggest two ideas for future designs, including building personal histories of individual collectable items and developing a simple digital means of connecting proximate collectors with those who stand to benefit from collectors’ unique and item-specific knowledge.

A numerical method for separation of stresses in photo-orthotropic elasticity

A numerical method is suggested for separation of stresses in photo-orthotropic elasticity using the numerical solution of compatibility equation for orthotropic case. The compatibility equation is written in terms of a stress parameter S analogous to the sum of principal stresses in two-dimensional isotropic case. The solution of this equation provides a relation between the normal stresses. The photoelastic data give the shear stress and another relation between the two normal stresses. The accuracy of the numerical method and its application to practical problems are illustrated with examples.

Things you don't want to know about yourself: Ambivalence about tracking and sharing personal information for behaviour change

Technologies that facilitate the collection and sharing of personal information can feed people's desire for enhanced self-knowledge and help them to change their behaviour, yet for various reasons people can also be reluctant to use such technologies. This paper explores this tension through an interview study in the context of smoking cessation. Our findings show that smokers and recent ex-smokers were ambivalent about their behaviour change as well as about collecting personal information through technology and sharing it with other users. We close with a summary of three challenges emerging from such ambivalence and directions to address them.

Three-User Cognitive Channels with Cumulative Message Sharing: An Achievable Rate Region

In this paper, an achievable rate region for the three-user discrete memoryless interference channel with asymmetric transmitter cooperation is derived. The three-user channel facilitates different ways of message sharing between the transmitters. We introduce a manner of noncausal (genie aided) unidirectional message-sharing, which we term cumulative message sharing. We consider receivers with predetermined decoding capabilities, and define a cognitive interference channel. We then derive an achievable rate region for this channel by employing a coding scheme which is a combination of superposition and Gel'fand-Pinsker coding techniques.

Is it tweet-worthy? Privacy in a time of sharing.

Information professionals and information organisations use Twitter in a variety of ways. Typically both organisations and the individuals that work for them have separate identities on Twitter, but often individuals identify their organization through their profile or Twitter content. This paper considers the way information professionals use Twitter and their practices with regard to privacy, personal disclosure and identifying their organisational affiliations. Drawing on data from a research study involving a questionnaire and social media observation, the paper will provoke discussion about information professionals’ use of Twitter, personal and organizational identity, and the value of Twitter for professional development. In keeping with the subject matter, a curated set of social media content will be available in lieu of a formal paper.

Conceptualising social media support for tacit knowledge sharing: physicians’ perspectives and experiences

Purpose – This paper aims to explore the potential contributions of social media in supporting tacit knowledge sharing, according to the physicians’ perspectives and experiences. Design/methodology/approach – Adopting a qualitative survey design, 24 physicians were interviewed. Purposive and snowball sampling were used to select the participants. Thematic analysis approach was used for data analysis. Findings – The study revealed five major themes and over 20 sub-themes as potential contributions of social media to tacit knowledge flow among physicians. The themes included socialising, practising, networking, storytelling and encountering. In addition, with the help of the literature and the supporting data, the study proposed a conceptual model that explains the potential contribution of social media to tacit knowledge sharing. Research limitations/implications – The study had both theoretical (the difficulty of distinguishing tacit and explicit knowledge in practice) and practical limitations (small sample size). The study findings have implications for the healthcare industry whose clinical teams are not always physically co-located but must exchange their critical experiential and tacit knowledge. Originality/value – The study has opened up a new discussion of this area by demonstrating and conceptualising how social media tools may facilitate tacit knowledge sharing.

Cost Sharing Mechanisms for Business Clusters with Strategic Firms

A business cluster is a co-located group of micro, small, medium scale enterprises. Such firms can benefit significantly from their co-location through shared infrastructure and shared services. Cost sharing becomes an important issue in such sharing arrangements especially when the firms exhibit strategic behavior. There are many cost sharing methods and mechanisms proposed in the literature based on game theoretic foundations. These mechanisms satisfy a variety of efficiency and fairness properties such as allocative efficiency, budget balance, individual rationality, consumer sovereignty, strategyproofness, and group strategyproofness. In this paper, we motivate the problem of cost sharing in a business cluster with strategic firms and illustrate different cost sharing mechanisms through the example of a cluster of firms sharing a logistics service. Next we look into the problem of a business cluster sharing ICT (information and communication technologies) infrastructure and explore the use of cost sharing mechanisms.